java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:10:34,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:10:34,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:10:34,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:10:34,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:10:34,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:10:34,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:10:34,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:10:34,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:10:34,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:10:34,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:10:34,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:10:34,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:10:34,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:10:34,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:10:34,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:10:34,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:10:34,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:10:34,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:10:34,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:10:34,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:10:34,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:10:34,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:10:34,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:10:34,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:10:34,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:10:34,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:10:34,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:10:34,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:10:34,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:10:34,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:10:34,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:10:34,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:10:34,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:10:34,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:10:34,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:10:34,381 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:10:34,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:10:34,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:10:34,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:10:34,401 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:10:34,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:10:34,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:10:34,402 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:10:34,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:10:34,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:10:34,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:10:34,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:10:34,468 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:10:34,469 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:10:34,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 08:10:34,469 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-09-26 08:10:34,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:10:34,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:10:34,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:34,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:10:34,532 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:10:34,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:34,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:10:34,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:10:34,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:10:34,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:10:34,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:10:34,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:10:34,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:10:34,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/1) ... [2018-09-26 08:10:34,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:10:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:10:34,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:10:34,888 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:10:34,891 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:34 BoogieIcfgContainer [2018-09-26 08:10:34,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:10:34,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:10:34,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:10:34,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:10:34,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:34" (1/2) ... [2018-09-26 08:10:34,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa4e9ab and model type gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:10:34, skipping insertion in model container [2018-09-26 08:10:34,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:34" (2/2) ... [2018-09-26 08:10:34,901 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 08:10:34,914 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:10:34,925 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:10:34,975 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:10:34,976 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:10:34,976 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:10:34,976 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:10:34,976 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:10:34,977 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:10:34,977 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:10:34,977 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:10:34,977 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:10:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:10:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:10:35,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:10:35,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash 942136, now seen corresponding path program 1 times [2018-09-26 08:10:35,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:35,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:10:35,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:35,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:35,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:35,144 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-26 08:10:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,205 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-26 08:10:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:35,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:10:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,221 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:10:35,221 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:10:35,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:10:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-09-26 08:10:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:10:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:10:35,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:10:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,269 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:10:35,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:10:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:10:35,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,270 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:10:35,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash 905456478, now seen corresponding path program 1 times [2018-09-26 08:10:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:35,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:35,324 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-09-26 08:10:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,412 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:10:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:35,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-09-26 08:10:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,416 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:10:35,416 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:10:35,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:10:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-26 08:10:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:10:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:10:35,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:10:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,426 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:10:35,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:10:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:35,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,427 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:10:35,427 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1734621948, now seen corresponding path program 2 times [2018-09-26 08:10:35,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:35,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:35,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:35,499 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 08:10:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,591 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:10:35,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:35,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 08:10:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,593 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:10:35,593 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:10:35,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:10:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-26 08:10:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:10:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:10:35,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:10:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,599 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:10:35,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:10:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:10:35,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,600 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:10:35,600 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -524317398, now seen corresponding path program 3 times [2018-09-26 08:10:35,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:35,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:35,675 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-09-26 08:10:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,770 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:10:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:35,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:10:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,771 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:10:35,772 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:10:35,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:10:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-26 08:10:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:10:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:10:35,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:10:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,783 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:10:35,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:10:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:10:35,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,784 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:10:35,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1357782064, now seen corresponding path program 4 times [2018-09-26 08:10:35,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:35,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:35,864 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 08:10:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:35,959 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:10:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:35,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:10:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:35,960 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:10:35,960 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:10:35,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:10:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-26 08:10:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:10:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:10:35,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:10:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:35,967 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:10:35,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:10:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:10:35,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:35,968 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:10:35,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:35,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:35,969 INFO L82 PathProgramCache]: Analyzing trace with hash 841558262, now seen corresponding path program 5 times [2018-09-26 08:10:35,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:36,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:36,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:36,033 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-09-26 08:10:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,139 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:10:36,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:36,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-09-26 08:10:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,141 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:10:36,141 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:10:36,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:10:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 08:10:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:10:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:10:36,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:10:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,148 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:10:36,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:10:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:10:36,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,149 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:10:36,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1283701916, now seen corresponding path program 6 times [2018-09-26 08:10:36,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:36,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:36,189 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 08:10:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,291 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:10:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:36,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 08:10:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,293 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:10:36,293 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:10:36,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:10:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-09-26 08:10:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:10:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:10:36,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:10:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,306 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:10:36,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:10:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:10:36,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,307 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:10:36,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 981991106, now seen corresponding path program 7 times [2018-09-26 08:10:36,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:36,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:36,350 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-09-26 08:10:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,444 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:10:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:36,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:10:36,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,450 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:10:36,450 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:10:36,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:10:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-26 08:10:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:10:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:10:36,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:10:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,459 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:10:36,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:10:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:10:36,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,464 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:10:36,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1199288472, now seen corresponding path program 8 times [2018-09-26 08:10:36,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:36,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:36,523 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 08:10:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,635 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:10:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:10:36,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:10:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,636 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:10:36,638 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:10:36,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=293, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:10:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-26 08:10:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:10:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:10:36,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:10:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,647 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:10:36,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:10:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:10:36,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,651 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:10:36,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1464922482, now seen corresponding path program 9 times [2018-09-26 08:10:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:36,720 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-09-26 08:10:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:36,825 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:10:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:36,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-09-26 08:10:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:36,827 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:10:36,827 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:10:36,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=350, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:10:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-26 08:10:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:10:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:10:36,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:10:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:36,838 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:10:36,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:10:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:10:36,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:36,840 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:10:36,840 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:36,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash 958831668, now seen corresponding path program 10 times [2018-09-26 08:10:36,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:36,914 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:36,914 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:36,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:36,917 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 08:10:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,032 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:10:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:10:37,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 08:10:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,036 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:10:37,036 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:10:37,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:10:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-09-26 08:10:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:10:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:10:37,049 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:10:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,050 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:10:37,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:10:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:10:37,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,052 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:10:37,053 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1980671910, now seen corresponding path program 11 times [2018-09-26 08:10:37,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:10:37,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:10:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:10:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:37,132 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-09-26 08:10:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,239 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:10:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:10:37,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-26 08:10:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,240 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:10:37,240 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:10:37,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=277, Invalid=479, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:10:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 08:10:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:10:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:10:37,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:10:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,250 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:10:37,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:10:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:10:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:10:37,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,251 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:10:37,256 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -755129600, now seen corresponding path program 12 times [2018-09-26 08:10:37,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:37,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:37,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:37,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:37,346 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 08:10:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,479 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:10:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:10:37,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 08:10:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,481 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:10:37,481 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:10:37,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:10:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-09-26 08:10:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:10:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:10:37,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:10:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,495 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:10:37,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:10:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:10:37,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,496 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:10:37,501 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,502 INFO L82 PathProgramCache]: Analyzing trace with hash 169991206, now seen corresponding path program 13 times [2018-09-26 08:10:37,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:37,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:37,576 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-09-26 08:10:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,713 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:10:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:10:37,714 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-09-26 08:10:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,714 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:10:37,714 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:10:37,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=364, Invalid=628, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:10:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-26 08:10:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:10:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:10:37,728 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:10:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,729 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:10:37,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:10:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:10:37,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,732 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:10:37,732 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 152855500, now seen corresponding path program 14 times [2018-09-26 08:10:37,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:37,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:37,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:37,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:37,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:37,827 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 08:10:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,980 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:10:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:10:37,980 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 08:10:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,981 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:10:37,981 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:10:37,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=412, Invalid=710, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:10:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-09-26 08:10:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:10:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:10:37,989 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:10:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,990 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:10:37,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:10:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:10:37,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,992 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:10:37,992 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash 865311218, now seen corresponding path program 15 times [2018-09-26 08:10:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:10:38,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:10:38,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:10:38,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:38,080 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-09-26 08:10:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,220 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:10:38,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:38,221 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-09-26 08:10:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,221 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:10:38,222 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:10:38,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=463, Invalid=797, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:10:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-26 08:10:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:10:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:10:38,229 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:10:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,230 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:10:38,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:10:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:10:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:10:38,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,232 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:10:38,232 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1659511144, now seen corresponding path program 16 times [2018-09-26 08:10:38,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:10:38,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:10:38,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:10:38,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:38,312 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 08:10:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,468 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:10:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:38,468 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 08:10:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,469 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:10:38,469 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:10:38,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=517, Invalid=889, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:10:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-09-26 08:10:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:10:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:10:38,483 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:10:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,484 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:10:38,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:10:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:10:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:10:38,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,485 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:10:38,493 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1357278786, now seen corresponding path program 17 times [2018-09-26 08:10:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:10:38,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:10:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:10:38,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:38,594 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-09-26 08:10:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:38,748 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:10:38,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:10:38,748 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-09-26 08:10:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:38,749 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:10:38,749 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:10:38,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=574, Invalid=986, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:10:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-26 08:10:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:10:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:10:38,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:10:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:38,759 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:10:38,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:10:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:10:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:10:38,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:38,760 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:10:38,766 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:38,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1325208420, now seen corresponding path program 18 times [2018-09-26 08:10:38,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:38,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:38,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:10:38,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:10:38,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:10:38,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:38,878 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-26 08:10:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,047 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:10:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:10:39,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-26 08:10:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,048 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:10:39,048 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:10:39,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=634, Invalid=1088, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:10:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:10:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-09-26 08:10:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:10:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:10:39,061 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:10:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,061 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:10:39,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:10:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:10:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:10:39,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,064 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:10:39,064 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2079931510, now seen corresponding path program 19 times [2018-09-26 08:10:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:10:39,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:10:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:10:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:39,173 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-09-26 08:10:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,352 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:10:39,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:39,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-09-26 08:10:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,353 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:10:39,354 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:10:39,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=697, Invalid=1195, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:10:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-26 08:10:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:10:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:10:39,365 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:10:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,369 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:10:39,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:10:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:10:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:10:39,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,370 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:10:39,371 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1654324688, now seen corresponding path program 20 times [2018-09-26 08:10:39,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:10:39,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:10:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:10:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:39,510 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-26 08:10:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:39,741 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:10:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:10:39,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 08:10:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:39,742 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:10:39,742 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:10:39,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=763, Invalid=1307, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:10:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:10:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-09-26 08:10:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:10:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:10:39,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:10:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:10:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:10:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:10:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:10:39,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:39,755 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:10:39,755 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:39,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:39,755 INFO L82 PathProgramCache]: Analyzing trace with hash -668061866, now seen corresponding path program 21 times [2018-09-26 08:10:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:10:39,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:10:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:10:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:10:39,853 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2018-09-26 08:10:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,036 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:10:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:40,036 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-09-26 08:10:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,037 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:10:40,037 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:10:40,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=832, Invalid=1424, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:10:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:10:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-26 08:10:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:10:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:10:40,047 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:10:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,048 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:10:40,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:10:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:10:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:10:40,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,049 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:10:40,049 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2057262340, now seen corresponding path program 22 times [2018-09-26 08:10:40,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:10:40,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:10:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:10:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:40,150 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-26 08:10:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,347 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:10:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:10:40,347 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-26 08:10:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,348 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:10:40,348 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:10:40,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=904, Invalid=1546, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:10:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:10:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-09-26 08:10:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:10:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:10:40,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:10:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,365 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:10:40,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:10:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:10:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:10:40,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,369 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:10:40,370 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1344088798, now seen corresponding path program 23 times [2018-09-26 08:10:40,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:10:40,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:10:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:10:40,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:10:40,480 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2018-09-26 08:10:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:40,697 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:10:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:40,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-09-26 08:10:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:40,698 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:10:40,698 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:10:40,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=979, Invalid=1673, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:10:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:10:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 08:10:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:10:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:10:40,706 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:10:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,706 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:10:40,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:10:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:10:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:10:40,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,707 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:10:40,707 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1115885000, now seen corresponding path program 24 times [2018-09-26 08:10:40,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,809 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:10:40,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:10:40,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:10:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:40,812 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-26 08:10:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,014 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:10:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:10:41,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-26 08:10:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,015 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:10:41,016 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:10:41,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1057, Invalid=1805, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:10:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:10:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-09-26 08:10:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:10:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:10:41,026 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:10:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,026 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:10:41,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:10:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:10:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:10:41,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,027 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:10:41,027 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1376275218, now seen corresponding path program 25 times [2018-09-26 08:10:41,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:10:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:10:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:10:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:41,151 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2018-09-26 08:10:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,356 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:10:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:10:41,356 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-09-26 08:10:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,357 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:10:41,357 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:10:41,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1138, Invalid=1942, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:10:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:10:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-26 08:10:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:10:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:10:41,367 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:10:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,367 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:10:41,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:10:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:10:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:10:41,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,368 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:10:41,368 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash 249506452, now seen corresponding path program 26 times [2018-09-26 08:10:41,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:10:41,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:10:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:10:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=488, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:41,480 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-26 08:10:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,709 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:10:41,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:10:41,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-26 08:10:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,711 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:10:41,711 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:10:41,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1222, Invalid=2084, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:10:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:10:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-09-26 08:10:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:10:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:10:41,718 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:10:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,718 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:10:41,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:10:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:10:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:10:41,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,719 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:10:41,720 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash -742404422, now seen corresponding path program 27 times [2018-09-26 08:10:41,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:41,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:41,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:10:41,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:10:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:10:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:41,838 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2018-09-26 08:10:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,063 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:10:42,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:10:42,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-09-26 08:10:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,064 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:10:42,064 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:10:42,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1309, Invalid=2231, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:10:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:10:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 08:10:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:10:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:10:42,072 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:10:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,072 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:10:42,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:10:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:10:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:10:42,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,073 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:10:42,073 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -486014624, now seen corresponding path program 28 times [2018-09-26 08:10:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:10:42,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:10:42,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:10:42,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:42,211 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-26 08:10:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,480 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:10:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:10:42,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-26 08:10:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,482 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:10:42,482 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:10:42,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1399, Invalid=2383, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:10:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:10:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-09-26 08:10:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:10:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:10:42,492 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:10:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,493 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:10:42,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:10:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:10:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:10:42,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,494 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:10:42,494 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1091445382, now seen corresponding path program 29 times [2018-09-26 08:10:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:10:42,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:10:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:10:42,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:42,643 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-09-26 08:10:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:42,891 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:10:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:10:42,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-09-26 08:10:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:42,892 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:10:42,892 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:10:42,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1492, Invalid=2540, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:10:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:10:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-26 08:10:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:10:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:10:42,901 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:10:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:42,902 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:10:42,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:10:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:10:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:10:42,902 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:42,903 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:10:42,903 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:42,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 907055660, now seen corresponding path program 30 times [2018-09-26 08:10:42,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:10:43,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:10:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:10:43,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=622, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:43,009 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-26 08:10:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,201 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:10:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:10:43,201 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-26 08:10:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,202 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:10:43,202 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:10:43,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1588, Invalid=2702, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:10:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:10:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-09-26 08:10:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:10:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:10:43,210 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:10:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,210 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:10:43,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:10:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:10:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:10:43,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,211 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:10:43,211 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,212 INFO L82 PathProgramCache]: Analyzing trace with hash -197808046, now seen corresponding path program 31 times [2018-09-26 08:10:43,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:10:43,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:10:43,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:10:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:43,320 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2018-09-26 08:10:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,532 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:10:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:10:43,533 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-09-26 08:10:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,533 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:10:43,534 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:10:43,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1687, Invalid=2869, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:10:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:10:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-26 08:10:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:10:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:10:43,541 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:10:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,541 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:10:43,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:10:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:10:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:10:43,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,542 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:10:43,543 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1114907400, now seen corresponding path program 32 times [2018-09-26 08:10:43,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:43,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:43,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:10:43,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:10:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:10:43,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=695, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:43,656 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-26 08:10:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,881 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:10:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:10:43,882 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-26 08:10:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,882 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:10:43,883 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:10:43,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1789, Invalid=3041, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:10:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:10:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-09-26 08:10:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:10:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:10:43,890 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:10:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:43,891 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:10:43,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:10:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:10:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:10:43,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:43,892 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:10:43,892 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:43,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1979090914, now seen corresponding path program 33 times [2018-09-26 08:10:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:10:44,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:10:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:10:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=733, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:44,010 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2018-09-26 08:10:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,248 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:10:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:10:44,248 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-09-26 08:10:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,249 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:10:44,249 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:10:44,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1894, Invalid=3218, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:10:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:10:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-26 08:10:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:10:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:10:44,257 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:10:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,257 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:10:44,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:10:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:10:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:10:44,258 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,258 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:10:44,259 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,259 INFO L82 PathProgramCache]: Analyzing trace with hash 764207556, now seen corresponding path program 34 times [2018-09-26 08:10:44,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:10:44,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:10:44,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:10:44,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:44,380 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-26 08:10:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,630 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:10:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:10:44,630 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-26 08:10:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,631 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:10:44,632 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:10:44,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2002, Invalid=3400, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:10:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:10:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-09-26 08:10:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:10:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:10:44,640 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:10:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,640 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:10:44,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:10:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:10:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:10:44,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,641 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:10:44,641 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,642 INFO L82 PathProgramCache]: Analyzing trace with hash -35882518, now seen corresponding path program 35 times [2018-09-26 08:10:44,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:44,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:10:44,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:10:44,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:10:44,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:44,771 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2018-09-26 08:10:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,043 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:10:45,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:10:45,043 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-09-26 08:10:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,044 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:10:45,044 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:10:45,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2113, Invalid=3587, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:10:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:10:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-26 08:10:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:10:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:10:45,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:10:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,053 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:10:45,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:10:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:10:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:10:45,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,054 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:10:45,055 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -123297648, now seen corresponding path program 36 times [2018-09-26 08:10:45,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:10:45,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:10:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:10:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=853, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:45,202 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-26 08:10:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,515 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:10:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:10:45,515 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-26 08:10:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,516 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:10:45,516 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:10:45,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2227, Invalid=3779, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:10:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:10:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-09-26 08:10:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:10:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:10:45,525 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:10:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,526 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:10:45,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:10:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:10:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:10:45,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,527 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:10:45,528 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1770108342, now seen corresponding path program 37 times [2018-09-26 08:10:45,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:10:45,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:10:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:10:45,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:10:45,702 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2018-09-26 08:10:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,930 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:10:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:10:45,931 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-09-26 08:10:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,931 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:10:45,932 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:10:45,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2344, Invalid=3976, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:10:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:10:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-26 08:10:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:10:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:10:45,941 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:10:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,941 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:10:45,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:10:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:10:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:10:45,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,942 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:10:45,943 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash 267131228, now seen corresponding path program 38 times [2018-09-26 08:10:45,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:10:46,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:10:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:10:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=938, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:10:46,067 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-26 08:10:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,337 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:10:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:10:46,337 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 08:10:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,338 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:10:46,338 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:10:46,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2464, Invalid=4178, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:10:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:10:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-09-26 08:10:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:10:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:10:46,346 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:10:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,346 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:10:46,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:10:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:10:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:10:46,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,347 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:10:46,348 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,348 INFO L82 PathProgramCache]: Analyzing trace with hash -984863870, now seen corresponding path program 39 times [2018-09-26 08:10:46,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:10:46,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:10:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:10:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=982, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:10:46,484 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-09-26 08:10:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,761 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:10:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:10:46,762 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-09-26 08:10:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,763 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:10:46,763 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:10:46,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2587, Invalid=4385, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:10:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:10:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-26 08:10:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:10:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:10:46,771 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:10:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,771 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:10:46,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:10:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:10:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:10:46,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,772 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:10:46,773 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1561310168, now seen corresponding path program 40 times [2018-09-26 08:10:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:10:46,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:10:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:10:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:10:46,909 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-26 08:10:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,192 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:10:47,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:10:47,192 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-26 08:10:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,193 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:10:47,193 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:10:47,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2713, Invalid=4597, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:10:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:10:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-09-26 08:10:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:10:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:10:47,201 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:10:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,201 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:10:47,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:10:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:10:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:10:47,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,203 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:10:47,203 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1475421362, now seen corresponding path program 41 times [2018-09-26 08:10:47,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,339 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:10:47,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:10:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:10:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:10:47,340 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2018-09-26 08:10:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,664 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:10:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:10:47,665 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-09-26 08:10:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,666 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:10:47,666 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:10:47,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2842, Invalid=4814, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:10:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:10:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-26 08:10:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:10:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:10:47,675 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:10:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,675 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:10:47,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:10:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:10:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:10:47,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,676 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:10:47,677 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash -540657420, now seen corresponding path program 42 times [2018-09-26 08:10:47,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:47,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:10:47,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:10:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:10:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=1120, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:10:47,832 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-26 08:10:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,179 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:10:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:10:48,179 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-26 08:10:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,180 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:10:48,180 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:10:48,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2974, Invalid=5036, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:10:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:10:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-09-26 08:10:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:10:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:10:48,191 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:10:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,192 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:10:48,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:10:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:10:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:10:48,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,193 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:10:48,193 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 119325978, now seen corresponding path program 43 times [2018-09-26 08:10:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:10:48,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:10:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:10:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:10:48,384 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2018-09-26 08:10:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,836 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:10:48,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:10:48,837 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-09-26 08:10:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,837 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:10:48,838 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:10:48,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3109, Invalid=5263, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:10:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:10:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-26 08:10:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:10:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:10:48,846 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:10:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,846 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:10:48,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:10:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:10:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:10:48,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,848 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:10:48,848 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1291788352, now seen corresponding path program 44 times [2018-09-26 08:10:48,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:10:48,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:10:48,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:10:48,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=1217, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:10:48,999 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-26 08:10:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,313 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:10:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:10:49,313 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-26 08:10:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,314 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:10:49,314 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:10:49,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3247, Invalid=5495, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:10:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:10:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-09-26 08:10:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:10:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:10:49,323 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:10:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,324 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:10:49,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:10:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:10:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:10:49,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,325 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:10:49,326 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash -162993946, now seen corresponding path program 45 times [2018-09-26 08:10:49,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:10:49,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:10:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:10:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1267, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:10:49,480 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2018-09-26 08:10:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,811 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:10:49,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:10:49,811 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-09-26 08:10:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,812 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:10:49,812 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:10:49,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3388, Invalid=5732, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:10:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:10:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-26 08:10:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:10:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:10:49,821 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:10:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,821 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:10:49,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:10:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:10:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:10:49,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,823 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:10:49,823 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2018295668, now seen corresponding path program 46 times [2018-09-26 08:10:49,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:49,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:10:49,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:10:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:10:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:10:49,980 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-26 08:10:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,316 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:10:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:10:50,317 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 08:10:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,318 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:10:50,318 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:10:50,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3532, Invalid=5974, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:10:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:10:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-09-26 08:10:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:10:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:10:50,327 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:10:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,327 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:10:50,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:10:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:10:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:10:50,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,328 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:10:50,328 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1743144626, now seen corresponding path program 47 times [2018-09-26 08:10:50,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:50,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:10:50,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:10:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:10:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:10:50,494 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2018-09-26 08:10:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,857 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:10:50,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:10:50,858 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-09-26 08:10:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,859 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:10:50,859 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:10:50,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3679, Invalid=6221, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:10:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:10:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-26 08:10:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:10:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:10:50,870 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:10:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,870 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:10:50,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:10:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:10:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:10:50,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,871 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:10:50,872 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,872 INFO L82 PathProgramCache]: Analyzing trace with hash 124803928, now seen corresponding path program 48 times [2018-09-26 08:10:50,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:51,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:10:51,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:10:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:10:51,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=1423, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:10:51,045 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-26 08:10:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,415 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:10:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:10:51,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-26 08:10:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,416 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:10:51,416 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:10:51,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3829, Invalid=6473, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:10:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:10:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-09-26 08:10:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:10:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:10:51,425 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:10:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:10:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:10:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:10:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:10:51,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,427 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:10:51,427 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -322445698, now seen corresponding path program 49 times [2018-09-26 08:10:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:51,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:10:51,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:10:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:10:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:10:51,651 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2018-09-26 08:10:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,983 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:10:51,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:10:51,983 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-09-26 08:10:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,984 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:10:51,984 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:10:51,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3982, Invalid=6730, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:10:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:10:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-26 08:10:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:10:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:10:51,993 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:10:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,993 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:10:51,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:10:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:10:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:10:51,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,994 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:10:51,995 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash -632606684, now seen corresponding path program 50 times [2018-09-26 08:10:51,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,211 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:10:52,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:10:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:10:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1283, Invalid=1579, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:10:52,213 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-26 08:10:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:52,558 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:10:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:10:52,558 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-26 08:10:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:52,559 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:10:52,560 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:10:52,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4037, Invalid=6883, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:10:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:10:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:10:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:10:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:10:52,576 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:10:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:52,577 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:10:52,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:10:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:10:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:10:52,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:52,578 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:10:52,578 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:52,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1950396490, now seen corresponding path program 51 times [2018-09-26 08:10:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:10:52,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:10:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:10:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3069, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:10:52,913 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 57 states. [2018-09-26 08:10:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,827 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:10:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:10:53,827 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 106 [2018-09-26 08:10:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,828 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:10:53,829 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:10:53,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=10968, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:10:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:10:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:10:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:10:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:10:53,839 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:10:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,840 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:10:53,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:10:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:10:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:10:53,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,841 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:10:53,841 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1725349616, now seen corresponding path program 52 times [2018-09-26 08:10:53,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:10:54,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:10:54,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:10:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5336, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:10:54,421 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 75 states. [2018-09-26 08:10:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,189 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:10:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:10:55,189 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 108 [2018-09-26 08:10:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,190 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:10:55,190 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:10:55,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=5480, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:10:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:10:55,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-09-26 08:10:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:10:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:10:55,201 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:10:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,202 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:10:55,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:10:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:10:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:10:55,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,203 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:10:55,203 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash 203668502, now seen corresponding path program 53 times [2018-09-26 08:10:55,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:55,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:10:55,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:10:55,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:10:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=5626, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:10:55,801 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 77 states. [2018-09-26 08:10:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,510 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:10:56,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:10:56,511 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 110 [2018-09-26 08:10:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,512 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:10:56,512 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:10:56,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=5774, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:10:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:10:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-26 08:10:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:10:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:10:56,522 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:10:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,522 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:10:56,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:10:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:10:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:10:56,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,523 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:10:56,523 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1843001412, now seen corresponding path program 54 times [2018-09-26 08:10:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:57,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:10:57,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:10:57,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:10:57,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=5924, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:10:57,054 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 79 states. [2018-09-26 08:10:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,765 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:10:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:10:57,765 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 112 [2018-09-26 08:10:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,766 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:10:57,766 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:10:57,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=6076, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:10:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:10:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-09-26 08:10:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:10:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:10:57,777 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:10:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,777 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:10:57,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:10:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:10:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:10:57,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,779 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:10:57,779 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1597767198, now seen corresponding path program 55 times [2018-09-26 08:10:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:58,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:10:58,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:10:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:10:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6230, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:10:58,374 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 81 states. [2018-09-26 08:10:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,045 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:10:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:10:59,045 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 114 [2018-09-26 08:10:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,046 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:10:59,046 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:10:59,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=6386, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:10:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:10:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-26 08:10:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:10:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:10:59,056 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:10:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,056 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:10:59,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:10:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:10:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:10:59,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,057 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:10:59,058 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2144078472, now seen corresponding path program 56 times [2018-09-26 08:10:59,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:59,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:10:59,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:10:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:10:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=6544, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:10:59,603 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 83 states. [2018-09-26 08:11:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,299 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:11:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:11:00,300 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 116 [2018-09-26 08:11:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,301 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:11:00,301 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:11:00,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=6704, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:11:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:11:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-09-26 08:11:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:11:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:11:00,311 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:11:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,311 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:11:00,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:11:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:11:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:11:00,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,313 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:11:00,313 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1124826706, now seen corresponding path program 57 times [2018-09-26 08:11:00,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:00,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:11:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:11:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:11:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=6866, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:11:00,927 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 85 states. [2018-09-26 08:11:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,499 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:11:01,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:11:01,499 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 118 [2018-09-26 08:11:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,500 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:11:01,500 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:11:01,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=7030, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:11:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:11:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-26 08:11:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:11:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:11:01,509 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:11:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,510 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:11:01,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:11:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:11:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:11:01,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,511 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:11:01,511 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1373357908, now seen corresponding path program 58 times [2018-09-26 08:11:01,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:02,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:11:02,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:11:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:11:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=7196, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:11:02,204 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 87 states. [2018-09-26 08:11:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:02,883 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:11:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:11:02,883 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 120 [2018-09-26 08:11:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:02,884 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:11:02,884 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:11:02,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=7364, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:11:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:11:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-09-26 08:11:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:11:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:11:02,893 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:11:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:02,894 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:11:02,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:11:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:11:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:11:02,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:02,895 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:11:02,895 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:02,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1242053498, now seen corresponding path program 59 times [2018-09-26 08:11:02,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:03,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:11:03,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:11:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:11:03,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=7534, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:11:03,471 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 89 states. [2018-09-26 08:11:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,936 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:11:03,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:11:03,936 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 122 [2018-09-26 08:11:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,937 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:11:03,937 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:11:03,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=7706, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:11:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:11:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-26 08:11:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:11:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:11:03,947 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:11:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,947 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:11:03,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:11:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:11:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:11:03,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,949 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:11:03,949 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash -387432928, now seen corresponding path program 60 times [2018-09-26 08:11:03,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:04,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:04,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:11:04,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:11:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:11:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7880, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:11:04,613 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 91 states. [2018-09-26 08:11:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,381 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:11:05,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:11:05,382 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 124 [2018-09-26 08:11:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,383 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:11:05,383 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:11:05,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=8056, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:11:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:11:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-09-26 08:11:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:11:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:11:05,393 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:11:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:05,393 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:11:05,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:11:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:11:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:11:05,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:05,394 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:11:05,395 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:05,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1339174726, now seen corresponding path program 61 times [2018-09-26 08:11:05,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:05,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:11:05,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:11:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:11:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=8234, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:11:05,942 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 93 states. [2018-09-26 08:11:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:06,516 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:11:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:11:06,516 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 126 [2018-09-26 08:11:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:06,517 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:11:06,517 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:11:06,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=8414, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:11:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:11:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-26 08:11:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:11:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:11:06,532 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:11:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,532 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:11:06,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:11:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:11:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:11:06,534 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,534 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:11:06,534 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1543213332, now seen corresponding path program 62 times [2018-09-26 08:11:06,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:07,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:11:07,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:11:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:11:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=8596, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:11:07,138 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 95 states. [2018-09-26 08:11:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,706 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:11:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:11:07,706 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 128 [2018-09-26 08:11:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,707 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:11:07,707 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:11:07,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=8780, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:11:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:11:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-09-26 08:11:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:11:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:11:07,720 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:11:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,720 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:11:07,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:11:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:11:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:11:07,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,721 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:11:07,722 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1264231150, now seen corresponding path program 63 times [2018-09-26 08:11:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:08,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:11:08,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:11:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:11:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=8966, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:11:08,254 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 97 states. [2018-09-26 08:11:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,796 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:11:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:11:08,796 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 130 [2018-09-26 08:11:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,797 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:11:08,797 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:11:08,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=9154, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:11:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:11:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-26 08:11:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:11:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:11:08,809 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:11:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,809 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:11:08,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:11:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:11:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:11:08,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,810 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:11:08,811 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash 549673400, now seen corresponding path program 64 times [2018-09-26 08:11:08,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:09,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:09,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:11:09,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:11:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:11:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=16512, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:11:09,791 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 131 states. [2018-09-26 08:11:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:10,449 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:11:10,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:11:10,449 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 132 [2018-09-26 08:11:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:10,450 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:11:10,451 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:11:10,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4491 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=524, Invalid=16768, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:11:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:11:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-09-26 08:11:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:11:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:11:10,464 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:11:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,465 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:11:10,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:11:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:11:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:11:10,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,466 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:11:10,466 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -44776226, now seen corresponding path program 65 times [2018-09-26 08:11:10,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:11,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:11,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:11:11,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:11:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:11:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=17026, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:11:11,505 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 133 states. [2018-09-26 08:11:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:12,199 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:11:12,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:11:12,199 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 134 [2018-09-26 08:11:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:12,200 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:11:12,200 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:11:12,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=536, Invalid=17286, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:11:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:11:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-26 08:11:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:11:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:11:12,211 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:11:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:12,211 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:11:12,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:11:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:11:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:11:12,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:12,212 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:11:12,212 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:12,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash -80216444, now seen corresponding path program 66 times [2018-09-26 08:11:12,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:13,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:13,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:11:13,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:11:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:11:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=17548, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:11:13,249 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 135 states. [2018-09-26 08:11:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:13,989 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:11:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:11:13,989 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 136 [2018-09-26 08:11:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:13,990 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:11:13,990 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:11:13,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4819 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=548, Invalid=17812, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:11:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:11:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-09-26 08:11:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:11:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:11:14,006 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:11:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:14,006 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:11:14,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:11:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:11:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:11:14,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:14,007 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:11:14,008 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:14,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash 221472426, now seen corresponding path program 67 times [2018-09-26 08:11:14,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:14,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:14,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:11:14,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:11:14,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:11:14,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=18078, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:11:14,935 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 137 states. [2018-09-26 08:11:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:15,822 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:11:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:11:15,822 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 138 [2018-09-26 08:11:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:15,823 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:11:15,823 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:11:15,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4989 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=18346, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:11:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:11:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-26 08:11:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:11:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:11:15,838 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:11:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:15,838 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:11:15,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:11:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:11:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:11:15,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:15,839 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:11:15,840 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:15,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1913299632, now seen corresponding path program 68 times [2018-09-26 08:11:15,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:16,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:16,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:11:16,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:11:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:11:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=18616, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:11:16,845 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 139 states. [2018-09-26 08:11:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:17,540 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:11:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:11:17,540 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 140 [2018-09-26 08:11:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:17,541 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:11:17,541 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:11:17,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=572, Invalid=18888, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:11:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:11:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-09-26 08:11:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:11:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:11:17,554 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:11:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:17,554 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:11:17,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:11:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:11:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:11:17,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:17,555 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:11:17,555 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:17,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash -434879882, now seen corresponding path program 69 times [2018-09-26 08:11:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:18,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:18,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:11:18,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:11:18,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:11:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=19162, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:11:18,456 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 141 states. [2018-09-26 08:11:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:19,223 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:11:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:11:19,223 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 142 [2018-09-26 08:11:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:19,224 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:11:19,224 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:11:19,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=584, Invalid=19438, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:11:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:11:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-26 08:11:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:11:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:11:19,236 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:11:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:19,236 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:11:19,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:11:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:11:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:11:19,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:19,237 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:11:19,237 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:19,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1307675108, now seen corresponding path program 70 times [2018-09-26 08:11:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:20,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:11:20,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:11:20,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:11:20,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=19716, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:11:20,200 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 143 states. [2018-09-26 08:11:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:20,973 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:11:20,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:11:20,973 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 144 [2018-09-26 08:11:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:20,974 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:11:20,974 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:11:20,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5523 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=596, Invalid=19996, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:11:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:11:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-09-26 08:11:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:11:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:11:20,988 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:11:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:20,989 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:11:20,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:11:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:11:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:11:20,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:20,990 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:11:20,990 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:20,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1749702722, now seen corresponding path program 71 times [2018-09-26 08:11:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:21,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:21,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:11:21,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:11:21,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:11:21,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=20278, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:11:21,872 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 145 states. [2018-09-26 08:11:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:22,673 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:11:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:11:22,673 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 146 [2018-09-26 08:11:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:22,674 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:11:22,674 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:11:22,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5709 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=608, Invalid=20562, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:11:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:11:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-26 08:11:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:11:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:11:22,688 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:11:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:22,689 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:11:22,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:11:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:11:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:11:22,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:22,690 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:11:22,690 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:22,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2132166888, now seen corresponding path program 72 times [2018-09-26 08:11:22,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:23,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:23,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:11:23,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:11:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:11:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=20848, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:11:23,801 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 147 states. [2018-09-26 08:11:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:24,614 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:11:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:11:24,615 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 148 [2018-09-26 08:11:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:24,616 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:11:24,616 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:11:24,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5899 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=620, Invalid=21136, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:11:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:11:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-09-26 08:11:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:11:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:11:24,631 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:11:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:24,631 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:11:24,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:11:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:11:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:11:24,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:24,633 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:11:24,633 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:24,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash 313042958, now seen corresponding path program 73 times [2018-09-26 08:11:24,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:11:25,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:11:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:11:25,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=21426, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:11:25,628 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 149 states. [2018-09-26 08:11:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,529 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:11:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:11:26,530 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 150 [2018-09-26 08:11:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,531 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:11:26,531 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:11:26,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6093 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=632, Invalid=21718, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:11:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:11:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-26 08:11:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:11:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:11:26,547 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:11:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,547 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:11:26,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:11:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:11:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:11:26,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,548 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:11:26,549 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash 186635700, now seen corresponding path program 74 times [2018-09-26 08:11:26,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:11:27,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:11:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:11:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=22012, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:11:27,554 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 151 states. [2018-09-26 08:11:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,414 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:11:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:11:28,414 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 152 [2018-09-26 08:11:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,415 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:11:28,415 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:11:28,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=644, Invalid=22308, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:11:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:11:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-09-26 08:11:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:11:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:11:28,430 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:11:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,430 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:11:28,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:11:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:11:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:11:28,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,431 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:11:28,431 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1031654950, now seen corresponding path program 75 times [2018-09-26 08:11:28,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:11:29,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:11:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:11:29,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=22606, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:11:29,523 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 153 states. [2018-09-26 08:11:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,419 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:11:30,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:11:30,419 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 154 [2018-09-26 08:11:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,420 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:11:30,420 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:11:30,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=656, Invalid=22906, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:11:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:11:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-26 08:11:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:11:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:11:30,436 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:11:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,436 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:11:30,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:11:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:11:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:11:30,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,437 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:11:30,437 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 717102208, now seen corresponding path program 76 times [2018-09-26 08:11:30,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:11:31,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:11:31,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:11:31,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=23208, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:11:31,713 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 155 states. [2018-09-26 08:11:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,605 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:11:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:11:32,605 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 156 [2018-09-26 08:11:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,606 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:11:32,606 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:11:32,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6699 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=668, Invalid=23512, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:11:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:11:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-09-26 08:11:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:11:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:11:32,623 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:11:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,624 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:11:32,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:11:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:11:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:11:32,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,625 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:11:32,625 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1940518310, now seen corresponding path program 77 times [2018-09-26 08:11:32,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:11:33,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:11:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:11:33,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=23818, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:11:33,743 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 157 states. [2018-09-26 08:11:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,710 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:11:34,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:11:34,710 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 158 [2018-09-26 08:11:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,711 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:11:34,711 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:11:34,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6909 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=680, Invalid=24126, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:11:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:11:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 08:11:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:11:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:11:34,729 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:11:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,729 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:11:34,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:11:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:11:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:11:34,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,730 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:11:34,730 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 822353228, now seen corresponding path program 78 times [2018-09-26 08:11:34,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:35,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:11:35,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:11:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:11:35,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=24436, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:11:35,833 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 159 states. [2018-09-26 08:11:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,631 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:11:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:11:36,631 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 160 [2018-09-26 08:11:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,632 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:11:36,632 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:11:36,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=692, Invalid=24748, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:11:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:11:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-09-26 08:11:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:11:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:11:36,658 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-09-26 08:11:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,659 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:11:36,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:11:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:11:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:11:36,660 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,660 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-09-26 08:11:36,660 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash 7533426, now seen corresponding path program 79 times [2018-09-26 08:11:36,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:37,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:11:37,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:11:37,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:11:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=25062, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:11:37,856 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 161 states. [2018-09-26 08:11:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,802 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:11:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:11:38,802 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 162 [2018-09-26 08:11:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,803 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:11:38,803 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:11:38,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=704, Invalid=25378, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:11:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:11:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-26 08:11:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:11:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:11:38,826 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-09-26 08:11:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,826 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:11:38,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:11:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:11:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:11:38,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,827 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-09-26 08:11:38,827 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1350248424, now seen corresponding path program 80 times [2018-09-26 08:11:38,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:40,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:40,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:11:40,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:11:40,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:11:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=25696, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:11:40,073 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 163 states. [2018-09-26 08:11:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:41,253 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:11:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:11:41,253 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 164 [2018-09-26 08:11:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:41,254 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:11:41,254 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:11:41,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7563 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=716, Invalid=26016, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:11:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:11:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-09-26 08:11:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:11:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:11:41,281 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-09-26 08:11:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:41,282 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:11:41,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:11:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:11:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:11:41,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:41,283 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-09-26 08:11:41,283 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:41,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash -508548290, now seen corresponding path program 81 times [2018-09-26 08:11:41,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:11:42,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:11:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:11:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=26338, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:11:42,608 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 165 states. [2018-09-26 08:11:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,630 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:11:43,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:11:43,630 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 166 [2018-09-26 08:11:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,631 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:11:43,631 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:11:43,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7789 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=26662, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:11:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:11:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-26 08:11:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:11:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:11:43,655 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-09-26 08:11:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:43,656 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:11:43,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:11:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:11:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:11:43,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:43,657 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-09-26 08:11:43,657 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:43,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash 911428836, now seen corresponding path program 82 times [2018-09-26 08:11:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:44,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:11:44,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:11:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:11:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=26988, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:11:44,943 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 167 states. [2018-09-26 08:11:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,840 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:11:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:11:45,840 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 168 [2018-09-26 08:11:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,841 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:11:45,841 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:11:45,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8019 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=740, Invalid=27316, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:11:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:11:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-09-26 08:11:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:11:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:11:45,871 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-09-26 08:11:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,871 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:11:45,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:11:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:11:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:11:45,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,873 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-09-26 08:11:45,873 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -290153206, now seen corresponding path program 83 times [2018-09-26 08:11:45,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:47,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:11:47,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:11:47,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:11:47,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=27646, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:11:47,222 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 169 states. [2018-09-26 08:11:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,305 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:11:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:11:48,305 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 170 [2018-09-26 08:11:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,307 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:11:48,307 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:11:48,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=752, Invalid=27978, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:11:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:11:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 08:11:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:11:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:11:48,337 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-09-26 08:11:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:11:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:11:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:11:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:11:48,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,339 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-09-26 08:11:48,339 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash 335707056, now seen corresponding path program 84 times [2018-09-26 08:11:48,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:49,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:11:49,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:11:49,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:11:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=28312, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:11:49,580 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 171 states. [2018-09-26 08:11:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,698 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:11:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:11:50,698 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 172 [2018-09-26 08:11:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,699 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:11:50,699 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:11:50,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8491 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=764, Invalid=28648, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:11:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:11:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-09-26 08:11:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:11:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:11:50,733 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-09-26 08:11:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,733 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:11:50,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:11:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:11:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:11:50,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,736 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-09-26 08:11:50,736 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 491997398, now seen corresponding path program 85 times [2018-09-26 08:11:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:52,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:11:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:11:52,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:11:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=770, Invalid=28986, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:11:52,239 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 173 states. [2018-09-26 08:11:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,370 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:11:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:11:53,371 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 174 [2018-09-26 08:11:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,372 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:11:53,372 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:11:53,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8733 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=776, Invalid=29326, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:11:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:11:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-26 08:11:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:11:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:11:53,435 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-09-26 08:11:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,436 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:11:53,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:11:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:11:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:11:53,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,438 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-09-26 08:11:53,439 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,439 INFO L82 PathProgramCache]: Analyzing trace with hash 363160700, now seen corresponding path program 86 times [2018-09-26 08:11:53,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:54,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:11:54,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:11:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:11:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=29668, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:11:54,828 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 175 states. [2018-09-26 08:11:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,970 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:11:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:11:55,970 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 176 [2018-09-26 08:11:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,971 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:11:55,971 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:11:55,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8979 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=788, Invalid=30012, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:11:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:11:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-09-26 08:11:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:11:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:11:55,997 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-09-26 08:11:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,998 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:11:55,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:11:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:11:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:11:55,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,999 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-09-26 08:11:55,999 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1105145506, now seen corresponding path program 87 times [2018-09-26 08:11:56,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:57,358 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:11:57,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:11:57,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:11:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=30358, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:11:57,360 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 177 states. [2018-09-26 08:11:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:58,475 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:11:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:11:58,475 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 178 [2018-09-26 08:11:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:58,476 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:11:58,476 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:11:58,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=800, Invalid=30706, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:11:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:11:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-26 08:11:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:11:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:11:58,505 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-09-26 08:11:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,505 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:11:58,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:11:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:11:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:11:58,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,506 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-09-26 08:11:58,506 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1187972936, now seen corresponding path program 88 times [2018-09-26 08:11:58,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:59,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:11:59,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:11:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:11:59,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=31056, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:11:59,836 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 179 states. [2018-09-26 08:12:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,051 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:12:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:12:01,051 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 180 [2018-09-26 08:12:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,052 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:12:01,052 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:12:01,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9483 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=812, Invalid=31408, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:12:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:12:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-09-26 08:12:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:12:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:12:01,084 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-09-26 08:12:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:01,084 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:12:01,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:12:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:12:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:12:01,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:01,085 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-09-26 08:12:01,086 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:01,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -819245458, now seen corresponding path program 89 times [2018-09-26 08:12:01,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:02,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:12:02,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:12:02,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:12:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=31762, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:12:02,505 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 181 states. [2018-09-26 08:12:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:03,690 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:12:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:12:03,690 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 182 [2018-09-26 08:12:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:03,691 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:12:03,691 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:12:03,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9741 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=824, Invalid=32118, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:12:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:12:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-26 08:12:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:12:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:12:03,720 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-09-26 08:12:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:03,720 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:12:03,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:12:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:12:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:12:03,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:03,722 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-09-26 08:12:03,722 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:03,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:03,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1315806188, now seen corresponding path program 90 times [2018-09-26 08:12:03,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:05,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:12:05,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:12:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:12:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=32476, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:12:05,116 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 183 states. [2018-09-26 08:12:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:06,292 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:12:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:12:06,292 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 184 [2018-09-26 08:12:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:06,293 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:12:06,294 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:12:06,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10003 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=836, Invalid=32836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:12:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:12:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-09-26 08:12:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:12:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:12:06,321 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-09-26 08:12:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:06,321 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:12:06,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:12:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:12:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:12:06,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:06,322 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-09-26 08:12:06,322 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:06,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1769297862, now seen corresponding path program 91 times [2018-09-26 08:12:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:07,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:07,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:12:07,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:12:07,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:12:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=33198, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:12:07,759 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 185 states. [2018-09-26 08:12:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:09,053 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:12:09,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:12:09,053 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 186 [2018-09-26 08:12:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:09,055 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:12:09,055 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:12:09,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10269 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=848, Invalid=33562, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:12:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:12:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-26 08:12:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:12:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:12:09,088 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-09-26 08:12:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:09,089 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:12:09,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:12:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:12:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:12:09,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:09,090 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-09-26 08:12:09,090 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:09,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 511867616, now seen corresponding path program 92 times [2018-09-26 08:12:09,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:10,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:10,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:12:10,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:12:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:12:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=854, Invalid=33928, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:12:10,626 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 187 states. [2018-09-26 08:12:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,892 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:12:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:12:11,893 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 188 [2018-09-26 08:12:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,894 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:12:11,894 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:12:11,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10539 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=860, Invalid=34296, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:12:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:12:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-09-26 08:12:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:12:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:12:11,927 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-09-26 08:12:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,928 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:12:11,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:12:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:12:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:12:11,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,929 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-09-26 08:12:11,929 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2016396282, now seen corresponding path program 93 times [2018-09-26 08:12:11,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:13,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:13,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:12:13,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:12:13,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:12:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=34666, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:12:13,472 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 189 states. [2018-09-26 08:12:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:14,804 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:12:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:12:14,804 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 190 [2018-09-26 08:12:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:14,805 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:12:14,805 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:12:14,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10813 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=872, Invalid=35038, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:12:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:12:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-26 08:12:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:12:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:12:14,847 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-09-26 08:12:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:14,847 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:12:14,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:12:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:12:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:12:14,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:14,848 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-09-26 08:12:14,849 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:14,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash -726512724, now seen corresponding path program 94 times [2018-09-26 08:12:14,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:16,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:16,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:12:16,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:12:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:12:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=35412, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:12:16,357 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 191 states. [2018-09-26 08:12:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:17,713 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:12:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:12:17,713 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 192 [2018-09-26 08:12:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:17,714 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:12:17,714 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:12:17,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11091 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=884, Invalid=35788, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:12:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:12:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-09-26 08:12:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:12:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:12:17,761 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-09-26 08:12:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:17,761 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:12:17,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:12:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:12:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:12:17,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:17,762 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-09-26 08:12:17,762 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:17,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1901005266, now seen corresponding path program 95 times [2018-09-26 08:12:17,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:19,350 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:19,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:12:19,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:12:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:12:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=890, Invalid=36166, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:12:19,352 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 193 states. [2018-09-26 08:12:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:20,737 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:12:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:12:20,737 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 194 [2018-09-26 08:12:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:20,738 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:12:20,739 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:12:20,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11373 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=896, Invalid=36546, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:12:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:12:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-26 08:12:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:12:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:12:20,774 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-09-26 08:12:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:20,774 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:12:20,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:12:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:12:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:12:20,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:20,775 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-09-26 08:12:20,775 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:20,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1505023608, now seen corresponding path program 96 times [2018-09-26 08:12:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:22,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:22,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:12:22,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:12:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:12:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=36928, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:12:22,318 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 195 states. [2018-09-26 08:12:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:23,785 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:12:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:12:23,785 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 196 [2018-09-26 08:12:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:23,786 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:12:23,786 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:12:23,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11659 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=908, Invalid=37312, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:12:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:12:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-09-26 08:12:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:12:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:12:23,817 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-09-26 08:12:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:23,818 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:12:23,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:12:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:12:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:12:23,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:23,819 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-09-26 08:12:23,819 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:23,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1076227682, now seen corresponding path program 97 times [2018-09-26 08:12:23,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:25,330 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:25,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:12:25,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:12:25,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:12:25,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=37698, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:12:25,334 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 197 states. [2018-09-26 08:12:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:26,820 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:12:26,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:12:26,820 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 198 [2018-09-26 08:12:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:26,821 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:12:26,821 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:12:26,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11949 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=920, Invalid=38086, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:12:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:12:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-26 08:12:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:12:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:12:26,860 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-09-26 08:12:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:26,860 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:12:26,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:12:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:12:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:12:26,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:26,861 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-09-26 08:12:26,861 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:26,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 832379716, now seen corresponding path program 98 times [2018-09-26 08:12:26,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:28,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:28,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:12:28,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:12:28,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:12:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=38476, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:12:28,504 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 199 states. [2018-09-26 08:12:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:29,954 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:12:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:12:29,954 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 200 [2018-09-26 08:12:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:29,955 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:12:29,955 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:12:29,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12243 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=932, Invalid=38868, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:12:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:12:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-09-26 08:12:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:12:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:12:30,002 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-09-26 08:12:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:30,002 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:12:30,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:12:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:12:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:12:30,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:30,003 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-09-26 08:12:30,004 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:30,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:30,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1053053802, now seen corresponding path program 99 times [2018-09-26 08:12:30,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:31,664 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:31,664 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:12:31,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:12:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:12:31,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=939, Invalid=39261, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:12:31,667 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 201 states. [2018-09-26 08:12:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:33,148 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:12:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:12:33,148 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 202 [2018-09-26 08:12:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:33,149 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:12:33,149 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:12:33,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12542 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=945, Invalid=39657, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:12:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:12:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:12:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:12:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:12:33,189 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-09-26 08:12:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:33,190 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:12:33,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:12:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:12:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:12:33,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:33,191 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-09-26 08:12:33,191 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:33,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1627514352, now seen corresponding path program 100 times [2018-09-26 08:12:33,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:34,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:34,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:12:34,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:12:34,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:12:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:12:34,118 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-09-26 08:12:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:35,993 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:12:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:12:35,993 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-09-26 08:12:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:35,994 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:12:35,994 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:12:35,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:12:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:12:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:12:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:12:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:12:36,061 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-09-26 08:12:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:36,061 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:12:36,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:12:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:12:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:12:36,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:36,063 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-09-26 08:12:36,063 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:36,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:36,063 INFO L82 PathProgramCache]: Analyzing trace with hash -673132746, now seen corresponding path program 101 times [2018-09-26 08:12:36,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 2752 proven. 7550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:38,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:38,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:12:38,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:12:38,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:12:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5606, Invalid=35806, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:12:38,123 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 204 states. [2018-09-26 08:12:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:39,929 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:12:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:12:39,929 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 206 [2018-09-26 08:12:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:39,930 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:12:39,930 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:12:39,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7651 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5711, Invalid=36109, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:12:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:12:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:12:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:12:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:12:39,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-09-26 08:12:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,934 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:12:39,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:12:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:12:39,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:12:39,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:12:42,385 WARN L178 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 603 DAG size of output: 509 [2018-09-26 08:12:42,530 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2018-09-26 08:12:44,055 WARN L178 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 509 DAG size of output: 509 [2018-09-26 08:12:45,735 WARN L178 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 511 DAG size of output: 511 [2018-09-26 08:12:45,742 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 55) the Hoare annotation is: false [2018-09-26 08:12:45,742 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 55) the Hoare annotation is: true [2018-09-26 08:12:45,743 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 55) no Hoare annotation was computed. [2018-09-26 08:12:45,743 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 54) the Hoare annotation is: false [2018-09-26 08:12:45,773 INFO L422 ceAbstractionStarter]: At program point L52(lines 20 52) the Hoare annotation is: (let ((.cse16 (<= ULTIMATE.start_main_~y~4 28)) (.cse17 (<= 28 ULTIMATE.start_main_~y~4)) (.cse22 (<= 21 ULTIMATE.start_main_~y~4)) (.cse23 (<= ULTIMATE.start_main_~y~4 21)) (.cse28 (<= 20 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 20)) (.cse26 (<= 49 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 49)) (.cse14 (<= 19 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 19)) (.cse58 (<= 33 ULTIMATE.start_main_~y~4)) (.cse59 (<= ULTIMATE.start_main_~y~4 33)) (.cse68 (<= ULTIMATE.start_main_~y~4 1)) (.cse69 (<= 1 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 22)) (.cse3 (<= 22 ULTIMATE.start_main_~y~4)) (.cse40 (<= ULTIMATE.start_main_~y~4 29)) (.cse41 (<= 29 ULTIMATE.start_main_~y~4)) (.cse56 (<= 32 ULTIMATE.start_main_~y~4)) (.cse57 (<= ULTIMATE.start_main_~y~4 32)) (.cse62 (<= ULTIMATE.start_main_~y~4 9)) (.cse63 (<= 9 ULTIMATE.start_main_~y~4)) (.cse34 (<= 6 ULTIMATE.start_main_~y~4)) (.cse35 (<= ULTIMATE.start_main_~y~4 6)) (.cse4 (<= ULTIMATE.start_main_~y~4 7)) (.cse5 (<= 7 ULTIMATE.start_main_~y~4)) (.cse46 (<= ULTIMATE.start_main_~y~4 0)) (.cse47 (<= 0 ULTIMATE.start_main_~y~4)) (.cse12 (<= ULTIMATE.start_main_~y~4 23)) (.cse13 (<= 23 ULTIMATE.start_main_~y~4)) (.cse66 (<= ULTIMATE.start_main_~y~4 2)) (.cse67 (<= 2 ULTIMATE.start_main_~y~4)) (.cse8 (<= 5 ULTIMATE.start_main_~y~4)) (.cse9 (<= ULTIMATE.start_main_~y~4 5)) (.cse74 (<= 25 ULTIMATE.start_main_~y~4)) (.cse75 (<= ULTIMATE.start_main_~y~4 25)) (.cse54 (<= ULTIMATE.start_main_~y~4 42)) (.cse55 (<= 42 ULTIMATE.start_main_~y~4)) (.cse64 (<= 39 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 39)) (.cse72 (<= ULTIMATE.start_main_~y~4 34)) (.cse73 (<= 34 ULTIMATE.start_main_~y~4)) (.cse24 (<= ULTIMATE.start_main_~y~4 41)) (.cse25 (<= 41 ULTIMATE.start_main_~y~4)) (.cse78 (<= ULTIMATE.start_main_~y~4 10)) (.cse79 (<= 10 ULTIMATE.start_main_~y~4)) (.cse86 (<= ULTIMATE.start_main_~y~4 27)) (.cse87 (<= 27 ULTIMATE.start_main_~y~4)) (.cse44 (<= ULTIMATE.start_main_~y~4 13)) (.cse45 (<= 13 ULTIMATE.start_main_~y~4)) (.cse60 (<= 18 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 18)) (.cse0 (<= 31 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 31)) (.cse10 (<= ULTIMATE.start_main_~y~4 46)) (.cse11 (<= 46 ULTIMATE.start_main_~y~4)) (.cse30 (<= 16 ULTIMATE.start_main_~y~4)) (.cse31 (<= ULTIMATE.start_main_~y~4 16)) (.cse76 (<= 47 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 47)) (.cse42 (<= ULTIMATE.start_main_~y~4 26)) (.cse43 (<= 26 ULTIMATE.start_main_~y~4)) (.cse92 (<= ULTIMATE.start_main_~y~4 38)) (.cse93 (<= 38 ULTIMATE.start_main_~y~4)) (.cse94 (<= ULTIMATE.start_main_~y~4 30)) (.cse95 (<= 30 ULTIMATE.start_main_~y~4)) (.cse96 (<= ULTIMATE.start_main_~y~4 3)) (.cse97 (<= 3 ULTIMATE.start_main_~y~4)) (.cse90 (<= 45 ULTIMATE.start_main_~y~4)) (.cse91 (<= ULTIMATE.start_main_~y~4 45)) (.cse88 (<= 37 ULTIMATE.start_main_~y~4)) (.cse89 (<= ULTIMATE.start_main_~y~4 37)) (.cse84 (<= 8 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 8)) (.cse32 (<= 12 ULTIMATE.start_main_~y~4)) (.cse33 (<= ULTIMATE.start_main_~y~4 12)) (.cse70 (<= 43 ULTIMATE.start_main_~y~4)) (.cse71 (<= ULTIMATE.start_main_~y~4 43)) (.cse50 (<= 24 ULTIMATE.start_main_~y~4)) (.cse51 (<= ULTIMATE.start_main_~y~4 24)) (.cse6 (<= 48 ULTIMATE.start_main_~y~4)) (.cse7 (<= ULTIMATE.start_main_~y~4 48)) (.cse80 (<= ULTIMATE.start_main_~y~4 11)) (.cse81 (<= 11 ULTIMATE.start_main_~y~4)) (.cse48 (<= ULTIMATE.start_main_~y~4 44)) (.cse49 (<= 44 ULTIMATE.start_main_~y~4)) (.cse82 (<= ULTIMATE.start_main_~y~4 15)) (.cse83 (<= 15 ULTIMATE.start_main_~y~4)) (.cse52 (<= ULTIMATE.start_main_~y~4 40)) (.cse53 (<= 40 ULTIMATE.start_main_~y~4)) (.cse98 (<= 14 ULTIMATE.start_main_~y~4)) (.cse99 (<= ULTIMATE.start_main_~y~4 14)) (.cse18 (<= ULTIMATE.start_main_~y~4 36)) (.cse19 (<= 36 ULTIMATE.start_main_~y~4)) (.cse36 (<= 35 ULTIMATE.start_main_~y~4)) (.cse37 (<= ULTIMATE.start_main_~y~4 35)) (.cse20 (<= 4 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 4)) (.cse38 (<= 17 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 17))) (or (and .cse0 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) .cse1) (and .cse2 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4) .cse3) (and .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 48 ULTIMATE.start_main_~x~4) .cse6 .cse7 (<= ULTIMATE.start_main_~x~4 48)) (and .cse8 .cse9 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95)) (and (<= ULTIMATE.start_main_~x~4 54) .cse10 (<= 54 ULTIMATE.start_main_~x~4) .cse11) (and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4) .cse12 .cse13) (and .cse14 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse15) (and (<= 72 ULTIMATE.start_main_~x~4) .cse16 (<= ULTIMATE.start_main_~x~4 72) .cse17) (and (<= ULTIMATE.start_main_~x~4 64) .cse18 (<= 64 ULTIMATE.start_main_~x~4) .cse19) (and .cse20 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse21) (and (<= 79 ULTIMATE.start_main_~x~4) .cse22 (<= ULTIMATE.start_main_~x~4 79) .cse23) (and .cse16 (<= ULTIMATE.start_main_~x~4 28) .cse17 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse24 .cse25) (and (<= 49 ULTIMATE.start_main_~x~4) .cse26 .cse27 (<= ULTIMATE.start_main_~x~4 49)) (and .cse28 (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4) .cse29) (and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4) .cse30 .cse31) (and (<= 12 ULTIMATE.start_main_~x~4) .cse32 .cse33 (<= ULTIMATE.start_main_~x~4 12)) (and .cse34 .cse35 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and .cse36 .cse37 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and (<= 83 ULTIMATE.start_main_~x~4) .cse38 .cse39 (<= ULTIMATE.start_main_~x~4 83)) (and (<= 29 ULTIMATE.start_main_~x~4) .cse40 .cse41 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 21) .cse22 (<= 21 ULTIMATE.start_main_~x~4) .cse23) (and (<= 20 ULTIMATE.start_main_~x~4) .cse28 (<= ULTIMATE.start_main_~x~4 20) .cse29) (and (<= ULTIMATE.start_main_~x~4 26) .cse42 .cse43 (<= 26 ULTIMATE.start_main_~x~4)) (and .cse44 .cse45 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse26 .cse27 (<= ULTIMATE.start_main_~x~4 51)) (and .cse46 .cse47 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse48 .cse49) (and (<= ULTIMATE.start_main_~x~4 76) .cse50 .cse51 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 60 ULTIMATE.start_main_~x~4) .cse52 (<= ULTIMATE.start_main_~x~4 60) .cse53) (and (<= 58 ULTIMATE.start_main_~x~4) .cse54 .cse55 (<= ULTIMATE.start_main_~x~4 58)) (and (<= ULTIMATE.start_main_~x~4 32) .cse56 (<= 32 ULTIMATE.start_main_~x~4) .cse57) (and .cse14 (<= 19 ULTIMATE.start_main_~x~4) .cse15 (<= ULTIMATE.start_main_~x~4 19)) (and (<= ULTIMATE.start_main_~x~4 33) .cse58 (<= 33 ULTIMATE.start_main_~x~4) .cse59) (and (<= 67 ULTIMATE.start_main_~x~4) .cse58 .cse59 (<= ULTIMATE.start_main_~x~4 67)) (and .cse60 (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse61) (and .cse62 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse63) (and .cse64 (<= ULTIMATE.start_main_~x~4 39) .cse65 (<= 39 ULTIMATE.start_main_~x~4)) (and .cse66 .cse67 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse68 .cse69) (and .cse70 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse71) (and (<= ULTIMATE.start_main_~x~4 1) .cse68 .cse69 (<= 1 ULTIMATE.start_main_~x~4)) (and .cse2 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4) .cse3) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse40 .cse41) (and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66) .cse72 .cse73) (and .cse56 (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse57) (and (<= ULTIMATE.start_main_~x~4 91) .cse62 (<= 91 ULTIMATE.start_main_~x~4) .cse63) (and (<= 6 ULTIMATE.start_main_~x~4) .cse34 .cse35 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 7) .cse4 .cse5 (<= 7 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse74 .cse75) (and .cse76 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse77) (and .cse78 (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~x~4) .cse79) (and .cse46 .cse47 (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse12 .cse13) (and (<= ULTIMATE.start_main_~x~4 98) .cse66 .cse67 (<= 98 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 5) .cse8 .cse9 (<= 5 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse80 .cse81) (and .cse74 .cse75 (<= ULTIMATE.start_main_~x~4 25) (<= 25 ULTIMATE.start_main_~x~4)) (and .cse82 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85) .cse83) (and .cse54 .cse55 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 8) .cse84 .cse85 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse86 .cse87 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and .cse88 (<= ULTIMATE.start_main_~x~4 37) .cse89 (<= 37 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) .cse64 (<= ULTIMATE.start_main_~x~4 61) .cse65) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse72 .cse73) (and (<= ULTIMATE.start_main_~x~4 59) .cse24 .cse25 (<= 59 ULTIMATE.start_main_~x~4)) (and .cse78 (<= ULTIMATE.start_main_~x~4 10) .cse79 (<= 10 ULTIMATE.start_main_~x~4)) (and .cse90 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse91) (and .cse86 (<= ULTIMATE.start_main_~x~4 27) .cse87 (<= 27 ULTIMATE.start_main_~x~4)) (and .cse44 (<= ULTIMATE.start_main_~x~4 87) .cse45 (<= 87 ULTIMATE.start_main_~x~4)) (and .cse60 (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse61) (and (<= ULTIMATE.start_main_~x~4 31) .cse0 .cse1 (<= 31 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) .cse92 .cse93 (<= 62 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 46) (<= 46 ULTIMATE.start_main_~x~4) .cse10 .cse11) (and .cse94 (<= ULTIMATE.start_main_~x~4 30) .cse95 (<= 30 ULTIMATE.start_main_~x~4)) (and .cse30 (<= ULTIMATE.start_main_~x~4 84) .cse31 (<= 84 ULTIMATE.start_main_~x~4)) (and .cse76 (<= 47 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 47) .cse77) (and (<= 74 ULTIMATE.start_main_~x~4) .cse42 (<= ULTIMATE.start_main_~x~4 74) .cse43) (and (<= 38 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 38) .cse92 .cse93) (and .cse96 .cse97 (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 97)) (and .cse94 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse95) (and (<= 3 ULTIMATE.start_main_~x~4) .cse96 .cse97 (<= ULTIMATE.start_main_~x~4 3)) (and .cse90 (<= 45 ULTIMATE.start_main_~x~4) .cse91 (<= ULTIMATE.start_main_~x~4 45)) (and (<= 63 ULTIMATE.start_main_~x~4) .cse88 .cse89 (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 92) .cse84 .cse85 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse32 (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse33) (and .cse70 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse71) (and .cse50 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse51) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse6 .cse7) (and .cse98 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse99) (and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse80 .cse81) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse48 .cse49) (and .cse82 (<= 15 ULTIMATE.start_main_~x~4) .cse83 (<= ULTIMATE.start_main_~x~4 15)) (and (<= ULTIMATE.start_main_~x~4 40) .cse52 (<= 40 ULTIMATE.start_main_~x~4) .cse53) (and .cse98 (<= 86 ULTIMATE.start_main_~x~4) .cse99 (<= ULTIMATE.start_main_~x~4 86)) (and (<= 36 ULTIMATE.start_main_~x~4) .cse18 (<= ULTIMATE.start_main_~x~4 36) .cse19) (and (<= ULTIMATE.start_main_~x~4 35) .cse36 (<= 35 ULTIMATE.start_main_~x~4) .cse37) (and .cse20 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4) .cse21) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 17) .cse38 .cse39 (<= 17 ULTIMATE.start_main_~x~4)))) [2018-09-26 08:12:45,774 INFO L422 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: false [2018-09-26 08:12:45,788 INFO L422 ceAbstractionStarter]: At program point L36(lines 30 47) the Hoare annotation is: (let ((.cse4 (<= 5 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 5)) (.cse14 (<= ULTIMATE.start_main_~y~4 44)) (.cse15 (<= 44 ULTIMATE.start_main_~y~4)) (.cse6 (<= ULTIMATE.start_main_~y~4 26)) (.cse7 (<= 26 ULTIMATE.start_main_~y~4)) (.cse8 (<= ULTIMATE.start_main_~y~4 28)) (.cse9 (<= 28 ULTIMATE.start_main_~y~4)) (.cse20 (<= 32 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 32)) (.cse30 (<= ULTIMATE.start_main_~y~4 27)) (.cse31 (<= 27 ULTIMATE.start_main_~y~4)) (.cse28 (<= 49 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 49)) (.cse36 (<= ULTIMATE.start_main_~y~4 42)) (.cse37 (<= 42 ULTIMATE.start_main_~y~4)) (.cse54 (<= 18 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 18)) (.cse22 (<= 16 ULTIMATE.start_main_~y~4)) (.cse23 (<= ULTIMATE.start_main_~y~4 16)) (.cse56 (<= ULTIMATE.start_main_~y~4 13)) (.cse57 (<= 13 ULTIMATE.start_main_~y~4)) (.cse32 (<= 6 ULTIMATE.start_main_~y~4)) (.cse33 (<= ULTIMATE.start_main_~y~4 6)) (.cse40 (<= 12 ULTIMATE.start_main_~y~4)) (.cse41 (<= ULTIMATE.start_main_~y~4 12)) (.cse46 (<= ULTIMATE.start_main_~y~4 40)) (.cse47 (<= 40 ULTIMATE.start_main_~y~4)) (.cse52 (<= ULTIMATE.start_main_~y~4 38)) (.cse53 (<= 38 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 36)) (.cse17 (<= 36 ULTIMATE.start_main_~y~4)) (.cse48 (<= 43 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 43)) (.cse58 (<= ULTIMATE.start_main_~y~4 2)) (.cse59 (<= 2 ULTIMATE.start_main_~y~4)) (.cse42 (<= 37 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 37)) (.cse64 (<= ULTIMATE.start_main_~y~4 9)) (.cse65 (<= 9 ULTIMATE.start_main_~y~4)) (.cse74 (<= 25 ULTIMATE.start_main_~y~4)) (.cse75 (<= ULTIMATE.start_main_~y~4 25)) (.cse26 (<= 48 ULTIMATE.start_main_~y~4)) (.cse27 (<= ULTIMATE.start_main_~y~4 48)) (.cse18 (<= ULTIMATE.start_main_~y~4 46)) (.cse19 (<= 46 ULTIMATE.start_main_~y~4)) (.cse12 (<= 21 ULTIMATE.start_main_~y~4)) (.cse13 (<= ULTIMATE.start_main_~y~4 21)) (.cse34 (<= ULTIMATE.start_main_~y~4 29)) (.cse35 (<= 29 ULTIMATE.start_main_~y~4)) (.cse68 (<= 8 ULTIMATE.start_main_~y~4)) (.cse69 (<= ULTIMATE.start_main_~y~4 8)) (.cse92 (<= ULTIMATE.start_main_~y~4 1)) (.cse93 (<= 1 ULTIMATE.start_main_~y~4)) (.cse62 (<= 45 ULTIMATE.start_main_~y~4)) (.cse63 (<= ULTIMATE.start_main_~y~4 45)) (.cse82 (<= ULTIMATE.start_main_~y~4 23)) (.cse83 (<= 23 ULTIMATE.start_main_~y~4)) (.cse86 (<= 31 ULTIMATE.start_main_~y~4)) (.cse87 (<= ULTIMATE.start_main_~y~4 31)) (.cse44 (<= ULTIMATE.start_main_~y~4 41)) (.cse45 (<= 41 ULTIMATE.start_main_~y~4)) (.cse88 (<= ULTIMATE.start_main_~y~4 22)) (.cse89 (<= 22 ULTIMATE.start_main_~y~4)) (.cse60 (<= 19 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 19)) (.cse72 (<= 35 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 35)) (.cse24 (<= ULTIMATE.start_main_~y~4 34)) (.cse25 (<= 34 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 3)) (.cse3 (<= 3 ULTIMATE.start_main_~y~4)) (.cse90 (<= 17 ULTIMATE.start_main_~y~4)) (.cse91 (<= ULTIMATE.start_main_~y~4 17)) (.cse38 (<= ULTIMATE.start_main_~y~4 30)) (.cse39 (<= 30 ULTIMATE.start_main_~y~4)) (.cse96 (<= 14 ULTIMATE.start_main_~y~4)) (.cse97 (<= ULTIMATE.start_main_~y~4 14)) (.cse84 (<= 47 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 47)) (.cse80 (<= ULTIMATE.start_main_~y~4 7)) (.cse81 (<= 7 ULTIMATE.start_main_~y~4)) (.cse10 (<= 20 ULTIMATE.start_main_~y~4)) (.cse11 (<= ULTIMATE.start_main_~y~4 20)) (.cse94 (<= 24 ULTIMATE.start_main_~y~4)) (.cse95 (<= ULTIMATE.start_main_~y~4 24)) (.cse0 (<= ULTIMATE.start_main_~y~4 11)) (.cse1 (<= 11 ULTIMATE.start_main_~y~4)) (.cse76 (<= 39 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 39)) (.cse50 (<= 33 ULTIMATE.start_main_~y~4)) (.cse51 (<= ULTIMATE.start_main_~y~4 33)) (.cse70 (<= ULTIMATE.start_main_~y~4 15)) (.cse71 (<= 15 ULTIMATE.start_main_~y~4)) (.cse66 (<= ULTIMATE.start_main_~y~4 10)) (.cse67 (<= 10 ULTIMATE.start_main_~y~4)) (.cse78 (<= 4 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 4))) (or (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse0 .cse1) (and .cse2 .cse3 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 4) (<= 4 ULTIMATE.start_main_~x~4)) (and .cse6 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4) .cse7) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse8 .cse9) (and (<= 79 ULTIMATE.start_main_~x~4) .cse10 (<= ULTIMATE.start_main_~x~4 79) .cse11) (and (<= ULTIMATE.start_main_~x~4 78) .cse12 (<= 78 ULTIMATE.start_main_~x~4) .cse13) (and .cse14 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse15) (and .cse4 .cse5 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse16 .cse17) (and .cse18 .cse19 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= ULTIMATE.start_main_~x~4 43) .cse14 .cse15 (<= 43 ULTIMATE.start_main_~x~4)) (and (<= 67 ULTIMATE.start_main_~x~4) .cse20 .cse21 (<= ULTIMATE.start_main_~x~4 67)) (and (<= 15 ULTIMATE.start_main_~x~4) .cse22 .cse23 (<= ULTIMATE.start_main_~x~4 15)) (and (<= ULTIMATE.start_main_~x~4 33) (<= 33 ULTIMATE.start_main_~x~4) .cse24 .cse25) (and .cse26 (<= 47 ULTIMATE.start_main_~x~4) .cse27 (<= ULTIMATE.start_main_~x~4 47)) (and .cse6 (<= ULTIMATE.start_main_~x~4 25) .cse7 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= 48 ULTIMATE.start_main_~x~4) .cse28 .cse29 (<= ULTIMATE.start_main_~x~4 48)) (and .cse30 (<= ULTIMATE.start_main_~x~4 26) .cse31 (<= 26 ULTIMATE.start_main_~x~4)) (and .cse32 .cse33 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 28) .cse34 .cse35 (<= 28 ULTIMATE.start_main_~x~4)) (and .cse36 .cse37 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and .cse38 (<= 29 ULTIMATE.start_main_~x~4) .cse39 (<= ULTIMATE.start_main_~x~4 29)) (and .cse40 (<= ULTIMATE.start_main_~x~4 87) .cse41 (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 36 ULTIMATE.start_main_~x~4) .cse42 .cse43 (<= ULTIMATE.start_main_~x~4 36)) (and .cse44 (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58) .cse45) (and (<= ULTIMATE.start_main_~x~4 59) .cse46 .cse47 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 27) .cse8 (<= 27 ULTIMATE.start_main_~x~4) .cse9) (and .cse48 (<= ULTIMATE.start_main_~x~4 42) .cse49 (<= 42 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) .cse50 (<= ULTIMATE.start_main_~x~4 66) .cse51) (and (<= ULTIMATE.start_main_~x~4 31) .cse20 (<= 31 ULTIMATE.start_main_~x~4) .cse21) (and (<= ULTIMATE.start_main_~x~4 37) .cse52 .cse53 (<= 37 ULTIMATE.start_main_~x~4)) (and .cse30 (<= 72 ULTIMATE.start_main_~x~4) .cse31 (<= ULTIMATE.start_main_~x~4 72)) (and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and .cse54 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse55) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse36 .cse37) (and .cse54 (<= ULTIMATE.start_main_~x~4 17) .cse55 (<= 17 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 0) (<= 0 ULTIMATE.start_main_~y~4) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and (<= 83 ULTIMATE.start_main_~x~4) .cse22 .cse23 (<= ULTIMATE.start_main_~x~4 83)) (and (<= 12 ULTIMATE.start_main_~x~4) .cse56 .cse57 (<= ULTIMATE.start_main_~x~4 12)) (and .cse56 .cse57 (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and .cse58 (<= 97 ULTIMATE.start_main_~x~4) .cse59 (<= ULTIMATE.start_main_~x~4 97)) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse60 .cse61) (and (<= ULTIMATE.start_main_~x~4 5) .cse32 .cse33 (<= 5 ULTIMATE.start_main_~x~4)) (and (<= 44 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 44) .cse62 .cse63) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse40 .cse41) (and (<= ULTIMATE.start_main_~x~4 90) .cse64 (<= 90 ULTIMATE.start_main_~x~4) .cse65) (and (<= ULTIMATE.start_main_~x~4 39) .cse46 (<= 39 ULTIMATE.start_main_~x~4) .cse47) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) .cse52 .cse53) (and (<= 63 ULTIMATE.start_main_~x~4) .cse16 (<= ULTIMATE.start_main_~x~4 63) .cse17) (and .cse66 (<= 9 ULTIMATE.start_main_~x~4) .cse67 (<= ULTIMATE.start_main_~x~4 9)) (and (<= ULTIMATE.start_main_~x~4 7) (<= 7 ULTIMATE.start_main_~x~4) .cse68 .cse69) (and .cse70 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse71) (and (<= 56 ULTIMATE.start_main_~x~4) .cse48 (<= ULTIMATE.start_main_~x~4 56) .cse49) (and (<= ULTIMATE.start_main_~x~4 64) .cse72 (<= 64 ULTIMATE.start_main_~x~4) .cse73) (and .cse74 (<= ULTIMATE.start_main_~x~4 24) .cse75 (<= 24 ULTIMATE.start_main_~x~4)) (and .cse58 .cse59 (<= ULTIMATE.start_main_~x~4 1) (<= 1 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) .cse42 .cse43 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse64 (<= ULTIMATE.start_main_~x~4 8) (<= 8 ULTIMATE.start_main_~x~4) .cse65) (and .cse76 .cse77 (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60)) (and (<= 74 ULTIMATE.start_main_~x~4) .cse74 .cse75 (<= ULTIMATE.start_main_~x~4 74)) (and (<= 51 ULTIMATE.start_main_~x~4) .cse26 .cse27 (<= ULTIMATE.start_main_~x~4 51)) (and .cse78 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse79) (and .cse80 (<= 6 ULTIMATE.start_main_~x~4) .cse81 (<= ULTIMATE.start_main_~x~4 6)) (and .cse82 .cse83 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 46) .cse84 (<= 46 ULTIMATE.start_main_~x~4) .cse85) (and (<= ULTIMATE.start_main_~x~4 30) .cse86 (<= 30 ULTIMATE.start_main_~x~4) .cse87) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse18 .cse19) (and (<= ULTIMATE.start_main_~x~4 21) .cse88 (<= 21 ULTIMATE.start_main_~x~4) .cse89) (and (<= (+ ULTIMATE.start_main_~y~4 1) 0) (<= ULTIMATE.start_main_~x~4 100) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 16) (<= 16 ULTIMATE.start_main_~x~4) .cse90 .cse91) (and (<= 20 ULTIMATE.start_main_~x~4) .cse12 (<= ULTIMATE.start_main_~x~4 20) .cse13) (and (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse34 .cse35) (and (<= ULTIMATE.start_main_~x~4 91) (<= 91 ULTIMATE.start_main_~x~4) .cse68 .cse69) (and (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse92 .cse93) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) .cse92 .cse93) (and (<= ULTIMATE.start_main_~x~4 54) .cse62 (<= 54 ULTIMATE.start_main_~x~4) .cse63) (and (<= ULTIMATE.start_main_~x~4 76) .cse82 .cse83 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 68) .cse86 (<= 68 ULTIMATE.start_main_~x~4) .cse87) (and (<= ULTIMATE.start_main_~x~4 40) .cse44 (<= 40 ULTIMATE.start_main_~x~4) .cse45) (and (<= ULTIMATE.start_main_~x~4 75) .cse94 (<= 75 ULTIMATE.start_main_~x~4) .cse95) (and .cse96 .cse97 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~x~4 77) .cse88 (<= 77 ULTIMATE.start_main_~x~4) .cse89) (and (<= ULTIMATE.start_main_~y~4 50) (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) (<= 50 ULTIMATE.start_main_~y~4)) (and .cse60 (<= ULTIMATE.start_main_~x~4 80) .cse61 (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 34 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 34) .cse72 .cse73) (and .cse24 .cse25 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse2 .cse3 (<= 2 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 2)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse90 .cse91) (and .cse38 .cse39 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)) (and .cse96 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse97) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse84 .cse85) (and .cse80 (<= ULTIMATE.start_main_~x~4 92) .cse81 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse10 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse11) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse94 .cse95) (and (<= ULTIMATE.start_main_~x~4 10) .cse0 .cse1 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse76 (<= ULTIMATE.start_main_~x~4 38) .cse77) (and (<= ULTIMATE.start_main_~x~4 32) .cse50 (<= 32 ULTIMATE.start_main_~x~4) .cse51) (and .cse70 (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4) .cse71) (and .cse66 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse67) (and (<= 3 ULTIMATE.start_main_~x~4) .cse78 (<= ULTIMATE.start_main_~x~4 3) .cse79))) [2018-09-26 08:12:45,858 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:12:45 BoogieIcfgContainer [2018-09-26 08:12:45,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:12:45,862 INFO L168 Benchmark]: Toolchain (without parser) took 131331.48 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:12:45,863 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:12:45,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:12:45,864 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:12:45,864 INFO L168 Benchmark]: RCFGBuilder took 286.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:12:45,866 INFO L168 Benchmark]: TraceAbstraction took 130965.98 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:12:45,872 INFO L336 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 286.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130965.98 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((31 <= main_~y~4 && 69 <= main_~x~4) && main_~x~4 <= 69) && main_~y~4 <= 31) || (((main_~y~4 <= 22 && main_~x~4 <= 78) && 78 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 7 && 7 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((48 <= main_~x~4 && 48 <= main_~y~4) && main_~y~4 <= 48) && main_~x~4 <= 48)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && 95 <= main_~x~4) && main_~x~4 <= 95)) || (((main_~x~4 <= 54 && main_~y~4 <= 46) && 54 <= main_~x~4) && 46 <= main_~y~4)) || (((main_~x~4 <= 77 && 77 <= main_~x~4) && main_~y~4 <= 23) && 23 <= main_~y~4)) || (((19 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 19)) || (((72 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 72) && 28 <= main_~y~4)) || (((main_~x~4 <= 64 && main_~y~4 <= 36) && 64 <= main_~x~4) && 36 <= main_~y~4)) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((79 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 21)) || (((main_~y~4 <= 28 && main_~x~4 <= 28) && 28 <= main_~y~4) && 28 <= main_~x~4)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 41) && 41 <= main_~y~4)) || (((49 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 49)) || (((20 <= main_~y~4 && main_~x~4 <= 80) && 80 <= main_~x~4) && main_~y~4 <= 20)) || (((main_~x~4 <= 16 && 16 <= main_~x~4) && 16 <= main_~y~4) && main_~y~4 <= 16)) || (((12 <= main_~x~4 && 12 <= main_~y~4) && main_~y~4 <= 12) && main_~x~4 <= 12)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || (((29 <= main_~x~4 && main_~y~4 <= 29) && 29 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 21 && 21 <= main_~y~4) && 21 <= main_~x~4) && main_~y~4 <= 21)) || (((20 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 20)) || (((main_~x~4 <= 26 && main_~y~4 <= 26) && 26 <= main_~y~4) && 26 <= main_~x~4)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && main_~x~4 <= 13) && 13 <= main_~x~4)) || (((51 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 51)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 0) && 0 <= main_~x~4)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((main_~x~4 <= 76 && 24 <= main_~y~4) && main_~y~4 <= 24) && 76 <= main_~x~4)) || (((60 <= main_~x~4 && main_~y~4 <= 40) && main_~x~4 <= 60) && 40 <= main_~y~4)) || (((58 <= main_~x~4 && main_~y~4 <= 42) && 42 <= main_~y~4) && main_~x~4 <= 58)) || (((main_~x~4 <= 32 && 32 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 32)) || (((19 <= main_~y~4 && 19 <= main_~x~4) && main_~y~4 <= 19) && main_~x~4 <= 19)) || (((main_~x~4 <= 33 && 33 <= main_~y~4) && 33 <= main_~x~4) && main_~y~4 <= 33)) || (((67 <= main_~x~4 && 33 <= main_~y~4) && main_~y~4 <= 33) && main_~x~4 <= 67)) || (((18 <= main_~y~4 && main_~x~4 <= 82) && 82 <= main_~x~4) && main_~y~4 <= 18)) || (((main_~y~4 <= 9 && 9 <= main_~x~4) && main_~x~4 <= 9) && 9 <= main_~y~4)) || (((39 <= main_~y~4 && main_~x~4 <= 39) && main_~y~4 <= 39) && 39 <= main_~x~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((43 <= main_~y~4 && main_~x~4 <= 43) && 43 <= main_~x~4) && main_~y~4 <= 43)) || (((main_~x~4 <= 1 && main_~y~4 <= 1) && 1 <= main_~y~4) && 1 <= main_~x~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 22) && 22 <= main_~x~4) && 22 <= main_~y~4)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((66 <= main_~x~4 && main_~x~4 <= 66) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((32 <= main_~y~4 && main_~x~4 <= 68) && 68 <= main_~x~4) && main_~y~4 <= 32)) || (((main_~x~4 <= 91 && main_~y~4 <= 9) && 91 <= main_~x~4) && 9 <= main_~y~4)) || (((6 <= main_~x~4 && 6 <= main_~y~4) && main_~y~4 <= 6) && main_~x~4 <= 6)) || (((main_~x~4 <= 7 && main_~y~4 <= 7) && 7 <= main_~y~4) && 7 <= main_~x~4)) || (((main_~x~4 <= 75 && 75 <= main_~x~4) && 25 <= main_~y~4) && main_~y~4 <= 25)) || (((47 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 47)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 90 <= main_~x~4) && 10 <= main_~y~4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 23) && 23 <= main_~y~4)) || (((main_~x~4 <= 98 && main_~y~4 <= 2) && 2 <= main_~y~4) && 98 <= main_~x~4)) || (((main_~x~4 <= 5 && 5 <= main_~y~4) && main_~y~4 <= 5) && 5 <= main_~x~4)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 <= 25) && 25 <= main_~x~4)) || (((main_~y~4 <= 15 && 85 <= main_~x~4) && main_~x~4 <= 85) && 15 <= main_~y~4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && main_~x~4 <= 42) && 42 <= main_~x~4)) || (((main_~x~4 <= 8 && 8 <= main_~y~4) && main_~y~4 <= 8) && 8 <= main_~x~4)) || (((main_~y~4 <= 27 && 27 <= main_~y~4) && main_~x~4 <= 73) && 73 <= main_~x~4)) || (((37 <= main_~y~4 && main_~x~4 <= 37) && main_~y~4 <= 37) && 37 <= main_~x~4)) || (((61 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 39)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 41) && 41 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~y~4 <= 10 && main_~x~4 <= 10) && 10 <= main_~y~4) && 10 <= main_~x~4)) || (((45 <= main_~y~4 && 55 <= main_~x~4) && main_~x~4 <= 55) && main_~y~4 <= 45)) || (((main_~y~4 <= 27 && main_~x~4 <= 27) && 27 <= main_~y~4) && 27 <= main_~x~4)) || (((main_~y~4 <= 13 && main_~x~4 <= 87) && 13 <= main_~y~4) && 87 <= main_~x~4)) || (((18 <= main_~y~4 && 18 <= main_~x~4) && main_~x~4 <= 18) && main_~y~4 <= 18)) || (((main_~x~4 <= 31 && 31 <= main_~y~4) && main_~y~4 <= 31) && 31 <= main_~x~4)) || (((main_~x~4 <= 62 && main_~y~4 <= 38) && 38 <= main_~y~4) && 62 <= main_~x~4)) || (((main_~x~4 <= 46 && 46 <= main_~x~4) && main_~y~4 <= 46) && 46 <= main_~y~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 30) && 30 <= main_~y~4) && 30 <= main_~x~4)) || (((16 <= main_~y~4 && main_~x~4 <= 84) && main_~y~4 <= 16) && 84 <= main_~x~4)) || (((47 <= main_~y~4 && 47 <= main_~x~4) && main_~x~4 <= 47) && main_~y~4 <= 47)) || (((74 <= main_~x~4 && main_~y~4 <= 26) && main_~x~4 <= 74) && 26 <= main_~y~4)) || (((38 <= main_~x~4 && main_~x~4 <= 38) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && 97 <= main_~x~4) && main_~x~4 <= 97)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 70 <= main_~x~4) && 30 <= main_~y~4)) || (((3 <= main_~x~4 && main_~y~4 <= 3) && 3 <= main_~y~4) && main_~x~4 <= 3)) || (((45 <= main_~y~4 && 45 <= main_~x~4) && main_~y~4 <= 45) && main_~x~4 <= 45)) || (((63 <= main_~x~4 && 37 <= main_~y~4) && main_~y~4 <= 37) && main_~x~4 <= 63)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((12 <= main_~y~4 && 88 <= main_~x~4) && main_~x~4 <= 88) && main_~y~4 <= 12)) || (((43 <= main_~y~4 && 57 <= main_~x~4) && main_~x~4 <= 57) && main_~y~4 <= 43)) || (((24 <= main_~y~4 && main_~x~4 <= 24) && 24 <= main_~x~4) && main_~y~4 <= 24)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 48 <= main_~y~4) && main_~y~4 <= 48)) || (((14 <= main_~y~4 && 14 <= main_~x~4) && main_~x~4 <= 14) && main_~y~4 <= 14)) || (((main_~x~4 <= 89 && 89 <= main_~x~4) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((main_~y~4 <= 15 && 15 <= main_~x~4) && 15 <= main_~y~4) && main_~x~4 <= 15)) || (((main_~x~4 <= 40 && main_~y~4 <= 40) && 40 <= main_~x~4) && 40 <= main_~y~4)) || (((14 <= main_~y~4 && 86 <= main_~x~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || (((36 <= main_~x~4 && main_~y~4 <= 36) && main_~x~4 <= 36) && 36 <= main_~y~4)) || (((main_~x~4 <= 35 && 35 <= main_~y~4) && 35 <= main_~x~4) && main_~y~4 <= 35)) || (((4 <= main_~y~4 && main_~x~4 <= 4) && 4 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 17 && 17 <= main_~y~4) && main_~y~4 <= 17) && 17 <= main_~x~4) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((88 <= main_~x~4 && main_~x~4 <= 88) && main_~y~4 <= 11) && 11 <= main_~y~4) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 4) && 4 <= main_~x~4)) || (((main_~y~4 <= 26 && main_~x~4 <= 73) && 73 <= main_~x~4) && 26 <= main_~y~4)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 28) && 28 <= main_~y~4)) || (((79 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 20)) || (((main_~x~4 <= 78 && 21 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 21)) || (((main_~y~4 <= 44 && 55 <= main_~x~4) && main_~x~4 <= 55) && 44 <= main_~y~4)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((main_~x~4 <= 35 && 35 <= main_~x~4) && main_~y~4 <= 36) && 36 <= main_~y~4)) || (((main_~y~4 <= 46 && 46 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((main_~x~4 <= 43 && main_~y~4 <= 44) && 44 <= main_~y~4) && 43 <= main_~x~4)) || (((67 <= main_~x~4 && 32 <= main_~y~4) && main_~y~4 <= 32) && main_~x~4 <= 67)) || (((15 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 15)) || (((main_~x~4 <= 33 && 33 <= main_~x~4) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((48 <= main_~y~4 && 47 <= main_~x~4) && main_~y~4 <= 48) && main_~x~4 <= 47)) || (((main_~y~4 <= 26 && main_~x~4 <= 25) && 26 <= main_~y~4) && 25 <= main_~x~4)) || (((48 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 48)) || (((main_~y~4 <= 27 && main_~x~4 <= 26) && 27 <= main_~y~4) && 26 <= main_~x~4)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 28 && main_~y~4 <= 29) && 29 <= main_~y~4) && 28 <= main_~x~4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((main_~y~4 <= 30 && 29 <= main_~x~4) && 30 <= main_~y~4) && main_~x~4 <= 29)) || (((12 <= main_~y~4 && main_~x~4 <= 87) && main_~y~4 <= 12) && 87 <= main_~x~4)) || (((36 <= main_~x~4 && 37 <= main_~y~4) && main_~y~4 <= 37) && main_~x~4 <= 36)) || (((main_~y~4 <= 41 && 58 <= main_~x~4) && main_~x~4 <= 58) && 41 <= main_~y~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 40) && 40 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~x~4 <= 27 && main_~y~4 <= 28) && 27 <= main_~x~4) && 28 <= main_~y~4)) || (((43 <= main_~y~4 && main_~x~4 <= 42) && main_~y~4 <= 43) && 42 <= main_~x~4)) || (((66 <= main_~x~4 && 33 <= main_~y~4) && main_~x~4 <= 66) && main_~y~4 <= 33)) || (((main_~x~4 <= 31 && 32 <= main_~y~4) && 31 <= main_~x~4) && main_~y~4 <= 32)) || (((main_~x~4 <= 37 && main_~y~4 <= 38) && 38 <= main_~y~4) && 37 <= main_~x~4)) || (((main_~y~4 <= 27 && 72 <= main_~x~4) && 27 <= main_~y~4) && main_~x~4 <= 72)) || (((main_~x~4 <= 50 && 50 <= main_~x~4) && 49 <= main_~y~4) && main_~y~4 <= 49)) || (((18 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 18)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 42) && 42 <= main_~y~4)) || (((18 <= main_~y~4 && main_~x~4 <= 17) && main_~y~4 <= 18) && 17 <= main_~x~4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((83 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 83)) || (((12 <= main_~x~4 && main_~y~4 <= 13) && 13 <= main_~y~4) && main_~x~4 <= 12)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~y~4 <= 2 && 97 <= main_~x~4) && 2 <= main_~y~4) && main_~x~4 <= 97)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && 19 <= main_~y~4) && main_~y~4 <= 19)) || (((main_~x~4 <= 5 && 6 <= main_~y~4) && main_~y~4 <= 6) && 5 <= main_~x~4)) || (((44 <= main_~x~4 && main_~x~4 <= 44) && 45 <= main_~y~4) && main_~y~4 <= 45)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && 12 <= main_~y~4) && main_~y~4 <= 12)) || (((main_~x~4 <= 90 && main_~y~4 <= 9) && 90 <= main_~x~4) && 9 <= main_~y~4)) || (((main_~x~4 <= 39 && main_~y~4 <= 40) && 39 <= main_~x~4) && 40 <= main_~y~4)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((63 <= main_~x~4 && main_~y~4 <= 36) && main_~x~4 <= 63) && 36 <= main_~y~4)) || (((main_~y~4 <= 10 && 9 <= main_~x~4) && 10 <= main_~y~4) && main_~x~4 <= 9)) || (((main_~x~4 <= 7 && 7 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((main_~y~4 <= 15 && 14 <= main_~x~4) && main_~x~4 <= 14) && 15 <= main_~y~4)) || (((56 <= main_~x~4 && 43 <= main_~y~4) && main_~x~4 <= 56) && main_~y~4 <= 43)) || (((main_~x~4 <= 64 && 35 <= main_~y~4) && 64 <= main_~x~4) && main_~y~4 <= 35)) || (((25 <= main_~y~4 && main_~x~4 <= 24) && main_~y~4 <= 25) && 24 <= main_~x~4)) || (((main_~y~4 <= 2 && 2 <= main_~y~4) && main_~x~4 <= 1) && 1 <= main_~x~4)) || (((main_~x~4 <= 62 && 37 <= main_~y~4) && main_~y~4 <= 37) && 62 <= main_~x~4)) || (((main_~y~4 <= 9 && main_~x~4 <= 8) && 8 <= main_~x~4) && 9 <= main_~y~4)) || (((39 <= main_~y~4 && main_~y~4 <= 39) && 60 <= main_~x~4) && main_~x~4 <= 60)) || (((74 <= main_~x~4 && 25 <= main_~y~4) && main_~y~4 <= 25) && main_~x~4 <= 74)) || (((51 <= main_~x~4 && 48 <= main_~y~4) && main_~y~4 <= 48) && main_~x~4 <= 51)) || (((4 <= main_~y~4 && 95 <= main_~x~4) && main_~x~4 <= 95) && main_~y~4 <= 4)) || (((main_~y~4 <= 7 && 6 <= main_~x~4) && 7 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((main_~x~4 <= 46 && 47 <= main_~y~4) && 46 <= main_~x~4) && main_~y~4 <= 47)) || (((main_~x~4 <= 30 && 31 <= main_~y~4) && 30 <= main_~x~4) && main_~y~4 <= 31)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && main_~y~4 <= 46) && 46 <= main_~y~4)) || (((main_~x~4 <= 21 && main_~y~4 <= 22) && 21 <= main_~x~4) && 22 <= main_~y~4)) || ((main_~y~4 + 1 <= 0 && main_~x~4 <= 100) && 100 <= main_~x~4)) || (((main_~x~4 <= 16 && 16 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((20 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 20) && main_~y~4 <= 21)) || (((main_~x~4 <= 70 && 70 <= main_~x~4) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((main_~x~4 <= 91 && 91 <= main_~x~4) && 8 <= main_~y~4) && main_~y~4 <= 8)) || (((main_~x~4 <= 0 && 0 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((main_~x~4 <= 54 && 45 <= main_~y~4) && 54 <= main_~x~4) && main_~y~4 <= 45)) || (((main_~x~4 <= 76 && main_~y~4 <= 23) && 23 <= main_~y~4) && 76 <= main_~x~4)) || (((main_~x~4 <= 68 && 31 <= main_~y~4) && 68 <= main_~x~4) && main_~y~4 <= 31)) || (((main_~x~4 <= 40 && main_~y~4 <= 41) && 40 <= main_~x~4) && 41 <= main_~y~4)) || (((main_~x~4 <= 75 && 24 <= main_~y~4) && 75 <= main_~x~4) && main_~y~4 <= 24)) || (((14 <= main_~y~4 && main_~y~4 <= 14) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~x~4 <= 77 && main_~y~4 <= 22) && 77 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4)) || (((19 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 19) && 80 <= main_~x~4)) || (((34 <= main_~x~4 && main_~x~4 <= 34) && 35 <= main_~y~4) && main_~y~4 <= 35)) || (((main_~y~4 <= 34 && 34 <= main_~y~4) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && 2 <= main_~x~4) && main_~x~4 <= 2)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && 69 <= main_~x~4) && main_~x~4 <= 69)) || (((14 <= main_~y~4 && main_~x~4 <= 13) && 13 <= main_~x~4) && main_~y~4 <= 14)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 47 <= main_~y~4) && main_~y~4 <= 47)) || (((main_~y~4 <= 7 && main_~x~4 <= 92) && 7 <= main_~y~4) && 92 <= main_~x~4)) || (((20 <= main_~y~4 && 19 <= main_~x~4) && main_~x~4 <= 19) && main_~y~4 <= 20)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && 24 <= main_~y~4) && main_~y~4 <= 24)) || (((main_~x~4 <= 10 && main_~y~4 <= 11) && 11 <= main_~y~4) && 10 <= main_~x~4)) || (((38 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 38) && main_~y~4 <= 39)) || (((main_~x~4 <= 32 && 33 <= main_~y~4) && 32 <= main_~x~4) && main_~y~4 <= 33)) || (((main_~y~4 <= 15 && main_~x~4 <= 84) && 84 <= main_~x~4) && 15 <= main_~y~4)) || (((main_~y~4 <= 10 && main_~x~4 <= 89) && 89 <= main_~x~4) && 10 <= main_~y~4)) || (((3 <= main_~x~4 && 4 <= main_~y~4) && main_~x~4 <= 3) && main_~y~4 <= 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 130.8s OverallTime, 102 OverallIterations, 102 TraceHistogramMax, 61.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 99 SDslu, 4273 SDs, 0 SdLazy, 612271 SolverSat, 11331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10273 GetRequests, 102 SyntacticMatches, 50 SemanticMatches, 10121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336840 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=101, 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: 1.4s AutomataMinimizationTime, 102 MinimizatonAttempts, 97 StatesRemovedByMinimization, 97 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 208 NumberOfFragments, 2631 HoareAnnotationTreeSize, 6 FomulaSimplifications, 3166593487994532 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 6 FomulaSimplificationsInter, 780 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 56.7s InterpolantComputationTime, 10710 NumberOfCodeBlocks, 10710 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 10608 ConstructedInterpolants, 0 QuantifiedInterpolants, 11299226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 1 PerfectInterpolantSequences, 2752/353702 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-12-45-896.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gr2006.c.i_4.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-12-45-896.csv Received shutdown request...