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/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:10:44,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:10:44,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:10:44,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:10:44,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:10:44,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:10:44,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:10:44,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:10:44,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:10:44,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:10:44,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:10:44,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:10:44,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:10:44,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:10:44,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:10:44,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:10:44,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:10:44,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:10:44,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:10:44,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:10:44,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:10:44,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:10:44,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:10:44,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:10:44,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:10:44,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:10:44,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:10:44,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:10:44,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:10:44,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:10:44,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:10:44,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:10:44,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:10:44,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:10:44,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:10:44,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:10:44,092 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:44,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:10:44,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:10:44,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:10:44,102 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:10:44,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:10:44,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:10:44,103 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:10:44,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:10:44,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:10:44,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:10:44,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:10:44,173 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:10:44,174 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:10:44,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl [2018-09-26 08:10:44,175 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl' [2018-09-26 08:10:44,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:10:44,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:10:44,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:44,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:10:44,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:10:44,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:44,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:10:44,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:10:44,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:10:44,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:10:44,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:10:44,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:10:44,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:10:44,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/1) ... [2018-09-26 08:10:44,378 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:10:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:10:44,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:10:44,595 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:10:44,596 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:44 BoogieIcfgContainer [2018-09-26 08:10:44,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:10:44,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:10:44,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:10:44,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:10:44,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:44" (1/2) ... [2018-09-26 08:10:44,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fc2d01 and model type jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:10:44, skipping insertion in model container [2018-09-26 08:10:44,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:44" (2/2) ... [2018-09-26 08:10:44,605 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl [2018-09-26 08:10:44,617 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:10:44,625 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:10:44,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:10:44,676 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:10:44,677 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:10:44,677 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:10:44,677 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:10:44,677 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:10:44,678 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:10:44,678 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:10:44,678 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:10:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:10:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:10:44,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:10:44,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 947099, now seen corresponding path program 1 times [2018-09-26 08:10:44,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,798 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:44,800 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:44,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:10:44,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:44,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:44,821 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-26 08:10:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,856 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-26 08:10:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:44,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:10:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,870 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:10:44,870 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:10:44,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:10:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-09-26 08:10:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:10:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:10:44,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:10:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,913 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:10:44,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:10:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:10:44,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,915 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:10:44,915 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash 910108837, now seen corresponding path program 1 times [2018-09-26 08:10:44,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:44,956 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:44,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:44,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:44,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:44,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:44,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:44,961 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-09-26 08:10:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,011 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:10:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:45,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-09-26 08:10:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,012 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:10:45,012 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:10:45,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:10:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-26 08:10:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:10:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:10:45,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:10:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,018 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:10:45,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:10:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:45,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,019 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:10:45,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1558789329, now seen corresponding path program 2 times [2018-09-26 08:10:45,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,090 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:45,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:45,093 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 08:10:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,141 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:10:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:45,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 08:10:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,142 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:10:45,142 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:10:45,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:10:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-26 08:10:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:10:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:10:45,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:10:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,149 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:10:45,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:10:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:10:45,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,150 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:10:45,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash 946987833, now seen corresponding path program 3 times [2018-09-26 08:10:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,262 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:45,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:45,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:45,268 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-09-26 08:10:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,322 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:10:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:45,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:10:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,324 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:10:45,325 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:10:45,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:10:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-26 08:10:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:10:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:10:45,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:10:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,332 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:10:45,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:10:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:10:45,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,333 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:10:45,333 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -477812541, now seen corresponding path program 4 times [2018-09-26 08:10:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,397 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:45,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:45,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:45,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:45,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:45,401 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 08:10:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,484 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:10:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:45,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:10:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,486 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:10:45,486 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:10:45,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:10:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-26 08:10:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:10:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:10:45,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:10:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,502 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:10:45,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:10:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:10:45,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,506 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:10:45,506 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 383595469, now seen corresponding path program 5 times [2018-09-26 08:10:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,563 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:45,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:45,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:45,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:45,566 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-09-26 08:10:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,643 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:10:45,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:45,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-09-26 08:10:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,644 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:10:45,644 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:10:45,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:10:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 08:10:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:10:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:10:45,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:10:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,653 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:10:45,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:10:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:10:45,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,654 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:10:45,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,655 INFO L82 PathProgramCache]: Analyzing trace with hash -731995049, now seen corresponding path program 6 times [2018-09-26 08:10:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,716 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:45,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:45,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:45,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:45,718 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 08:10:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:45,852 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:10:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:45,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 08:10:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:45,857 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:10:45,857 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:10:45,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:10:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-09-26 08:10:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:10:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:10:45,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:10:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:45,876 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:10:45,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:10:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:10:45,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:45,879 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:10:45,879 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:45,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 927341153, now seen corresponding path program 7 times [2018-09-26 08:10:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,978 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:45,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:45,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:45,981 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-09-26 08:10:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,066 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:10:46,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:46,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:10:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,068 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:10:46,068 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:10:46,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:10:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-26 08:10:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:10:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:10:46,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:10:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,081 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:10:46,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:10:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:10:46,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,083 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:10:46,083 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2116564459, now seen corresponding path program 8 times [2018-09-26 08:10:46,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,182 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:46,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:46,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:46,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:46,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:46,184 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 08:10:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,284 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:10:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:46,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:10:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,286 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:10:46,286 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:10:46,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:10:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-26 08:10:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:10:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:10:46,310 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:10:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,310 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:10:46,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:10:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:10:46,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,316 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:10:46,317 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1796106507, now seen corresponding path program 9 times [2018-09-26 08:10:46,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,399 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:46,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:46,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:46,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:46,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:46,401 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-09-26 08:10:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,500 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:10:46,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:10:46,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-09-26 08:10:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,501 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:10:46,502 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:10:46,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:10:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-26 08:10:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:10:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:10:46,510 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:10:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,510 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:10:46,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:10:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:10:46,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,512 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:10:46,512 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 518446463, now seen corresponding path program 10 times [2018-09-26 08:10:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,597 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:46,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:46,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:46,600 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 08:10:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,731 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:10:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:46,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 08:10:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,732 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:10:46,732 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:10:46,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:10:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-09-26 08:10:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:10:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:10:46,741 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:10:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,742 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:10:46,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:10:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:10:46,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,743 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:10:46,744 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash 10791305, now seen corresponding path program 11 times [2018-09-26 08:10:46,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,847 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:46,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:10:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:10:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:10:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:46,849 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-09-26 08:10:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:46,971 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:10:46,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:10:46,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-26 08:10:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:46,972 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:10:46,973 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:10:46,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:10:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 08:10:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:10:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:10:46,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:10:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,982 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:10:46,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:10:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:10:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:10:46,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,984 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:10:46,984 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1780456211, now seen corresponding path program 12 times [2018-09-26 08:10:46,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,091 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:47,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:47,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:47,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:47,093 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 08:10:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,224 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:10:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:10:47,226 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 08:10:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,227 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:10:47,227 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:10:47,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:10:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-09-26 08:10:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:10:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:10:47,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:10:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,243 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:10:47,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:10:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:10:47,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,248 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:10:47,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1621381661, now seen corresponding path program 13 times [2018-09-26 08:10:47,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,391 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:47,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:47,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:47,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:47,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:47,394 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-09-26 08:10:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,563 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:10:47,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:10:47,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-09-26 08:10:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,564 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:10:47,564 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:10:47,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:10:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-26 08:10:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:10:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:10:47,585 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:10:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,585 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:10:47,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:10:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:10:47,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,588 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:10:47,588 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash -925405529, now seen corresponding path program 14 times [2018-09-26 08:10:47,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:47,746 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:47,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:47,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:47,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:47,748 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 08:10:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,932 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:10:47,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:10:47,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 08:10:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,933 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:10:47,934 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:10:47,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:10:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-09-26 08:10:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:10:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:10:47,946 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:10:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:10:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:10:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:10:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:10:47,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,948 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:10:47,949 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash -256536399, now seen corresponding path program 15 times [2018-09-26 08:10:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,101 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:48,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:10:48,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:10:48,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:10:48,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:48,107 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-09-26 08:10:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,292 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:10:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:10:48,292 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-09-26 08:10:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,293 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:10:48,293 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:10:48,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:10:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-26 08:10:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:10:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:10:48,305 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:10:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,305 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:10:48,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:10:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:10:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:10:48,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,306 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:10:48,307 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1718396869, now seen corresponding path program 16 times [2018-09-26 08:10:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,471 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:48,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:10:48,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:10:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:10:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:48,473 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 08:10:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:48,734 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:10:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:48,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 08:10:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:48,735 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:10:48,735 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:10:48,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:10:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:10:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-09-26 08:10:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:10:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:10:48,752 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:10:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:48,752 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:10:48,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:10:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:10:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:10:48,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:48,755 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:10:48,756 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:48,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2112002747, now seen corresponding path program 17 times [2018-09-26 08:10:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,893 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:48,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:10:48,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:10:48,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:10:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:48,895 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-09-26 08:10:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,079 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:10:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:49,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-09-26 08:10:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,080 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:10:49,080 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:10:49,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:10:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-26 08:10:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:10:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:10:49,091 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:10:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,092 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:10:49,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:10:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:10:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:10:49,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,093 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:10:49,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1884837839, now seen corresponding path program 18 times [2018-09-26 08:10:49,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,232 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:49,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:10:49,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:10:49,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:10:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:49,234 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-26 08:10:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,428 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:10:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:10:49,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-26 08:10:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,429 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:10:49,429 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:10:49,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:10:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:10:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-09-26 08:10:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:10:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:10:49,441 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:10:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,441 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:10:49,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:10:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:10:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:10:49,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,443 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:10:49,443 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1147088935, now seen corresponding path program 19 times [2018-09-26 08:10:49,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,590 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:49,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:10:49,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:10:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:10:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:49,592 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-09-26 08:10:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:49,816 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:10:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:10:49,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-09-26 08:10:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:49,817 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:10:49,818 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:10:49,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:10:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-26 08:10:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:10:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:10:49,833 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:10:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:49,833 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:10:49,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:10:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:10:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:10:49,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:49,834 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:10:49,834 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:49,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:49,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1454075235, now seen corresponding path program 20 times [2018-09-26 08:10:49,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:49,988 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:49,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:49,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:10:49,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:10:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:10:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:49,990 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-26 08:10:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,201 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:10:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:50,201 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 08:10:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,202 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:10:50,202 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:10:50,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:10:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:10:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-09-26 08:10:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:10:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:10:50,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:10:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:10:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:10:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:10:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:10:50,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,217 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:10:50,217 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1501876333, now seen corresponding path program 21 times [2018-09-26 08:10:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,379 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:50,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:10:50,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:10:50,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:10:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:10:50,381 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2018-09-26 08:10:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:50,610 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:10:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:10:50,611 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-09-26 08:10:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:50,611 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:10:50,611 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:10:50,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:10:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:10:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-26 08:10:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:10:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:10:50,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:10:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:50,633 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:10:50,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:10:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:10:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:10:50,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:50,635 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:10:50,635 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:50,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 194091255, now seen corresponding path program 22 times [2018-09-26 08:10:50,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:50,831 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:50,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:50,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:10:50,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:10:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:10:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:50,833 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-26 08:10:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,132 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:10:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:51,132 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-26 08:10:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,133 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:10:51,133 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:10:51,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:10:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-09-26 08:10:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:10:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:10:51,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:10:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,158 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:10:51,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:10:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:10:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:10:51,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,159 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:10:51,159 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1838049025, now seen corresponding path program 23 times [2018-09-26 08:10:51,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,402 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:51,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:10:51,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:10:51,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:10:51,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:10:51,404 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2018-09-26 08:10:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,691 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:10:51,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:10:51,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-09-26 08:10:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,692 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:10:51,692 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:10:51,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:10:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:10:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 08:10:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:10:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:10:51,709 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:10:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,710 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:10:51,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:10:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:10:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:10:51,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,711 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:10:51,711 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1133501067, now seen corresponding path program 24 times [2018-09-26 08:10:51,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:51,922 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:51,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:51,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:10:51,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:10:51,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:10:51,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:51,924 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-26 08:10:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:52,198 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:10:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:52,198 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-26 08:10:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:52,199 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:10:52,199 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:10:52,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:10:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:10:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-09-26 08:10:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:10:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:10:52,221 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:10:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:52,222 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:10:52,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:10:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:10:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:10:52,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:52,227 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:10:52,227 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:52,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1627221099, now seen corresponding path program 25 times [2018-09-26 08:10:52,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,430 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:52,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:10:52,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:10:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:10:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:52,432 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2018-09-26 08:10:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:52,717 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:10:52,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:10:52,718 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-09-26 08:10:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:52,718 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:10:52,719 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:10:52,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:10:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-26 08:10:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:10:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:10:52,736 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:10:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:52,736 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:10:52,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:10:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:10:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:10:52,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:52,737 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:10:52,738 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash -391433697, now seen corresponding path program 26 times [2018-09-26 08:10:52,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,954 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:52,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:10:52,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:10:52,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:10:52,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:52,956 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-26 08:10:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,269 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:10:53,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:10:53,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-26 08:10:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,270 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:10:53,270 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:10:53,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:10:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:10:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-09-26 08:10:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:10:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:10:53,286 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:10:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,287 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:10:53,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:10:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:10:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:10:53,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,289 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:10:53,289 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1789285929, now seen corresponding path program 27 times [2018-09-26 08:10:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,507 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:53,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:53,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:10:53,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:10:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:10:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:53,509 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2018-09-26 08:10:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,886 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:10:53,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:10:53,887 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-09-26 08:10:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,888 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:10:53,888 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:10:53,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:10:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 08:10:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:10:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:10:53,912 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:10:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:53,912 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:10:53,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:10:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:10:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:10:53,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,913 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:10:53,914 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1516806067, now seen corresponding path program 28 times [2018-09-26 08:10:53,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,192 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:54,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:10:54,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:10:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:10:54,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:54,195 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-26 08:10:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,518 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:10:54,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:10:54,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-26 08:10:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,519 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:10:54,519 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:10:54,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:10:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:10:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-09-26 08:10:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:10:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:10:54,537 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:10:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,537 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:10:54,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:10:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:10:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:10:54,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,538 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:10:54,538 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1656663741, now seen corresponding path program 29 times [2018-09-26 08:10:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,747 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:54,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:10:54,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:10:54,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:10:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:54,749 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-09-26 08:10:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,075 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:10:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:10:55,075 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-09-26 08:10:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,076 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:10:55,076 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:10:55,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:10:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:10:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-26 08:10:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:10:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:10:55,095 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:10:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,096 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:10:55,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:10:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:10:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:10:55,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,097 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:10:55,097 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1379065017, now seen corresponding path program 30 times [2018-09-26 08:10:55,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,308 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:55,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:10:55,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:10:55,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:10:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:55,310 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-26 08:10:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,653 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:10:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:10:55,653 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-26 08:10:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,654 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:10:55,654 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:10:55,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:10:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-09-26 08:10:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:10:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:10:55,673 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:10:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,673 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:10:55,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:10:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:10:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:10:55,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,674 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:10:55,675 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1863359825, now seen corresponding path program 31 times [2018-09-26 08:10:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,928 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:55,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:10:55,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:10:55,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:10:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:55,930 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2018-09-26 08:10:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,305 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:10:56,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:10:56,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-09-26 08:10:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,306 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:10:56,306 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:10:56,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:10:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-26 08:10:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:10:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:10:56,330 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:10:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,330 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:10:56,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:10:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:10:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:10:56,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,331 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:10:56,332 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash -312623909, now seen corresponding path program 32 times [2018-09-26 08:10:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,620 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:56,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:10:56,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:10:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:10:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:56,623 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-26 08:10:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,089 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:10:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:10:57,089 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-26 08:10:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,090 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:10:57,090 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:10:57,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:10:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:10:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-09-26 08:10:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:10:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:10:57,108 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:10:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,108 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:10:57,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:10:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:10:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:10:57,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,109 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:10:57,109 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash 216080869, now seen corresponding path program 33 times [2018-09-26 08:10:57,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,334 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:57,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:10:57,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:10:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:10:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:57,336 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2018-09-26 08:10:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,715 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:10:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:10:57,715 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-09-26 08:10:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,716 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:10:57,716 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:10:57,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:10:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:10:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-26 08:10:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:10:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:10:57,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:10:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,736 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:10:57,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:10:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:10:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:10:57,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,737 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:10:57,737 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1495231599, now seen corresponding path program 34 times [2018-09-26 08:10:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,971 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:57,972 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:10:57,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:10:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:10:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:57,973 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-26 08:10:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,369 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:10:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:10:58,370 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-26 08:10:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,370 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:10:58,371 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:10:58,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:10:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:10:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-09-26 08:10:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:10:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:10:58,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:10:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,394 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:10:58,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:10:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:10:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:10:58,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,396 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:10:58,396 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1896530823, now seen corresponding path program 35 times [2018-09-26 08:10:58,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,642 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:58,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:10:58,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:10:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:10:58,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:58,644 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2018-09-26 08:10:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,061 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:10:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:10:59,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-09-26 08:10:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,062 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:10:59,062 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:10:59,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:10:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:10:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-26 08:10:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:10:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:10:59,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:10:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,081 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:10:59,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:10:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:10:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:10:59,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,082 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:10:59,083 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1500040701, now seen corresponding path program 36 times [2018-09-26 08:10:59,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,364 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:59,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:10:59,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:10:59,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:10:59,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:59,366 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-26 08:10:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,834 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:10:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:10:59,834 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-26 08:10:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,835 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:10:59,835 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:10:59,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:10:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:10:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-09-26 08:10:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:10:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:10:59,857 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:10:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,858 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:10:59,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:10:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:10:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:10:59,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,859 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:10:59,859 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1569844493, now seen corresponding path program 37 times [2018-09-26 08:10:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,127 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:11:00,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:11:00,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:11:00,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:11:00,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:00,130 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2018-09-26 08:11:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,629 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:11:00,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:11:00,629 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-09-26 08:11:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,630 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:11:00,630 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:11:00,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:11:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-26 08:11:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:11:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:11:00,656 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:11:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,657 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:11:00,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:11:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:11:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:11:00,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,658 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:11:00,658 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1086983575, now seen corresponding path program 38 times [2018-09-26 08:11:00,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,950 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:11:00,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:11:00,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:11:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:11:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:00,952 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-26 08:11:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,428 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:11:01,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:11:01,428 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 08:11:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,429 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:11:01,429 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:11:01,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:11:01,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-09-26 08:11:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:11:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:11:01,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:11:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,454 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:11:01,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:11:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:11:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:11:01,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,455 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:11:01,455 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash 914109345, now seen corresponding path program 39 times [2018-09-26 08:11:01,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,760 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:11:01,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:11:01,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:11:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:11:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:01,763 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-09-26 08:11:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:02,336 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:11:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:11:02,336 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-09-26 08:11:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:02,337 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:11:02,337 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:11:02,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:11:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-26 08:11:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:11:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:11:02,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:11:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:02,389 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:11:02,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:11:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:11:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:11:02,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:02,390 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:11:02,390 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:02,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2009268437, now seen corresponding path program 40 times [2018-09-26 08:11:02,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,685 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:11:02,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:11:02,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:11:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:11:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:02,687 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-26 08:11:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,187 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:11:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:11:03,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-26 08:11:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,188 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:11:03,189 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:11:03,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:11:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-09-26 08:11:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:11:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:11:03,211 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:11:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,211 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:11:03,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:11:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:11:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:11:03,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,212 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:11:03,213 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1828261941, now seen corresponding path program 41 times [2018-09-26 08:11:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,492 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:11:03,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:11:03,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:11:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:11:03,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:03,494 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2018-09-26 08:11:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,952 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:11:03,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:11:03,953 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-09-26 08:11:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,953 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:11:03,954 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:11:03,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:11:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-26 08:11:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:11:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:11:03,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:11:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,978 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:11:03,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:11:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:11:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:11:03,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,979 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:11:03,979 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 318047935, now seen corresponding path program 42 times [2018-09-26 08:11:03,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:04,278 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:11:04,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:04,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:11:04,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:11:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:11:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:04,281 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-26 08:11:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,687 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:11:04,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:11:04,688 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-26 08:11:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,689 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:11:04,689 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:11:04,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:11:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-09-26 08:11:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:11:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:11:04,730 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:11:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,731 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:11:04,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:11:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:11:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:11:04,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,735 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:11:04,735 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 701334217, now seen corresponding path program 43 times [2018-09-26 08:11:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,088 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:11:05,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:11:05,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:11:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:11:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:05,090 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2018-09-26 08:11:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,591 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:11:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:11:05,592 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-09-26 08:11:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,593 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:11:05,593 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:11:05,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:11:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-26 08:11:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:11:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:11:05,616 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:11:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:05,616 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:11:05,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:11:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:11:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:11:05,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:05,617 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:11:05,618 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:05,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:05,618 INFO L82 PathProgramCache]: Analyzing trace with hash -327736237, now seen corresponding path program 44 times [2018-09-26 08:11:05,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,947 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:11:05,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:11:05,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:11:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:11:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:05,949 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-26 08:11:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:06,358 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:11:06,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:11:06,359 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-26 08:11:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:06,360 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:11:06,360 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:11:06,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:11:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-09-26 08:11:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:11:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:11:06,380 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:11:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,381 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:11:06,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:11:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:11:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:11:06,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,382 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:11:06,382 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1421964451, now seen corresponding path program 45 times [2018-09-26 08:11:06,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:06,715 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:11:06,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:06,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:11:06,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:11:06,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:11:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:06,717 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2018-09-26 08:11:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,380 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:11:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:11:07,380 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-09-26 08:11:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,381 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:11:07,382 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:11:07,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:11:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-26 08:11:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:11:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:11:07,422 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:11:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,423 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:11:07,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:11:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:11:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:11:07,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,424 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:11:07,424 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash -708290585, now seen corresponding path program 46 times [2018-09-26 08:11:07,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,832 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:11:07,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:11:07,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:11:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:11:07,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:07,834 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-26 08:11:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,256 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:11:08,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:11:08,256 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 08:11:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,257 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:11:08,257 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:11:08,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:11:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-09-26 08:11:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:11:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:11:08,282 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:11:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,282 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:11:08,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:11:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:11:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:11:08,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,283 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:11:08,283 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2062472719, now seen corresponding path program 47 times [2018-09-26 08:11:08,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,620 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:11:08,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:11:08,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:11:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:11:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:08,622 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2018-09-26 08:11:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:09,050 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:11:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:11:09,050 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-09-26 08:11:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:09,051 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:11:09,051 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:11:09,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:11:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-26 08:11:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:11:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:11:09,073 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:11:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:09,073 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:11:09,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:11:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:11:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:11:09,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:09,074 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:11:09,074 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:09,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2056412805, now seen corresponding path program 48 times [2018-09-26 08:11:09,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:09,416 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:11:09,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:09,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:11:09,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:11:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:11:09,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:09,417 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-26 08:11:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:09,861 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:11:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:11:09,861 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-26 08:11:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:09,862 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:11:09,862 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:11:09,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:11:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-09-26 08:11:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:11:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:11:09,907 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:11:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:09,908 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:11:09,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:11:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:11:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:11:09,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:09,909 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:11:09,909 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:09,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash -527802747, now seen corresponding path program 49 times [2018-09-26 08:11:09,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:10,224 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:11:10,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:10,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:11:10,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:11:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:11:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:10,226 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2018-09-26 08:11:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:10,871 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:11:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:11:10,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-09-26 08:11:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:10,872 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:11:10,872 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:11:10,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:11:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-26 08:11:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:11:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:11:10,895 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:11:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,895 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:11:10,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:11:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:11:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:11:10,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,896 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:11:10,897 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash -412352241, now seen corresponding path program 50 times [2018-09-26 08:11:10,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:11,185 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:11:11,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:11,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:11:11,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:11:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:11:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:11,186 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-26 08:11:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:11,692 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:11:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:11:11,692 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-26 08:11:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:11,693 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:11:11,693 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:11:11,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:11:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-09-26 08:11:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:11:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:11:11,719 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:11:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:11,719 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:11:11,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:11:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:11:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:11:11,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:11,720 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:11:11,720 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:11,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1133565671, now seen corresponding path program 51 times [2018-09-26 08:11:11,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:12,013 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:11:12,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:12,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:11:12,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:11:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:11:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:12,015 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2018-09-26 08:11:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:12,653 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:11:12,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:11:12,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-09-26 08:11:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:12,654 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:11:12,654 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:11:12,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:11:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-26 08:11:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:11:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:11:12,682 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:11:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:12,683 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:11:12,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:11:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:11:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:11:12,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:12,684 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:11:12,684 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:12,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1565030051, now seen corresponding path program 52 times [2018-09-26 08:11:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:12,992 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:11:12,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:12,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:11:12,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:11:12,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:11:12,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:12,994 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-26 08:11:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:13,526 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:11:13,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:11:13,526 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-26 08:11:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:13,527 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:11:13,527 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:11:13,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:11:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-09-26 08:11:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:11:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:11:13,560 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:11:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:13,560 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:11:13,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:11:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:11:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:11:13,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:13,561 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:11:13,561 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:13,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash 755272109, now seen corresponding path program 53 times [2018-09-26 08:11:13,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:13,882 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:11:13,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:13,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:11:13,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:11:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:11:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:13,885 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2018-09-26 08:11:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:14,444 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:11:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:11:14,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-09-26 08:11:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:14,445 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:11:14,445 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:11:14,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:11:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-26 08:11:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:11:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:11:14,470 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:11:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:14,471 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:11:14,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:11:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:11:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:11:14,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:14,472 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:11:14,472 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:14,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -33029577, now seen corresponding path program 54 times [2018-09-26 08:11:14,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:14,829 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:11:14,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:14,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:11:14,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:11:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:11:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:14,831 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-26 08:11:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:15,402 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:11:15,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:11:15,402 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-26 08:11:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:15,403 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:11:15,403 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:11:15,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:11:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-09-26 08:11:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:11:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:11:15,433 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:11:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:15,433 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:11:15,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:11:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:11:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:11:15,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:15,434 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:11:15,434 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:15,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1676705727, now seen corresponding path program 55 times [2018-09-26 08:11:15,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,765 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:11:15,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:11:15,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:11:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:11:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:15,766 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2018-09-26 08:11:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:16,383 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:11:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:11:16,383 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-09-26 08:11:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:16,384 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:11:16,384 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:11:16,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:11:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-26 08:11:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:11:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:11:16,410 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:11:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:16,411 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:11:16,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:11:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:11:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:11:16,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:16,411 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:11:16,411 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:16,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash -701520949, now seen corresponding path program 56 times [2018-09-26 08:11:16,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:16,801 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:11:16,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:16,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:11:16,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:11:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:11:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:16,804 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-26 08:11:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:17,501 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:11:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:11:17,502 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-26 08:11:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:17,503 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:11:17,503 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:11:17,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:11:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-09-26 08:11:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:11:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:11:17,533 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:11:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:17,533 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:11:17,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:11:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:11:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:11:17,534 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:17,534 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:11:17,534 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:17,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash 148180181, now seen corresponding path program 57 times [2018-09-26 08:11:17,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:17,911 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:17,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:17,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:11:17,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:11:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:11:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:17,913 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2018-09-26 08:11:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:18,535 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:11:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:11:18,535 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-09-26 08:11:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:18,536 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:11:18,536 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:11:18,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:11:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-26 08:11:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:11:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:11:18,564 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:11:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:18,564 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:11:18,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:11:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:11:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:11:18,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:18,565 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:11:18,565 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:18,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 667179871, now seen corresponding path program 58 times [2018-09-26 08:11:18,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:18,956 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:18,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:18,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:11:18,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:11:18,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:11:18,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:18,957 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-26 08:11:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:19,529 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:11:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:11:19,529 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-26 08:11:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:19,531 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:11:19,531 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:11:19,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:11:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-09-26 08:11:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:11:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:11:19,567 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:11:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:19,568 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:11:19,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:11:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:11:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:11:19,568 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:19,569 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:11:19,569 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:19,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:19,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1209675625, now seen corresponding path program 59 times [2018-09-26 08:11:19,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,004 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:20,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:11:20,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:11:20,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:11:20,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:20,006 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2018-09-26 08:11:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:20,716 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:11:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:11:20,716 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-09-26 08:11:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:20,717 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:11:20,717 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:11:20,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:11:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-26 08:11:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:11:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:11:20,755 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:11:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:20,755 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:11:20,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:11:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:11:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:11:20,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:20,757 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:11:20,757 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:20,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1437914893, now seen corresponding path program 60 times [2018-09-26 08:11:20,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:21,162 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:21,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:21,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:11:21,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:11:21,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:11:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:21,164 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-26 08:11:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:21,860 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:11:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:11:21,860 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-26 08:11:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:21,861 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:11:21,861 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:11:21,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:11:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-09-26 08:11:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:11:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:11:21,900 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:11:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:21,901 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:11:21,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:11:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:11:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:11:21,902 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:21,902 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:11:21,902 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:21,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1143203837, now seen corresponding path program 61 times [2018-09-26 08:11:21,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:22,485 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:22,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:22,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:11:22,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:11:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:11:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:22,486 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2018-09-26 08:11:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:23,238 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:11:23,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:11:23,238 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-09-26 08:11:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:23,239 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:11:23,239 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:11:23,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:11:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-26 08:11:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:11:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:11:23,287 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:11:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:23,287 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:11:23,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:11:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:11:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:11:23,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:23,288 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:11:23,288 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:23,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:23,289 INFO L82 PathProgramCache]: Analyzing trace with hash -892793721, now seen corresponding path program 62 times [2018-09-26 08:11:23,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:23,750 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:23,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:23,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:11:23,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:11:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:11:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:23,752 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-26 08:11:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:24,507 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:11:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:11:24,508 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-26 08:11:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:24,509 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:11:24,509 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:11:24,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:11:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-09-26 08:11:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:11:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:11:24,545 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:11:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:24,545 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:11:24,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:11:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:11:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:11:24,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:24,546 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:11:24,546 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:24,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:24,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1018640017, now seen corresponding path program 63 times [2018-09-26 08:11:24,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,021 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:25,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:11:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:11:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:11:25,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:25,023 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2018-09-26 08:11:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,812 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:11:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:11:25,812 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-09-26 08:11:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,813 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:11:25,813 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:11:25,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:11:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-26 08:11:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:11:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:11:25,849 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:11:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,849 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:11:25,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:11:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:11:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:11:25,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,850 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:11:25,851 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash -339540453, now seen corresponding path program 64 times [2018-09-26 08:11:25,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,315 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:26,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:11:26,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:11:26,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:11:26,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:26,317 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-26 08:11:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,176 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:11:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:11:27,177 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-26 08:11:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,178 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:11:27,178 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:11:27,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:11:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-09-26 08:11:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:11:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:11:27,228 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:11:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,228 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:11:27,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:11:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:11:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:11:27,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,230 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:11:27,230 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash 119085861, now seen corresponding path program 65 times [2018-09-26 08:11:27,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,934 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:27,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:11:27,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:11:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:11:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:27,935 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2018-09-26 08:11:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,982 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:11:28,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:11:28,982 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-09-26 08:11:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,983 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:11:28,983 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:11:28,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:11:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-26 08:11:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:11:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:11:29,022 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:11:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,023 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:11:29,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:11:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:11:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:11:29,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,024 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:11:29,024 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1522657873, now seen corresponding path program 66 times [2018-09-26 08:11:29,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,558 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:29,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:11:29,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:11:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:11:29,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:29,560 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-26 08:11:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,337 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:11:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:11:30,337 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-26 08:11:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,338 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:11:30,338 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:11:30,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:11:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-09-26 08:11:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:11:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:11:30,385 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:11:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,385 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:11:30,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:11:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:11:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:11:30,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,386 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:11:30,387 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1309578681, now seen corresponding path program 67 times [2018-09-26 08:11:30,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,963 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:30,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:11:30,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:11:30,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:11:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:30,965 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2018-09-26 08:11:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,856 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:11:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:11:31,856 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-09-26 08:11:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,857 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:11:31,857 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:11:31,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:11:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-26 08:11:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:11:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:11:31,899 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:11:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,900 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:11:31,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:11:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:11:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:11:31,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,901 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:11:31,901 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash 79641411, now seen corresponding path program 68 times [2018-09-26 08:11:31,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,454 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:32,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:11:32,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:11:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:11:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:11:32,455 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-26 08:11:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,348 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:11:33,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:11:33,349 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-26 08:11:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,350 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:11:33,350 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:11:33,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:11:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:11:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-09-26 08:11:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:11:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:11:33,398 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:11:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,398 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:11:33,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:11:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:11:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:11:33,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,399 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:11:33,400 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash -774068659, now seen corresponding path program 69 times [2018-09-26 08:11:33,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,993 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:33,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:11:33,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:11:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:11:33,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:11:33,995 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2018-09-26 08:11:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,908 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:11:34,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:11:34,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-09-26 08:11:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,909 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:11:34,909 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:11:34,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:11:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:11:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-26 08:11:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:11:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:11:34,947 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:11:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,948 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:11:34,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:11:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:11:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:11:34,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,949 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:11:34,949 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,949 INFO L82 PathProgramCache]: Analyzing trace with hash -850692393, now seen corresponding path program 70 times [2018-09-26 08:11:34,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,652 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:35,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:11:35,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:11:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:11:35,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:11:35,653 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-26 08:11:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,638 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:11:36,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:11:36,638 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-26 08:11:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,639 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:11:36,639 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:11:36,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:11:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:11:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-09-26 08:11:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:11:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:11:36,679 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:11:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,679 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:11:36,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:11:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:11:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:11:36,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,680 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:11:36,680 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1471656735, now seen corresponding path program 71 times [2018-09-26 08:11:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,297 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:37,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:11:37,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:11:37,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:11:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:11:37,298 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2018-09-26 08:11:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,357 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:11:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:11:38,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-09-26 08:11:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,359 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:11:38,359 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:11:38,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:11:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:11:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-26 08:11:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:11:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:11:38,407 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:11:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,407 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:11:38,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:11:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:11:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:11:38,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,409 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:11:38,409 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1217935253, now seen corresponding path program 72 times [2018-09-26 08:11:38,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:39,325 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:39,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:39,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:11:39,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:11:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:11:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:11:39,327 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-26 08:11:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,363 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:11:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:11:40,364 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-26 08:11:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,364 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:11:40,365 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:11:40,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:11:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:11:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-09-26 08:11:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:11:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:11:40,419 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:11:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,419 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:11:40,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:11:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:11:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:11:40,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,420 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:11:40,420 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2090240373, now seen corresponding path program 73 times [2018-09-26 08:11:40,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,070 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:41,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:11:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:11:41,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:11:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:11:41,072 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2018-09-26 08:11:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:42,112 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:11:42,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:11:42,112 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-09-26 08:11:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:42,113 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:11:42,113 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:11:42,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:11:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:11:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-26 08:11:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:11:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:11:42,156 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:11:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:42,156 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:11:42,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:11:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:11:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:11:42,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:42,157 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:11:42,157 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:42,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1323749377, now seen corresponding path program 74 times [2018-09-26 08:11:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,938 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:42,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:11:42,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:11:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:11:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:11:42,939 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-26 08:11:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:44,015 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:11:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:11:44,015 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-26 08:11:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:44,016 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:11:44,016 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:11:44,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:11:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:11:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-09-26 08:11:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:11:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:11:44,060 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:11:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,060 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:11:44,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:11:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:11:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:11:44,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,062 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:11:44,062 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -812884983, now seen corresponding path program 75 times [2018-09-26 08:11:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,754 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:44,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:11:44,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:11:44,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:11:44,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:11:44,755 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2018-09-26 08:11:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,750 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:11:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:11:45,750 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-09-26 08:11:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,751 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:11:45,751 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:11:45,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:11:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:11:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-26 08:11:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:11:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:11:45,795 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:11:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,796 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:11:45,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:11:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:11:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:11:45,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,796 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:11:45,797 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 501525907, now seen corresponding path program 76 times [2018-09-26 08:11:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,521 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:46,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:11:46,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:11:46,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:11:46,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:11:46,522 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-26 08:11:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,609 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:11:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:11:47,609 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-26 08:11:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,610 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:11:47,610 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:11:47,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:11:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:11:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-09-26 08:11:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:11:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:11:47,654 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:11:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,654 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:11:47,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:11:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:11:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:11:47,655 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,655 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:11:47,656 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash 930006173, now seen corresponding path program 77 times [2018-09-26 08:11:47,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,384 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:48,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:11:48,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:11:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:11:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:11:48,386 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2018-09-26 08:11:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,593 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:11:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:11:49,594 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2018-09-26 08:11:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,594 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:11:49,594 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:11:49,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:11:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:11:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 08:11:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:11:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:11:49,643 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:11:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,643 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:11:49,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:11:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:11:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:11:49,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,644 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:11:49,644 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 382681383, now seen corresponding path program 78 times [2018-09-26 08:11:49,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,414 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:50,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:11:50,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:11:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:11:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:11:50,416 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-26 08:11:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,412 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:11:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:11:51,412 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-26 08:11:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,413 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:11:51,413 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:11:51,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:11:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:11:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-09-26 08:11:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:11:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:11:51,476 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-09-26 08:11:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,476 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:11:51,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:11:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:11:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:11:51,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,477 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-09-26 08:11:51,477 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1610431695, now seen corresponding path program 79 times [2018-09-26 08:11:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,225 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:52,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:11:52,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:11:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:11:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:11:52,227 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2018-09-26 08:11:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,597 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:11:53,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:11:53,597 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2018-09-26 08:11:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,599 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:11:53,599 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:11:53,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:11:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:11:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-26 08:11:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:11:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:11:53,672 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-09-26 08:11:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,673 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:11:53,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:11:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:11:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:11:53,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,674 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-09-26 08:11:53,674 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1436685637, now seen corresponding path program 80 times [2018-09-26 08:11:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,518 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:54,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:11:54,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:11:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:11:54,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:11:54,519 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-26 08:11:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,934 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:11:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:11:55,935 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-26 08:11:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,935 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:11:55,935 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:11:55,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:11:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:11:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-09-26 08:11:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:11:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:11:55,985 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-09-26 08:11:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,985 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:11:55,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:11:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:11:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:11:55,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,986 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-09-26 08:11:55,986 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1970448443, now seen corresponding path program 81 times [2018-09-26 08:11:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,805 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:56,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:11:56,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:11:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:11:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:11:56,806 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2018-09-26 08:11:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:58,110 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:11:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:11:58,110 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2018-09-26 08:11:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:58,111 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:11:58,111 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:11:58,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:11:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:11:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-26 08:11:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:11:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:11:58,172 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-09-26 08:11:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,172 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:11:58,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:11:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:11:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:11:58,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,173 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-09-26 08:11:58,174 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 479570511, now seen corresponding path program 82 times [2018-09-26 08:11:58,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,026 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:59,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:11:59,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:11:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:11:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:11:59,028 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-26 08:12:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:00,349 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:12:00,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:12:00,350 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-26 08:12:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:00,350 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:12:00,351 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:12:00,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:12:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:12:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-09-26 08:12:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:12:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:12:00,411 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-09-26 08:12:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,411 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:12:00,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:12:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:12:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:12:00,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,412 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-09-26 08:12:00,413 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1305707097, now seen corresponding path program 83 times [2018-09-26 08:12:00,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:01,340 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:12:01,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:01,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:12:01,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:12:01,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:12:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:01,342 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2018-09-26 08:12:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:02,617 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:12:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:12:02,617 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2018-09-26 08:12:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:02,618 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:12:02,618 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:12:02,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:12:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 08:12:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:12:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:12:02,681 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-09-26 08:12:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,681 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:12:02,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:12:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:12:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:12:02,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,682 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-09-26 08:12:02,682 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash 654016483, now seen corresponding path program 84 times [2018-09-26 08:12:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:03,561 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:12:03,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:03,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:12:03,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:12:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:12:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:03,563 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-26 08:12:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:04,923 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:12:04,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:12:04,923 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-26 08:12:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:04,924 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:12:04,924 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:12:04,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:12:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-09-26 08:12:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:12:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:12:04,979 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-09-26 08:12:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:04,979 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:12:04,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:12:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:12:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:12:04,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:04,981 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-09-26 08:12:04,981 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:04,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1444561645, now seen corresponding path program 85 times [2018-09-26 08:12:04,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,859 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:12:05,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:12:05,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:12:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:12:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:05,861 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2018-09-26 08:12:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:07,036 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:12:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:12:07,036 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2018-09-26 08:12:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:07,037 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:12:07,037 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:12:07,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:12:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-26 08:12:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:12:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:12:07,092 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-09-26 08:12:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:07,093 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:12:07,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:12:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:12:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:12:07,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:07,094 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-09-26 08:12:07,094 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:07,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash 949250935, now seen corresponding path program 86 times [2018-09-26 08:12:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:08,014 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:12:08,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:08,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:12:08,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:12:08,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:12:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:08,016 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-26 08:12:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:09,474 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:12:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:12:09,474 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-26 08:12:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:09,475 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:12:09,475 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:12:09,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:12:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-09-26 08:12:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:12:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:12:09,543 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-09-26 08:12:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:09,543 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:12:09,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:12:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:12:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:12:09,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:09,544 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-09-26 08:12:09,545 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:09,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1697028481, now seen corresponding path program 87 times [2018-09-26 08:12:09,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:10,420 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:12:10,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:10,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:12:10,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:12:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:12:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:10,421 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 91 states. [2018-09-26 08:12:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,870 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:12:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:12:11,870 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2018-09-26 08:12:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,871 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:12:11,871 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:12:11,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:12:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-26 08:12:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:12:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:12:11,944 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-09-26 08:12:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,944 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:12:11,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:12:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:12:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:12:11,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,946 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-09-26 08:12:11,946 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1243255541, now seen corresponding path program 88 times [2018-09-26 08:12:11,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:12,883 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:12:12,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:12,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:12:12,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:12:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:12:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:12,884 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-26 08:12:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:14,376 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:12:14,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:12:14,376 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-26 08:12:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:14,377 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:12:14,377 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:12:14,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:12:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-09-26 08:12:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:12:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:12:14,433 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-09-26 08:12:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:14,433 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:12:14,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:12:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:12:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:12:14,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:14,434 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-09-26 08:12:14,435 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:14,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash -767719915, now seen corresponding path program 89 times [2018-09-26 08:12:14,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:15,440 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:15,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:15,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:12:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:12:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:12:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:12:15,442 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 93 states. [2018-09-26 08:12:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:16,942 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:12:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:12:16,942 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2018-09-26 08:12:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:16,943 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:12:16,943 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:12:16,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:12:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:12:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-26 08:12:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:12:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:12:17,003 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-09-26 08:12:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:17,003 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:12:17,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:12:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:12:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:12:17,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:17,004 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-09-26 08:12:17,004 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:17,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash 955483295, now seen corresponding path program 90 times [2018-09-26 08:12:17,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:18,002 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:18,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:18,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:12:18,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:12:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:12:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:12:18,004 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-26 08:12:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:19,451 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:12:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:12:19,451 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-26 08:12:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:19,452 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:12:19,452 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:12:19,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:12:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:12:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-09-26 08:12:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:12:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:12:19,511 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-09-26 08:12:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:19,512 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:12:19,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:12:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:12:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:12:19,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:19,513 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-09-26 08:12:19,513 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:19,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -903608151, now seen corresponding path program 91 times [2018-09-26 08:12:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:20,533 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:20,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:20,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:12:20,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:12:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:12:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:12:20,534 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 95 states. [2018-09-26 08:12:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:22,107 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:12:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:12:22,108 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2018-09-26 08:12:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:22,109 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:12:22,109 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:12:22,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:12:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:12:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-26 08:12:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:12:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:12:22,171 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-09-26 08:12:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:22,171 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:12:22,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:12:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:12:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:12:22,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:22,172 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-09-26 08:12:22,172 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:22,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash -784092621, now seen corresponding path program 92 times [2018-09-26 08:12:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:23,234 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:23,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:23,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:12:23,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:12:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:12:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:12:23,236 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-26 08:12:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:24,931 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:12:24,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:12:24,931 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-26 08:12:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:24,932 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:12:24,932 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:12:24,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:12:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:12:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-09-26 08:12:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:12:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:12:24,997 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-09-26 08:12:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:24,997 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:12:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:12:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:12:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:12:24,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:24,998 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-09-26 08:12:24,998 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:24,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1893785283, now seen corresponding path program 93 times [2018-09-26 08:12:24,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:26,126 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:26,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:26,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:12:26,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:12:26,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:12:26,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:12:26,128 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 97 states. [2018-09-26 08:12:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:27,792 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:12:27,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:12:27,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2018-09-26 08:12:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:27,793 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:12:27,793 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:12:27,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:12:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:12:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-26 08:12:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:12:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:12:27,860 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-09-26 08:12:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:27,860 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:12:27,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:12:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:12:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:12:27,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:27,861 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-09-26 08:12:27,862 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:27,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1138423239, now seen corresponding path program 94 times [2018-09-26 08:12:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:29,022 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:29,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:29,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:12:29,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:12:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:12:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:12:29,023 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-26 08:12:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:30,474 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:12:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:12:30,474 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-26 08:12:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:30,475 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:12:30,475 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:12:30,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:12:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:12:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-09-26 08:12:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:12:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:12:30,546 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-09-26 08:12:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:30,546 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:12:30,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:12:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:12:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:12:30,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:30,547 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-09-26 08:12:30,547 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:30,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1191981103, now seen corresponding path program 95 times [2018-09-26 08:12:30,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:31,662 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:31,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:31,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:12:31,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:12:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:12:31,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:12:31,664 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 99 states. [2018-09-26 08:12:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:33,344 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:12:33,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:12:33,344 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2018-09-26 08:12:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:33,345 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:12:33,345 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:12:33,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:12:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:12:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-26 08:12:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:12:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:12:33,413 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-09-26 08:12:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:33,413 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:12:33,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:12:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:12:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:12:33,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:33,414 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-09-26 08:12:33,414 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:33,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1262374747, now seen corresponding path program 96 times [2018-09-26 08:12:33,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:34,599 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:34,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:34,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:12:34,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:12:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:12:34,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:12:34,601 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-26 08:12:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:36,341 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:12:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:12:36,341 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-26 08:12:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:36,342 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:12:36,342 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:12:36,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:12:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:12:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-09-26 08:12:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:12:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:12:36,411 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-09-26 08:12:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:36,411 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:12:36,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:12:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:12:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:12:36,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:36,412 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-09-26 08:12:36,412 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:36,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1961301093, now seen corresponding path program 97 times [2018-09-26 08:12:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:37,568 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:37,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:37,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:12:37,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:12:37,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:12:37,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:12:37,570 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 101 states. [2018-09-26 08:12:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:39,310 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:12:39,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:12:39,310 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2018-09-26 08:12:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:39,311 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:12:39,311 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:12:39,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:12:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:12:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-26 08:12:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:12:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:12:39,381 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-09-26 08:12:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,381 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:12:39,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:12:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:12:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:12:39,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:39,382 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-09-26 08:12:39,382 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:39,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -680345873, now seen corresponding path program 98 times [2018-09-26 08:12:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:40,601 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:40,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:40,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:12:40,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:12:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:12:40,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:12:40,603 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-26 08:12:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:42,315 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:12:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:12:42,315 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-26 08:12:42,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:42,316 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:12:42,316 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:12:42,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:12:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:12:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-09-26 08:12:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:12:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:12:42,414 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-09-26 08:12:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:42,414 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:12:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:12:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:12:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:12:42,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:42,416 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-09-26 08:12:42,416 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:42,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash -977408263, now seen corresponding path program 99 times [2018-09-26 08:12:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:43,889 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:43,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:43,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:12:43,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:12:43,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:12:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:12:43,892 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 103 states. [2018-09-26 08:12:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:45,641 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-09-26 08:12:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:12:45,641 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2018-09-26 08:12:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:45,642 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:12:45,642 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:12:45,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:12:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:12:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-26 08:12:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:12:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:12:45,715 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-09-26 08:12:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:45,715 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:12:45,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:12:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:12:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:12:45,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:45,716 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-09-26 08:12:45,716 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:45,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1308443779, now seen corresponding path program 100 times [2018-09-26 08:12:45,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:46,883 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:46,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:46,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:12:46,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:12:46,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:12:46,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:12:46,885 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-26 08:12:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:48,722 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:12:48,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:12:48,723 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-26 08:12:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:48,724 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:12:48,724 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:12:48,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:12:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:12:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-09-26 08:12:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:12:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:12:48,794 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-09-26 08:12:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:48,795 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:12:48,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:12:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:12:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:12:48,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:48,796 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-09-26 08:12:48,796 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:48,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1010999411, now seen corresponding path program 101 times [2018-09-26 08:12:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:50,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:50,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:12:50,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:12:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:12:50,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:12:50,014 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 105 states. [2018-09-26 08:12:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:51,907 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:12:51,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:12:51,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2018-09-26 08:12:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:51,908 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:12:51,908 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:12:51,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:12:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:12:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-26 08:12:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:12:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:12:51,979 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-09-26 08:12:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:51,979 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:12:51,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:12:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:12:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:12:51,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:51,980 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-09-26 08:12:51,980 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:51,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -907878377, now seen corresponding path program 102 times [2018-09-26 08:12:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:53,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:53,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:12:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:12:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:12:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:12:53,268 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-26 08:12:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:55,197 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-09-26 08:12:55,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:12:55,197 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-26 08:12:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:55,198 INFO L225 Difference]: With dead ends: 214 [2018-09-26 08:12:55,198 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:12:55,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:12:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:12:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-09-26 08:12:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:12:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:12:55,288 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-09-26 08:12:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:55,288 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:12:55,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:12:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:12:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:12:55,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:55,289 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-09-26 08:12:55,290 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:55,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash -592812511, now seen corresponding path program 103 times [2018-09-26 08:12:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:56,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:56,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:12:56,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:12:56,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:12:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:12:56,678 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 107 states. [2018-09-26 08:12:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:58,621 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:12:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:12:58,621 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2018-09-26 08:12:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:58,622 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:12:58,622 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:12:58,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:12:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:12:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-26 08:12:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:12:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 08:12:58,710 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-09-26 08:12:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:58,710 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 08:12:58,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:12:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 08:12:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:12:58,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:58,712 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-09-26 08:12:58,712 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:58,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1537773995, now seen corresponding path program 104 times [2018-09-26 08:12:58,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:00,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:00,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:13:00,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:13:00,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:13:00,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:13:00,143 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-26 08:13:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:02,233 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:13:02,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:13:02,233 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-26 08:13:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:02,234 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:13:02,234 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:13:02,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:13:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:13:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-09-26 08:13:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:13:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:13:02,313 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-09-26 08:13:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:02,313 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:13:02,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:13:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:13:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:13:02,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:02,314 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-09-26 08:13:02,314 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:02,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash 332006069, now seen corresponding path program 105 times [2018-09-26 08:13:02,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:03,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:03,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:13:03,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:13:03,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:13:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:13:03,799 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 109 states. [2018-09-26 08:13:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:05,504 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:13:05,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:13:05,504 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2018-09-26 08:13:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:05,505 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:13:05,505 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:13:05,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:13:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:13:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-26 08:13:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:13:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 08:13:05,587 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-09-26 08:13:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:05,588 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 08:13:05,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:13:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 08:13:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:13:05,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:05,589 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-09-26 08:13:05,589 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:05,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1230199103, now seen corresponding path program 106 times [2018-09-26 08:13:05,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:07,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:07,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:13:07,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:13:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:13:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:13:07,045 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-26 08:13:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:09,184 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:13:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:13:09,185 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-26 08:13:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:09,185 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:13:09,185 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:13:09,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:13:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:13:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-09-26 08:13:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:13:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-09-26 08:13:09,274 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-09-26 08:13:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:09,274 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-09-26 08:13:09,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:13:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-09-26 08:13:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:13:09,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:09,275 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-09-26 08:13:09,275 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:09,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1105278281, now seen corresponding path program 107 times [2018-09-26 08:13:09,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:10,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:10,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:13:10,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:13:10,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:13:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:13:10,766 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 111 states. [2018-09-26 08:13:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:12,899 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:13:12,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:13:12,899 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2018-09-26 08:13:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:12,900 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:13:12,900 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:13:12,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:13:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:13:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-26 08:13:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:13:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:13:12,992 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-09-26 08:13:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:12,992 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:13:12,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:13:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:13:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:13:12,993 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:12,993 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-09-26 08:13:12,994 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:12,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:12,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1315452627, now seen corresponding path program 108 times [2018-09-26 08:13:12,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:14,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:14,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:13:14,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:13:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:13:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:13:14,456 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-26 08:13:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:16,633 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 08:13:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:13:16,633 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-26 08:13:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:16,633 INFO L225 Difference]: With dead ends: 226 [2018-09-26 08:13:16,633 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:13:16,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:13:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:13:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-09-26 08:13:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:13:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-09-26 08:13:16,718 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-09-26 08:13:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:16,719 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-09-26 08:13:16,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:13:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-09-26 08:13:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:13:16,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:16,719 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-09-26 08:13:16,720 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:16,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1429536221, now seen corresponding path program 109 times [2018-09-26 08:13:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:18,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:18,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:13:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:13:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:13:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:13:18,287 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 113 states. [2018-09-26 08:13:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:20,492 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:13:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:13:20,493 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2018-09-26 08:13:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:20,493 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:13:20,494 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:13:20,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:13:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:13:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-26 08:13:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:13:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 08:13:20,586 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-09-26 08:13:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:20,586 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 08:13:20,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:13:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 08:13:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:13:20,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:20,587 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-09-26 08:13:20,587 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:20,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash -605279641, now seen corresponding path program 110 times [2018-09-26 08:13:20,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:22,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:22,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:13:22,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:13:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:13:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:13:22,235 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-26 08:13:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:24,440 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:13:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:13:24,441 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-26 08:13:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:24,441 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:13:24,441 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:13:24,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:13:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:13:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2018-09-26 08:13:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:13:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:13:24,529 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-09-26 08:13:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:24,530 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:13:24,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:13:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:13:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:13:24,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:24,530 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-09-26 08:13:24,531 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:24,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1853203343, now seen corresponding path program 111 times [2018-09-26 08:13:24,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:26,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:26,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:13:26,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:13:26,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:13:26,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:13:26,140 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 115 states. [2018-09-26 08:13:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:28,313 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-09-26 08:13:28,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:13:28,313 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2018-09-26 08:13:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:28,313 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:13:28,314 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:13:28,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:13:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:13:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-26 08:13:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:13:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 08:13:28,430 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-09-26 08:13:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:28,430 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 08:13:28,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:13:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 08:13:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:13:28,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:28,431 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-09-26 08:13:28,431 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:28,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1482961915, now seen corresponding path program 112 times [2018-09-26 08:13:28,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:29,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:29,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:13:29,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:13:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:13:29,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:13:29,977 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-26 08:13:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:32,221 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:13:32,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:13:32,221 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-26 08:13:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:32,222 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:13:32,222 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:13:32,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:13:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:13:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-09-26 08:13:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:13:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:13:32,313 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-09-26 08:13:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:13:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:13:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:13:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:13:32,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:32,314 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-09-26 08:13:32,315 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:32,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -802795259, now seen corresponding path program 113 times [2018-09-26 08:13:32,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:34,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:34,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:13:34,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:13:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:13:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:13:34,028 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 117 states. [2018-09-26 08:13:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:36,393 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:13:36,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:13:36,393 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2018-09-26 08:13:36,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:36,394 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:13:36,394 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:13:36,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:13:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:13:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-26 08:13:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:13:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:13:36,493 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-09-26 08:13:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:36,493 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:13:36,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:13:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:13:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:13:36,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:36,494 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-09-26 08:13:36,494 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:36,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1607816079, now seen corresponding path program 114 times [2018-09-26 08:13:36,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:38,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:38,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:13:38,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:13:38,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:13:38,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:13:38,229 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-26 08:13:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:40,607 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-09-26 08:13:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:13:40,608 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-26 08:13:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:40,608 INFO L225 Difference]: With dead ends: 238 [2018-09-26 08:13:40,608 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:13:40,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:13:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:13:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-09-26 08:13:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:13:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-09-26 08:13:40,704 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-09-26 08:13:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:40,704 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-09-26 08:13:40,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:13:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-09-26 08:13:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:13:40,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:40,705 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-09-26 08:13:40,706 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:40,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1077027943, now seen corresponding path program 115 times [2018-09-26 08:13:40,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:42,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:42,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:13:42,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:13:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:13:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:13:42,532 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 119 states. [2018-09-26 08:13:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:44,967 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 08:13:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:13:44,967 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 234 [2018-09-26 08:13:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:44,968 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:13:44,968 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:13:44,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:13:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:13:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-26 08:13:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:13:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 08:13:45,081 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-09-26 08:13:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:45,081 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 08:13:45,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:13:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 08:13:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:13:45,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:45,082 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-09-26 08:13:45,082 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:45,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 63211811, now seen corresponding path program 116 times [2018-09-26 08:13:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:46,886 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:46,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:13:46,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:13:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:13:46,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:13:46,888 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-26 08:13:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:49,418 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-09-26 08:13:49,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:13:49,418 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-26 08:13:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:49,419 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:13:49,419 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 08:13:49,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:13:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 08:13:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-09-26 08:13:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:13:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:13:49,507 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-09-26 08:13:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:49,507 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:13:49,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:13:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:13:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:13:49,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:49,508 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-09-26 08:13:49,508 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:49,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash 616954925, now seen corresponding path program 117 times [2018-09-26 08:13:49,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:51,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:51,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:13:51,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:13:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:13:51,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:13:51,278 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 121 states. [2018-09-26 08:13:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:53,755 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-09-26 08:13:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:13:53,755 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 238 [2018-09-26 08:13:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:53,756 INFO L225 Difference]: With dead ends: 244 [2018-09-26 08:13:53,756 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:13:53,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:13:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:13:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-26 08:13:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:13:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 08:13:53,857 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-09-26 08:13:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:53,858 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 08:13:53,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:13:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 08:13:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:13:53,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:53,859 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-09-26 08:13:53,859 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:53,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 188142775, now seen corresponding path program 118 times [2018-09-26 08:13:53,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:55,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:55,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:13:55,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:13:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:13:55,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:13:55,806 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-26 08:13:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:58,259 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-26 08:13:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:13:58,260 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-26 08:13:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:58,260 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:13:58,260 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:13:58,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:13:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:13:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-09-26 08:13:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:13:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-09-26 08:13:58,364 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-09-26 08:13:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:58,364 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-09-26 08:13:58,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:13:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-09-26 08:13:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:13:58,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:58,365 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-09-26 08:13:58,365 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:58,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash 416527041, now seen corresponding path program 119 times [2018-09-26 08:13:58,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:00,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:00,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:14:00,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:14:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:14:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:14:00,349 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 123 states. [2018-09-26 08:14:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:02,821 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-09-26 08:14:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:14:02,821 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 242 [2018-09-26 08:14:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:02,822 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:14:02,822 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 08:14:02,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:14:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 08:14:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-26 08:14:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:14:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:14:02,927 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-09-26 08:14:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:02,927 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:14:02,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:14:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:14:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:14:02,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:02,928 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-09-26 08:14:02,929 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:02,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:02,929 INFO L82 PathProgramCache]: Analyzing trace with hash 850474571, now seen corresponding path program 120 times [2018-09-26 08:14:02,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:04,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:04,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:14:04,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:14:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:14:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:14:04,948 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-26 08:14:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:07,568 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-26 08:14:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:14:07,568 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-26 08:14:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:07,569 INFO L225 Difference]: With dead ends: 250 [2018-09-26 08:14:07,569 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 08:14:07,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:14:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 08:14:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-09-26 08:14:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:14:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-26 08:14:07,666 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-09-26 08:14:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:07,666 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-26 08:14:07,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:14:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-26 08:14:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:14:07,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:07,667 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-09-26 08:14:07,667 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:07,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1262223189, now seen corresponding path program 121 times [2018-09-26 08:14:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:09,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:09,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:14:09,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:14:09,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:14:09,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:14:09,620 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 125 states. [2018-09-26 08:14:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:12,134 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-09-26 08:14:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:14:12,134 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 246 [2018-09-26 08:14:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:12,135 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:14:12,135 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 08:14:12,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:14:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 08:14:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-26 08:14:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:14:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-26 08:14:12,241 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-09-26 08:14:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:12,242 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-26 08:14:12,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:14:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-26 08:14:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:14:12,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:12,242 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-09-26 08:14:12,243 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:12,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1815653855, now seen corresponding path program 122 times [2018-09-26 08:14:12,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:14,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:14,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:14:14,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:14:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:14:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:14:14,341 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-26 08:14:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:16,821 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-09-26 08:14:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:14:16,821 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-26 08:14:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:16,822 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:14:16,822 INFO L226 Difference]: Without dead ends: 252 [2018-09-26 08:14:16,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:14:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-09-26 08:14:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-09-26 08:14:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:14:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:14:16,931 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-09-26 08:14:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:16,932 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:14:16,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:14:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:14:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:14:16,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:16,933 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-09-26 08:14:16,933 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:16,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1086579177, now seen corresponding path program 123 times [2018-09-26 08:14:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:19,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:19,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:14:19,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:14:19,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:14:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:14:19,085 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 127 states. [2018-09-26 08:14:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:21,708 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-09-26 08:14:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:14:21,708 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 250 [2018-09-26 08:14:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:21,709 INFO L225 Difference]: With dead ends: 256 [2018-09-26 08:14:21,709 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:14:21,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:14:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:14:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-26 08:14:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:14:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-26 08:14:21,820 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-09-26 08:14:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:21,820 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-26 08:14:21,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:14:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-26 08:14:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:14:21,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:21,821 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-09-26 08:14:21,821 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:21,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash 525482867, now seen corresponding path program 124 times [2018-09-26 08:14:21,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:24,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:24,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:14:24,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:14:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:14:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:14:24,061 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-26 08:14:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:26,595 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-09-26 08:14:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:14:26,595 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-26 08:14:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:26,596 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:14:26,596 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:14:26,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:14:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:14:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2018-09-26 08:14:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:14:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-09-26 08:14:26,699 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-09-26 08:14:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:26,699 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-09-26 08:14:26,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:14:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-09-26 08:14:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:14:26,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:26,700 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-09-26 08:14:26,700 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:26,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1817159043, now seen corresponding path program 125 times [2018-09-26 08:14:26,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:28,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:28,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:14:28,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:14:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:14:28,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:14:28,816 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 129 states. [2018-09-26 08:14:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:31,536 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-26 08:14:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:14:31,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 254 [2018-09-26 08:14:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:31,536 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:14:31,536 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 08:14:31,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:14:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 08:14:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-26 08:14:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:14:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 08:14:31,651 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-09-26 08:14:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:31,652 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 08:14:31,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:14:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 08:14:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:14:31,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:31,653 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-09-26 08:14:31,653 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:31,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1761795847, now seen corresponding path program 126 times [2018-09-26 08:14:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:34,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:34,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:14:34,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:14:34,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:14:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:14:34,031 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-26 08:14:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:36,841 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-09-26 08:14:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:14:36,841 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-26 08:14:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:36,842 INFO L225 Difference]: With dead ends: 262 [2018-09-26 08:14:36,842 INFO L226 Difference]: Without dead ends: 260 [2018-09-26 08:14:36,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:14:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-26 08:14:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-09-26 08:14:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:14:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-09-26 08:14:36,959 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-09-26 08:14:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:36,959 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-09-26 08:14:36,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:14:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-09-26 08:14:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:14:36,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:36,960 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-09-26 08:14:36,961 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:36,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 868641041, now seen corresponding path program 127 times [2018-09-26 08:14:36,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:39,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:39,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:14:39,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:14:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:14:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:14:39,271 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 131 states. [2018-09-26 08:14:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:42,029 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-09-26 08:14:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:14:42,030 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 258 [2018-09-26 08:14:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:42,030 INFO L225 Difference]: With dead ends: 264 [2018-09-26 08:14:42,031 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 08:14:42,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:14:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 08:14:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-26 08:14:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:14:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 08:14:42,147 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-09-26 08:14:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:42,148 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 08:14:42,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:14:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 08:14:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:14:42,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:42,149 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-09-26 08:14:42,149 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:42,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1540331675, now seen corresponding path program 128 times [2018-09-26 08:14:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:44,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:44,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:14:44,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:14:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:14:44,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:14:44,532 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-26 08:14:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:47,573 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-09-26 08:14:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:14:47,573 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-26 08:14:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:47,574 INFO L225 Difference]: With dead ends: 266 [2018-09-26 08:14:47,574 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 08:14:47,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:14:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 08:14:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2018-09-26 08:14:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:14:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-09-26 08:14:47,693 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-09-26 08:14:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:47,693 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-09-26 08:14:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:14:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-09-26 08:14:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:14:47,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:47,694 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-09-26 08:14:47,695 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:47,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1505030747, now seen corresponding path program 129 times [2018-09-26 08:14:47,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:50,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:50,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:14:50,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:14:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:14:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:14:50,123 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 133 states. [2018-09-26 08:14:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:53,006 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-09-26 08:14:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:14:53,006 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 262 [2018-09-26 08:14:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:53,006 INFO L225 Difference]: With dead ends: 268 [2018-09-26 08:14:53,007 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 08:14:53,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:14:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 08:14:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-26 08:14:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:14:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-26 08:14:53,127 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-09-26 08:14:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:53,127 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-26 08:14:53,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:14:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-26 08:14:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:14:53,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:53,128 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-09-26 08:14:53,128 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:53,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1069377583, now seen corresponding path program 130 times [2018-09-26 08:14:53,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:55,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:55,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:14:55,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:14:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:14:55,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:14:55,565 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-26 08:14:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:58,444 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-26 08:14:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:14:58,444 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-26 08:14:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:58,445 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:14:58,445 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 08:14:58,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:14:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 08:14:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-09-26 08:14:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:14:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-09-26 08:14:58,568 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-09-26 08:14:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:58,568 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-09-26 08:14:58,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:14:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-09-26 08:14:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:14:58,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:58,569 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-09-26 08:14:58,569 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:58,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1174620217, now seen corresponding path program 131 times [2018-09-26 08:14:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:01,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:01,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:15:01,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:15:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:15:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:15:01,176 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 135 states. [2018-09-26 08:15:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:04,398 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-09-26 08:15:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:15:04,399 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 266 [2018-09-26 08:15:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:04,399 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:15:04,399 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 08:15:04,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:15:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 08:15:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-26 08:15:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:15:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 08:15:04,525 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-09-26 08:15:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:04,526 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 08:15:04,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:15:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 08:15:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:15:04,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:04,526 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-09-26 08:15:04,527 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:04,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash -766423613, now seen corresponding path program 132 times [2018-09-26 08:15:04,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-09-26 08:15:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:05,087 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:262) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:204) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-26 08:15:05,091 INFO L168 Benchmark]: Toolchain (without parser) took 260867.02 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.1 GB in the end (delta: -708.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-26 08:15:05,093 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:15:05,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:15:05,093 INFO L168 Benchmark]: Boogie Preprocessor took 19.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:15:05,094 INFO L168 Benchmark]: RCFGBuilder took 308.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:15:05,094 INFO L168 Benchmark]: TraceAbstraction took 260493.01 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.1 GB in the end (delta: -719.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-26 08:15:05,097 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 308.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 260493.01 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.1 GB in the end (delta: -719.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-15-05-117.csv Completed graceful shutdown