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/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:57,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:57,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:57,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:57,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:57,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:57,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:57,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:57,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:57,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:57,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:57,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:57,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:57,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:57,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:57,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:57,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:57,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:57,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:57,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:57,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:57,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:57,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:57,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:57,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:57,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:57,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:57,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:57,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:57,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:57,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:57,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:57,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:57,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:57,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:57,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:57,309 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:19:57,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:57,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:57,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:57,328 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:57,328 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:57,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:57,328 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:57,329 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:57,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:57,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:57,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:57,401 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:57,402 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:57,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl [2018-09-26 08:19:57,403 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl' [2018-09-26 08:19:57,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:57,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:57,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:57,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:57,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:57,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:57,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:57,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:57,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:57,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:57,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:57,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:57,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:57,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/1) ... [2018-09-26 08:19:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:57,792 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:57,796 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:57 BoogieIcfgContainer [2018-09-26 08:19:57,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:57,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:57,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:57,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:57,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:57" (1/2) ... [2018-09-26 08:19:57,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da40b08 and model type string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:57, skipping insertion in model container [2018-09-26 08:19:57,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:57" (2/2) ... [2018-09-26 08:19:57,808 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i_3.bpl [2018-09-26 08:19:57,820 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:57,829 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:57,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:57,886 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:57,886 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:57,886 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:57,886 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:57,886 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:57,887 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:57,887 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:57,887 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:19:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:19:57,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:57,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:19:57,919 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:57,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-09-26 08:19:57,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,006 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:19:58,008 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:58,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:58,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:58,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:58,028 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:19:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,053 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-09-26 08:19:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:58,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:19:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,066 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:19:58,067 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:19:58,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:19:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:19:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:19:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:19:58,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:19:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,114 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:19:58,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:19:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:19:58,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,116 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:19:58,116 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-09-26 08:19:58,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,149 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:19:58,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:19:58,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:58,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:58,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:58,153 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-26 08:19:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,176 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:19:58,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:58,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:19:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,181 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:19:58,181 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:19:58,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:19:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:19:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:19:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:19:58,187 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:19:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,188 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:19:58,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:19:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:19:58,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,189 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:19:58,189 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-09-26 08:19:58,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,230 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:19:58,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:58,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:58,232 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-09-26 08:19:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,252 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:19:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:58,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:19:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,253 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:19:58,253 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:19:58,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:19:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:19:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:19:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:19:58,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:19:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,259 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:19:58,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:19:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:58,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,260 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:19:58,261 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-09-26 08:19:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,334 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:19:58,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:58,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:58,339 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-09-26 08:19:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,371 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:19:58,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:58,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:19:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,372 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:19:58,373 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:19:58,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:19:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:19:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:19:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:19:58,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:19:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,378 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:19:58,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:19:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:19:58,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,380 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:19:58,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-09-26 08:19:58,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,458 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:19:58,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:58,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:19:58,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:19:58,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:58,460 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-09-26 08:19:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,478 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:19:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:19:58,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:19:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,480 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:19:58,480 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:19:58,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:19:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:19:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:19:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:19:58,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:19:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,486 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:19:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:19:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:19:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:19:58,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,487 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:19:58,490 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-09-26 08:19:58,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,539 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:19:58,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:19:58,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:19:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:19:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:19:58,541 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-09-26 08:19:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,574 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:19:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:19:58,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:19:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,576 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:19:58,576 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:19:58,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:19:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:19:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:19:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:19:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:19:58,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:19:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,583 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:19:58,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:19:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:19:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:19:58,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,584 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:19:58,584 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-09-26 08:19:58,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,656 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:19:58,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:19:58,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:19:58,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:19:58,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:19:58,661 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-09-26 08:19:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,704 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:19:58,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:19:58,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:19:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,709 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:19:58,709 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:19:58,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:19:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:19:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:19:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:19:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:19:58,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:19:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,721 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:19:58,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:19:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:19:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:19:58,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,723 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:19:58,723 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-09-26 08:19:58,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,813 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:19:58,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:19:58,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:19:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:19:58,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:19:58,815 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-09-26 08:19:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,841 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:19:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:19:58,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:19:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,843 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:19:58,843 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:19:58,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:19:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:19:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:19:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:19:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:19:58,849 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:19:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,849 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:19:58,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:19:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:19:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:19:58,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,851 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:19:58,851 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-09-26 08:19:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,917 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:19:58,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:19:58,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:19:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:19:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:19:58,919 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-09-26 08:19:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,938 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:19:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:19:58,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:19:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,940 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:19:58,940 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:19:58,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:19:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:19:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:19:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:19:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:19:58,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:19:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,946 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:19:58,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:19:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:19:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:19:58,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,948 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:19:58,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-09-26 08:19:58,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,000 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:19:59,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:19:59,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:19:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:19:59,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:19:59,002 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-09-26 08:19:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,025 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:19:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:19:59,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-26 08:19:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,027 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:19:59,027 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:19:59,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:19:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:19:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:19:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:19:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:19:59,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:19:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,039 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:19:59,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:19:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:19:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:19:59,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,040 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:19:59,041 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-09-26 08:19:59,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,119 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:19:59,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:19:59,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:19:59,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:19:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:19:59,121 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-09-26 08:19:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,141 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:19:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:19:59,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-26 08:19:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,143 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:19:59,143 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:19:59,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:19:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:19:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:19:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:19:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:19:59,150 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:19:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,150 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:19:59,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:19:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:19:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:19:59,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,152 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:19:59,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-09-26 08:19:59,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,209 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:19:59,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:19:59,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:19:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:19:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:19:59,212 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-26 08:19:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,230 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:19:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:19:59,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 08:19:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,232 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:19:59,232 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:19:59,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:19:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:19:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:19:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:19:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:19:59,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:19:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,239 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:19:59,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:19:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:19:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:19:59,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,240 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:19:59,240 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-09-26 08:19:59,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,299 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:19:59,299 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:19:59,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:19:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:19:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:19:59,301 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-09-26 08:19:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,322 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:19:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:19:59,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-09-26 08:19:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,324 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:19:59,324 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:19:59,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:19:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:19:59,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:19:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:19:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:19:59,331 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:19:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,331 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:19:59,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:19:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:19:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:19:59,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,333 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:19:59,333 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-09-26 08:19:59,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,395 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:19:59,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:19:59,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:19:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:19:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:19:59,397 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-26 08:19:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,424 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:19:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:19:59,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 08:19:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,426 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:19:59,426 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:19:59,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:19:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:19:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:19:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:19:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:19:59,438 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:19:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,439 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:19:59,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:19:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:19:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:19:59,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,442 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:19:59,443 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-09-26 08:19:59,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,522 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:19:59,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:19:59,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:19:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:19:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:19:59,525 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-09-26 08:19:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,550 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:19:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:19:59,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-09-26 08:19:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,551 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:19:59,551 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:19:59,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:19:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:19:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:19:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:19:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:19:59,557 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:19:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,558 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:19:59,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:19:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:19:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:19:59,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,559 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:19:59,560 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-09-26 08:19:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,624 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:19:59,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:19:59,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:19:59,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:19:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:19:59,627 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-09-26 08:19:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,655 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:19:59,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:19:59,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-26 08:19:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,658 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:19:59,658 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:19:59,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:19:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:19:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:19:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:19:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:19:59,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:19:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,670 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:19:59,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:19:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:19:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:19:59,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,672 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:19:59,672 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-09-26 08:19:59,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,747 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:19:59,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:19:59,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:19:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:19:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:19:59,749 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-09-26 08:19:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,777 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:19:59,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:19:59,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-09-26 08:19:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,778 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:19:59,778 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:19:59,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:19:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:19:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:19:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:19:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:19:59,792 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:19:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,793 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:19:59,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:19:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:19:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:19:59,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,799 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:19:59,799 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-09-26 08:19:59,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,903 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:19:59,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:19:59,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:19:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:19:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:19:59,905 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-09-26 08:19:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,927 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:19:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:19:59,929 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-09-26 08:19:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,930 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:19:59,930 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:19:59,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:19:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:19:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:19:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:19:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:19:59,940 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:19:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,941 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:19:59,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:19:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:19:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:19:59,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,942 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:19:59,942 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-09-26 08:19:59,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,062 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:20:00,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:20:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:20:00,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:20:00,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:20:00,064 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-09-26 08:20:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,092 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:20:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:20:00,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-09-26 08:20:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,094 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:20:00,094 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:20:00,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:20:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:20:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:20:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:20:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:20:00,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:20:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,101 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:20:00,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:20:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:20:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:20:00,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,102 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:20:00,102 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-09-26 08:20:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,200 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:20:00,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:20:00,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:20:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:20:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:00,202 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-09-26 08:20:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,236 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:20:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:20:00,237 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-09-26 08:20:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,237 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:20:00,238 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:20:00,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:20:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:20:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:20:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:20:00,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:20:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,252 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:20:00,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:20:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:20:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:20:00,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,263 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:20:00,263 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,264 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-09-26 08:20:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,358 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:20:00,359 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:20:00,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:20:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:20:00,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:20:00,363 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-09-26 08:20:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,391 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:20:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:20:00,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-09-26 08:20:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,392 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:20:00,392 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:20:00,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:20:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:20:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:20:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:20:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:20:00,401 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:20:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,402 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:20:00,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:20:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:20:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:20:00,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,411 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:20:00,411 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-09-26 08:20:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,561 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:20:00,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:20:00,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:20:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:20:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:20:00,565 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-09-26 08:20:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,597 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:20:00,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:20:00,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-09-26 08:20:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,598 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:20:00,598 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:20:00,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:20:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:20:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:20:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:20:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:20:00,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:20:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,610 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:20:00,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:20:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:20:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:20:00,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,611 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:20:00,611 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-09-26 08:20:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,731 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:20:00,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:20:00,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:20:00,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:20:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:20:00,734 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-09-26 08:20:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,759 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:20:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:20:00,760 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-09-26 08:20:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,761 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:20:00,761 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:20:00,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:20:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:20:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:20:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:20:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:20:00,779 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:20:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,779 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:20:00,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:20:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:20:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:20:00,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,780 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:20:00,784 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-09-26 08:20:00,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,910 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:20:00,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:20:00,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:20:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:20:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:00,913 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-09-26 08:20:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,936 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:20:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:20:00,937 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-09-26 08:20:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,938 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:20:00,938 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:20:00,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:20:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:20:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:20:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:20:00,944 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:20:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,944 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:20:00,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:20:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:20:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:20:00,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,946 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:20:00,946 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-09-26 08:20:00,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,081 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:20:01,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:20:01,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:20:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:20:01,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:20:01,083 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-09-26 08:20:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,109 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:20:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:20:01,110 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-09-26 08:20:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,111 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:20:01,111 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:20:01,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:20:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:20:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:20:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:20:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:20:01,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:20:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,126 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:20:01,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:20:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:20:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:20:01,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,127 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:20:01,127 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-09-26 08:20:01,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,278 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:20:01,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:20:01,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:20:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:20:01,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:01,280 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-09-26 08:20:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,308 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:20:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:20:01,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-09-26 08:20:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,309 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:20:01,310 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:20:01,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:20:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:20:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:20:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:20:01,314 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:20:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,315 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:20:01,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:20:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:20:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:20:01,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,316 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:20:01,316 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-09-26 08:20:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,468 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:20:01,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:20:01,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:20:01,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:20:01,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:01,471 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-09-26 08:20:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,495 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:20:01,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:20:01,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-09-26 08:20:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,496 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:20:01,496 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:20:01,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:20:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:20:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:20:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:20:01,501 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:20:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,501 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:20:01,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:20:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:20:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:20:01,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,502 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:20:01,503 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-09-26 08:20:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,651 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:20:01,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:20:01,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:20:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:20:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:01,654 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-09-26 08:20:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,683 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:20:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:20:01,683 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-09-26 08:20:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,684 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:20:01,684 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:20:01,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:20:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:20:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:20:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:20:01,689 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:20:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,689 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:20:01,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:20:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:20:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:20:01,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,690 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:20:01,690 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-09-26 08:20:01,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,909 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:20:01,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:20:01,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:20:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:20:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:20:01,912 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-09-26 08:20:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,930 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:20:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:20:01,931 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-09-26 08:20:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,931 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:20:01,932 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:20:01,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:20:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:20:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:20:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:20:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:20:01,936 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:20:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,936 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:20:01,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:20:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:20:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:20:01,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,937 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:20:01,937 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-09-26 08:20:01,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,081 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:20:02,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:20:02,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:20:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:20:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:02,083 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-09-26 08:20:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,110 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:20:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:20:02,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-26 08:20:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,111 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:20:02,112 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:20:02,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:20:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:20:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:20:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:20:02,116 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:20:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,116 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:20:02,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:20:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:20:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:20:02,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,117 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:20:02,117 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-09-26 08:20:02,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,260 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:20:02,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:20:02,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:20:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:20:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:20:02,263 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-09-26 08:20:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,284 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:20:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:20:02,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-09-26 08:20:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,285 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:20:02,285 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:20:02,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:20:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:20:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:20:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:20:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:20:02,289 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:20:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,289 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:20:02,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:20:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:20:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:20:02,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,290 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:20:02,290 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-09-26 08:20:02,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,446 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:20:02,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:20:02,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:20:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:20:02,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:02,448 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-09-26 08:20:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,468 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:20:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:20:02,468 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-09-26 08:20:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,469 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:20:02,469 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:20:02,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:20:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:20:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:20:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:20:02,473 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:20:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,473 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:20:02,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:20:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:20:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:20:02,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,474 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:20:02,475 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-09-26 08:20:02,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,631 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:20:02,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:20:02,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:20:02,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:20:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:02,633 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-09-26 08:20:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,661 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:20:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:20:02,661 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-09-26 08:20:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,662 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:20:02,662 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:20:02,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:20:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:20:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:20:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:20:02,666 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:20:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,667 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:20:02,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:20:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:20:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:20:02,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,668 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:20:02,668 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-09-26 08:20:02,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,824 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:20:02,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:20:02,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:20:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:20:02,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:02,826 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-09-26 08:20:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,846 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:20:02,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:20:02,847 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-09-26 08:20:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,847 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:20:02,847 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:20:02,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:20:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:20:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:20:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:20:02,852 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:20:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,852 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:20:02,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:20:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:20:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:20:02,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,853 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:20:02,853 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-09-26 08:20:02,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,020 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:20:03,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:20:03,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:20:03,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:20:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:20:03,022 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-09-26 08:20:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:03,047 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:20:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:20:03,047 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-09-26 08:20:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:03,048 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:20:03,048 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:20:03,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:20:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:20:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:20:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:20:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:20:03,053 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:20:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,053 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:20:03,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:20:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:20:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:20:03,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,054 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:20:03,055 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-09-26 08:20:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,252 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:20:03,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:20:03,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:20:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:20:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:03,254 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-09-26 08:20:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:03,286 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:20:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:20:03,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-09-26 08:20:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:03,287 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:20:03,288 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:20:03,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:20:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:20:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:20:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:20:03,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:20:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,292 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:20:03,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:20:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:20:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:20:03,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,293 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:20:03,294 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-09-26 08:20:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,471 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:20:03,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:20:03,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:20:03,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:20:03,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:20:03,473 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-09-26 08:20:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:03,497 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:20:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:20:03,497 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-09-26 08:20:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:03,498 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:20:03,498 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:20:03,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:20:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:20:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:20:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:20:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:20:03,503 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:20:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,504 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:20:03,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:20:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:20:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:20:03,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,505 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:20:03,505 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-09-26 08:20:03,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,697 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:20:03,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:20:03,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:20:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:20:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:03,699 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-09-26 08:20:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:03,742 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:20:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:20:03,742 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-09-26 08:20:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:03,743 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:20:03,743 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:20:03,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:20:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:20:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:20:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:20:03,751 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:20:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,751 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:20:03,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:20:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:20:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:20:03,752 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,753 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:20:03,753 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-09-26 08:20:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,967 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:20:03,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:20:03,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:20:03,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:20:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:03,970 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-09-26 08:20:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,004 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:20:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:20:04,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-09-26 08:20:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,006 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:20:04,006 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:20:04,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:20:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:20:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:20:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:20:04,012 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:20:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:04,012 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:20:04,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:20:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:20:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:20:04,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,014 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:20:04,014 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-09-26 08:20:04,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:04,239 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:20:04,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:04,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:20:04,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:20:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:20:04,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:04,242 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-09-26 08:20:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,275 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:20:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:20:04,275 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-09-26 08:20:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,276 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:20:04,276 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:20:04,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:20:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:20:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:20:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:20:04,282 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:20:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:04,282 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:20:04,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:20:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:20:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:20:04,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,283 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:20:04,284 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-09-26 08:20:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:04,539 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:20:04,539 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:04,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:20:04,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:20:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:20:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:20:04,541 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-09-26 08:20:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,571 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:20:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:20:04,571 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-09-26 08:20:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,572 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:20:04,572 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:20:04,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:20:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:20:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:20:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:20:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:20:04,577 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:20:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:04,578 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:20:04,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:20:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:20:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:20:04,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,579 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:20:04,579 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-09-26 08:20:04,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:04,768 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:20:04,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:04,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:20:04,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:20:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:20:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:04,771 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-09-26 08:20:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,810 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:20:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:20:04,810 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-09-26 08:20:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,811 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:20:04,811 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:20:04,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:20:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:20:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:20:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:20:04,816 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:20:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:04,817 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:20:04,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:20:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:20:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:20:04,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,818 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:20:04,818 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-09-26 08:20:04,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,009 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:20:05,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:20:05,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:20:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:20:05,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:20:05,011 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-09-26 08:20:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,051 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:20:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:20:05,052 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-09-26 08:20:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,052 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:20:05,053 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:20:05,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:20:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:20:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:20:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:20:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:20:05,058 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:20:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,058 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:20:05,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:20:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:20:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:20:05,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,060 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:20:05,060 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-09-26 08:20:05,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,265 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:20:05,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:20:05,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:20:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:20:05,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:05,268 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-09-26 08:20:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,302 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:20:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:20:05,303 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-09-26 08:20:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,303 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:20:05,304 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:20:05,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:20:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:20:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:20:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:20:05,309 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:20:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,309 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:20:05,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:20:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:20:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:20:05,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,310 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:20:05,311 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-09-26 08:20:05,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,532 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:20:05,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:20:05,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:20:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:20:05,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:05,534 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-09-26 08:20:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,575 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:20:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:20:05,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-09-26 08:20:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,577 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:20:05,577 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:20:05,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:20:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:20:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:20:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:20:05,582 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:20:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,582 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:20:05,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:20:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:20:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:20:05,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,584 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:20:05,584 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-09-26 08:20:05,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,804 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:20:05,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:20:05,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:20:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:20:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:05,806 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-09-26 08:20:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,855 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:20:05,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:20:05,855 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-09-26 08:20:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,856 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:20:05,857 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:20:05,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:20:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:20:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:20:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:20:05,862 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:20:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,862 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:20:05,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:20:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:20:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:20:05,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,864 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:20:05,864 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-09-26 08:20:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:06,101 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:20:06,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:06,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:20:06,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:20:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:20:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:20:06,104 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-09-26 08:20:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:06,146 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:20:06,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:20:06,147 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-09-26 08:20:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:06,148 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:20:06,148 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:20:06,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:20:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:20:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:20:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:20:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:20:06,153 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:20:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:06,153 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:20:06,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:20:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:20:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:20:06,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:06,154 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:20:06,155 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:06,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-09-26 08:20:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:06,389 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:20:06,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:06,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:20:06,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:20:06,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:20:06,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:06,392 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-09-26 08:20:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:06,446 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:20:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:20:06,446 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-09-26 08:20:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:06,447 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:20:06,447 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:20:06,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:20:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:20:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:20:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:20:06,454 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:20:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:06,455 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:20:06,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:20:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:20:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:20:06,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:06,456 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:20:06,457 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:06,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-09-26 08:20:06,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:06,723 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:20:06,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:06,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:20:06,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:20:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:20:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:20:06,726 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-09-26 08:20:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:06,780 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:20:06,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:20:06,780 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-09-26 08:20:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:06,781 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:20:06,782 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:20:06,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:20:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:20:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:20:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:20:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:20:06,789 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:20:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:06,790 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:20:06,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:20:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:20:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:20:06,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:06,793 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:20:06,793 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:06,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-09-26 08:20:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,094 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:20:07,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:20:07,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:20:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:20:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:07,097 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-09-26 08:20:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,150 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:20:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:20:07,151 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-09-26 08:20:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,152 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:20:07,152 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:20:07,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:20:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:20:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:20:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:20:07,156 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:20:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,157 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:20:07,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:20:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:20:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:20:07,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,158 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:20:07,159 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-09-26 08:20:07,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,357 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:20:07,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:20:07,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:20:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:20:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:07,359 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-09-26 08:20:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,399 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:20:07,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:20:07,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-09-26 08:20:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,400 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:20:07,401 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:20:07,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:20:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:20:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:20:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:20:07,406 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:20:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,406 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:20:07,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:20:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:20:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:20:07,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,407 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:20:07,407 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-09-26 08:20:07,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,626 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:20:07,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:20:07,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:20:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:20:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:07,629 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-09-26 08:20:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,665 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:20:07,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:20:07,666 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-09-26 08:20:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,667 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:20:07,667 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:20:07,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:20:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:20:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:20:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:20:07,672 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:20:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,673 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:20:07,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:20:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:20:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:20:07,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,674 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:20:07,674 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-09-26 08:20:07,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,899 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:20:07,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:20:07,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:20:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:20:07,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:20:07,901 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-09-26 08:20:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,957 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:20:07,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:20:07,958 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-09-26 08:20:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,959 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:20:07,959 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:20:07,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:20:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:20:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:20:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:20:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:20:07,964 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:20:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,964 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:20:07,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:20:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:20:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:20:07,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,966 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:20:07,966 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-09-26 08:20:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:08,194 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:20:08,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:08,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:20:08,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:20:08,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:20:08,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:08,197 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-09-26 08:20:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:08,251 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:20:08,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:20:08,251 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-09-26 08:20:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:08,252 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:20:08,253 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:20:08,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:20:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:20:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:20:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:20:08,257 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:20:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:08,258 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:20:08,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:20:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:20:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:20:08,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:08,259 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:20:08,259 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:08,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-09-26 08:20:08,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:08,484 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:20:08,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:08,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:20:08,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:20:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:20:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:20:08,487 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-09-26 08:20:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:08,548 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:20:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:20:08,549 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-09-26 08:20:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:08,550 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:20:08,550 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:20:08,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:20:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:20:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:20:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:20:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:20:08,555 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:20:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:08,555 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:20:08,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:20:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:20:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:20:08,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:08,557 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:20:08,557 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:08,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-09-26 08:20:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:08,828 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:20:08,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:08,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:20:08,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:20:08,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:20:08,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:08,834 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-09-26 08:20:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:08,902 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:20:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:20:08,902 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-09-26 08:20:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:08,903 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:20:08,903 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:20:08,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:20:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:20:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:20:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:20:08,909 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:20:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:08,909 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:20:08,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:20:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:20:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:20:08,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:08,911 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:20:08,911 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:08,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-09-26 08:20:08,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:09,181 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:20:09,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:09,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:20:09,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:20:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:20:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:09,187 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-09-26 08:20:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:09,231 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:20:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:20:09,232 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-09-26 08:20:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:09,233 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:20:09,233 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:20:09,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:20:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:20:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:20:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:20:09,239 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:20:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:09,239 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:20:09,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:20:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:20:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:20:09,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:09,241 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:20:09,241 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:09,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-09-26 08:20:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:09,585 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:20:09,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:09,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:20:09,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:20:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:20:09,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:20:09,588 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-09-26 08:20:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:09,656 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:20:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:20:09,656 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-09-26 08:20:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:09,657 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:20:09,657 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:20:09,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:20:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:20:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:20:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:20:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:20:09,664 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:20:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:09,665 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:20:09,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:20:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:20:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:20:09,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:09,667 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:20:09,667 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:09,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:09,667 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-09-26 08:20:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:10,050 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:20:10,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:10,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:20:10,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:20:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:20:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:20:10,052 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-09-26 08:20:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:10,119 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:20:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:20:10,119 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-09-26 08:20:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:10,120 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:20:10,120 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:20:10,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:20:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:20:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:20:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:20:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:20:10,126 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:20:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:10,127 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:20:10,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:20:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:20:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:20:10,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:10,128 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:20:10,128 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:10,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-09-26 08:20:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:10,393 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:20:10,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:10,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:20:10,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:20:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:20:10,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:10,396 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-09-26 08:20:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:10,458 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:20:10,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:20:10,458 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-09-26 08:20:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:10,459 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:20:10,459 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:20:10,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:20:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:20:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:20:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:20:10,466 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:20:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:10,467 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:20:10,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:20:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:20:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:20:10,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:10,468 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:20:10,468 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:10,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:10,469 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-09-26 08:20:10,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:10,749 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:20:10,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:10,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:20:10,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:20:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:20:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:20:10,752 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-09-26 08:20:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:10,817 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:20:10,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:20:10,817 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-09-26 08:20:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:10,818 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:20:10,819 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:20:10,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:20:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:20:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:20:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:20:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:20:10,825 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:20:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:10,825 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:20:10,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:20:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:20:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:20:10,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:10,827 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:20:10,827 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:10,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-09-26 08:20:10,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:11,118 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:20:11,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:11,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:20:11,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:20:11,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:20:11,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:20:11,122 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-09-26 08:20:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:11,215 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:20:11,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:20:11,215 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-09-26 08:20:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:11,217 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:20:11,217 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:20:11,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:20:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:20:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:20:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:20:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:20:11,224 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:20:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:11,224 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:20:11,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:20:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:20:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:20:11,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:11,226 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:20:11,226 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:11,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-09-26 08:20:11,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:11,514 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:20:11,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:11,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:20:11,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:20:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:20:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:11,517 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-09-26 08:20:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:11,600 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:20:11,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:20:11,600 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-09-26 08:20:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:11,601 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:20:11,601 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:20:11,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:20:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:20:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:20:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:20:11,607 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:20:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:11,608 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:20:11,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:20:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:20:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:20:11,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:11,609 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:20:11,610 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:11,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-09-26 08:20:11,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:11,882 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:20:11,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:11,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:20:11,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:20:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:20:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:11,885 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-09-26 08:20:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:11,936 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:20:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:20:11,937 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-09-26 08:20:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:11,938 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:20:11,938 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:20:11,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:20:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:20:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:20:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:20:11,948 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:20:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:11,949 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:20:11,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:20:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:20:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:20:11,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:11,951 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:20:11,951 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:11,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-09-26 08:20:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:12,217 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:20:12,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:12,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:20:12,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:20:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:20:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:20:12,219 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-09-26 08:20:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:12,294 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:20:12,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:20:12,294 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-09-26 08:20:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:12,296 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:20:12,296 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:20:12,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:20:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:20:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:20:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:20:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:20:12,301 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:20:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:20:12,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:20:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:20:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:20:12,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:12,303 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:20:12,303 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:12,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-09-26 08:20:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:12,604 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:20:12,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:12,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:20:12,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:20:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:20:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:12,607 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-09-26 08:20:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:12,705 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:20:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:20:12,706 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-09-26 08:20:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:12,707 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:20:12,707 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:20:12,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:20:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:20:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:20:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:20:12,713 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:20:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:12,713 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:20:12,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:20:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:20:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:20:12,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:12,715 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:20:12,715 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:12,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-09-26 08:20:12,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:12,987 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:20:12,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:12,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:20:12,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:20:12,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:20:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:20:12,990 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-09-26 08:20:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:13,074 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:20:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:20:13,074 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-09-26 08:20:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:13,075 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:20:13,075 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:20:13,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:20:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:20:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:20:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:20:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:20:13,081 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:20:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:13,081 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:20:13,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:20:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:20:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:20:13,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:13,083 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:20:13,083 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:13,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:13,083 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-09-26 08:20:13,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:13,343 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:20:13,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:13,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:20:13,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:20:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:20:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:13,345 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-09-26 08:20:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:13,419 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:20:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:20:13,419 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-09-26 08:20:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:13,420 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:20:13,420 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:20:13,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:20:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:20:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:20:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:20:13,426 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:20:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:13,426 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:20:13,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:20:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:20:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:20:13,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:13,428 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:20:13,428 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:13,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:13,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-09-26 08:20:13,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:13,691 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:20:13,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:13,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:20:13,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:20:13,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:20:13,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:13,694 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-09-26 08:20:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:13,771 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:20:13,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:20:13,772 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-09-26 08:20:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:13,773 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:20:13,773 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:20:13,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:20:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:20:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:20:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:20:13,779 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:20:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:13,779 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:20:13,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:20:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:20:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:20:13,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:13,781 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:20:13,781 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:13,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-09-26 08:20:13,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:14,049 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:20:14,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:14,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:20:14,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:20:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:20:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:20:14,052 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-09-26 08:20:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:14,153 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:20:14,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:20:14,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-09-26 08:20:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:14,155 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:20:14,155 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:20:14,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:20:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:20:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:20:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:20:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:20:14,170 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:20:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:14,170 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:20:14,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:20:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:20:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:20:14,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:14,172 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:20:14,172 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:14,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-09-26 08:20:14,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:14,482 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:20:14,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:14,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:20:14,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:20:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:20:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:20:14,484 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-09-26 08:20:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:14,603 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:20:14,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:20:14,603 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-09-26 08:20:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:14,604 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:20:14,604 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:20:14,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:20:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:20:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:20:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:20:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:20:14,610 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:20:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:14,611 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:20:14,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:20:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:20:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:20:14,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:14,613 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:20:14,613 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:14,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:14,613 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-09-26 08:20:14,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:15,015 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:20:15,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:15,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:20:15,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:20:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:20:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:15,018 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-09-26 08:20:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:15,143 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:20:15,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:20:15,143 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-09-26 08:20:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:15,145 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:20:15,145 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:20:15,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:20:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:20:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:20:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:20:15,152 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:20:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:20:15,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:20:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:20:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:20:15,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:15,155 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:20:15,155 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:15,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-09-26 08:20:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:15,560 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:20:15,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:15,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:20:15,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:20:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:20:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:20:15,563 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-09-26 08:20:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:15,642 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:20:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:20:15,642 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-09-26 08:20:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:15,644 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:20:15,644 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:20:15,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:20:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:20:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:20:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:20:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:20:15,650 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:20:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:15,650 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:20:15,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:20:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:20:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:20:15,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:15,652 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:20:15,652 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:15,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:15,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-09-26 08:20:15,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:15,929 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:20:15,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:15,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:20:15,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:20:15,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:20:15,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:20:15,931 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-09-26 08:20:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:16,022 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:20:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:20:16,023 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-09-26 08:20:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:16,024 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:20:16,024 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:20:16,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:20:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:20:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:20:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:20:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:20:16,030 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:20:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:16,030 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:20:16,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:20:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:20:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:20:16,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:16,031 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:20:16,031 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:16,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-09-26 08:20:16,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:16,329 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:20:16,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:16,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:20:16,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:20:16,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:20:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:20:16,331 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-09-26 08:20:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:16,458 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:20:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:20:16,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-09-26 08:20:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:16,460 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:20:16,460 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:20:16,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:20:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:20:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:20:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:20:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:20:16,465 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:20:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:16,466 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:20:16,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:20:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:20:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:20:16,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:16,467 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:20:16,467 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:16,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:16,467 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-09-26 08:20:16,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:16,770 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:20:16,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:16,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:20:16,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:20:16,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:20:16,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:20:16,773 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-09-26 08:20:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:16,841 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:20:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:20:16,841 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-09-26 08:20:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:16,842 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:20:16,842 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:20:16,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:20:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:20:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:20:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:20:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:20:16,849 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:20:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:16,849 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:20:16,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:20:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:20:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:20:16,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:16,850 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:20:16,851 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:16,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-09-26 08:20:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:17,165 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:20:17,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:17,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:20:17,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:20:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:20:17,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:20:17,168 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-09-26 08:20:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:17,296 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:20:17,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:20:17,296 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-09-26 08:20:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:17,298 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:20:17,298 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:20:17,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:20:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:20:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:20:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:20:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:20:17,304 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:20:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:17,304 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:20:17,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:20:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:20:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:20:17,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:17,305 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:20:17,306 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:17,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-09-26 08:20:17,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:17,610 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:20:17,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:17,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:20:17,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:20:17,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:20:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:17,612 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-09-26 08:20:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:17,717 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:20:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:20:17,717 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-09-26 08:20:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:17,718 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:20:17,719 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:20:17,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:20:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:20:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:20:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:20:17,725 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:20:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:17,726 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:20:17,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:20:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:20:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:20:17,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:17,727 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:20:17,727 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:17,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-09-26 08:20:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,085 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:20:18,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:20:18,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:20:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:20:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:20:18,087 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-09-26 08:20:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,154 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:20:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:20:18,154 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-09-26 08:20:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,156 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:20:18,156 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:20:18,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:20:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:20:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:20:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:20:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:20:18,161 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-09-26 08:20:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,161 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:20:18,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:20:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:20:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:20:18,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,162 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-09-26 08:20:18,162 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-09-26 08:20:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,487 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:20:18,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:20:18,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:20:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:20:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:20:18,490 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-09-26 08:20:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,631 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:20:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:20:18,632 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-09-26 08:20:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,633 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:20:18,633 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:20:18,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:20:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:20:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:20:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:20:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:20:18,639 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-09-26 08:20:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,639 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:20:18,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:20:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:20:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:20:18,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,640 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-09-26 08:20:18,641 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-09-26 08:20:18,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,983 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:20:18,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:20:18,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:20:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:20:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:20:18,986 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-09-26 08:20:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,121 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:20:19,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:20:19,122 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-09-26 08:20:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,123 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:20:19,123 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:20:19,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:20:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:20:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:20:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:20:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:20:19,128 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-09-26 08:20:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,129 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:20:19,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:20:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:20:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:20:19,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,130 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-09-26 08:20:19,130 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-09-26 08:20:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,473 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:20:19,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:20:19,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:20:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:20:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:20:19,476 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-09-26 08:20:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,636 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:20:19,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:20:19,636 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-09-26 08:20:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,638 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:20:19,638 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:20:19,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:20:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:20:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:20:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:20:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:20:19,643 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-09-26 08:20:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,643 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:20:19,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:20:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:20:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:20:19,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,645 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-09-26 08:20:19,645 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-09-26 08:20:19,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,972 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:20:19,972 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:20:19,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:20:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:20:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:20:19,974 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-09-26 08:20:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,096 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:20:20,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:20:20,096 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-09-26 08:20:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,097 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:20:20,097 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:20:20,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:20:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:20:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:20:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:20:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:20:20,107 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-09-26 08:20:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,108 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:20:20,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:20:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:20:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:20:20,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,109 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-09-26 08:20:20,109 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-09-26 08:20:20,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,554 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:20:20,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:20:20,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:20:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:20:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:20:20,557 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-09-26 08:20:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,752 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:20:20,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:20:20,752 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-09-26 08:20:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,753 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:20:20,754 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:20:20,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:20:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:20:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:20:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:20:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:20:20,760 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-09-26 08:20:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,761 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:20:20,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:20:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:20:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:20:20,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,762 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-09-26 08:20:20,763 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-09-26 08:20:20,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,255 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:20:21,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:20:21,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:20:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:20:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:20:21,257 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-09-26 08:20:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,398 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:20:21,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:20:21,398 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-09-26 08:20:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,399 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:20:21,399 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:20:21,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:20:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:20:21,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:20:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:20:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:20:21,406 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-09-26 08:20:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,406 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:20:21,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:20:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:20:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:20:21,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,407 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-09-26 08:20:21,409 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-09-26 08:20:21,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,716 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:20:21,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:20:21,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:20:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:20:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:20:21,718 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-09-26 08:20:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,866 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:20:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:20:21,866 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-09-26 08:20:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,868 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:20:21,868 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:20:21,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:20:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:20:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:20:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:20:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:20:21,873 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-09-26 08:20:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,873 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:20:21,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:20:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:20:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:20:21,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,875 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-09-26 08:20:21,875 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-09-26 08:20:21,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:22,160 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:20:22,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:22,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:20:22,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:20:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:20:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:20:22,163 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-09-26 08:20:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:22,225 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:20:22,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:20:22,226 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-09-26 08:20:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:22,227 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:20:22,227 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:20:22,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:20:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:20:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:20:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:20:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:20:22,231 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-09-26 08:20:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:22,232 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:20:22,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:20:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:20:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:20:22,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:22,233 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-09-26 08:20:22,233 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:22,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-09-26 08:20:22,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:22,533 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:20:22,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:22,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:20:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:20:22,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:20:22,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:22,535 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-09-26 08:20:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:22,673 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:20:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:20:22,673 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-09-26 08:20:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:22,675 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:20:22,675 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:20:22,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:20:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:20:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:20:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:20:22,680 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-09-26 08:20:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:22,680 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:20:22,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:20:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:20:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:20:22,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:22,682 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-09-26 08:20:22,682 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:22,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-09-26 08:20:22,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:23,012 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:20:23,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:23,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:20:23,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:20:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:20:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:20:23,014 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-09-26 08:20:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:23,132 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:20:23,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:20:23,132 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-09-26 08:20:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:23,133 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:20:23,133 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:20:23,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:20:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:20:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:20:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:20:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:20:23,140 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-09-26 08:20:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:23,140 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:20:23,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:20:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:20:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:20:23,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:23,141 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-09-26 08:20:23,142 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:23,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-09-26 08:20:23,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:23,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:20:23,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:23,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:20:23,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:20:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:20:23,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:20:23,443 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-09-26 08:20:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:23,534 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:20:23,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:20:23,535 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-09-26 08:20:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:23,536 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:20:23,536 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:20:23,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:20:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:20:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:20:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:20:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:20:23,542 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-09-26 08:20:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:23,542 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:20:23,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:20:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:20:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:20:23,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:23,544 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-09-26 08:20:23,544 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:23,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-09-26 08:20:23,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:23,866 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:20:23,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:23,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:20:23,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:20:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:20:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:20:23,869 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-09-26 08:20:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:23,989 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:20:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:20:23,989 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-09-26 08:20:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:23,990 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:20:23,990 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:20:23,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:20:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:20:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:20:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:20:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:20:23,996 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-09-26 08:20:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:23,996 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:20:23,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:20:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:20:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:20:23,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:23,997 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-09-26 08:20:23,997 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:23,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-09-26 08:20:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:24,287 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:20:24,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:24,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:20:24,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:20:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:20:24,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:24,290 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-09-26 08:20:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:24,463 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:20:24,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:20:24,463 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-09-26 08:20:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:24,464 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:20:24,464 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:20:24,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:20:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:20:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:20:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:20:24,470 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-09-26 08:20:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:24,470 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:20:24,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:20:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:20:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:20:24,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:24,472 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-09-26 08:20:24,472 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:24,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-09-26 08:20:24,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:24,775 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:20:24,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:24,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:20:24,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:20:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:20:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:20:24,777 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-09-26 08:20:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:24,869 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:20:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:20:24,869 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-09-26 08:20:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:24,871 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:20:24,871 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:20:24,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:20:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:20:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:20:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:20:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:20:24,877 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-09-26 08:20:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:20:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:20:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:20:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:20:24,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:24,878 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-09-26 08:20:24,879 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:24,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-09-26 08:20:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,351 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:20:25,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:20:25,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:20:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:20:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:20:25,354 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-09-26 08:20:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,544 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:20:25,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:20:25,544 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-09-26 08:20:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,545 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:20:25,545 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:20:25,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:20:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:20:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:20:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:20:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:20:25,552 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-09-26 08:20:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,552 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:20:25,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:20:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:20:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:20:25,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,554 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-09-26 08:20:25,554 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-09-26 08:20:25,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,954 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:20:25,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:20:25,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:20:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:20:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:20:25,956 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-09-26 08:20:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,127 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:20:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:20:26,128 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-09-26 08:20:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,129 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:20:26,129 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:20:26,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:20:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:20:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:20:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:20:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:20:26,136 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-09-26 08:20:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,136 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:20:26,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:20:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:20:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:20:26,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,137 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-09-26 08:20:26,138 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-09-26 08:20:26,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,821 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:20:26,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:20:26,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:20:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:20:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:20:26,823 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-09-26 08:20:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:27,030 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:20:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:20:27,031 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-09-26 08:20:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:27,032 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:20:27,032 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:20:27,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:20:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:20:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:20:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:20:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:20:27,038 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-09-26 08:20:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:27,038 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:20:27,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:20:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:20:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:20:27,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:27,039 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-09-26 08:20:27,040 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:27,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:27,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-09-26 08:20:27,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:27,371 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:20:27,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:27,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:20:27,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:20:27,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:20:27,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:20:27,374 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-09-26 08:20:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:27,556 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:20:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:20:27,556 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-09-26 08:20:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:27,558 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:20:27,558 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:20:27,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:20:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:20:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:20:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:20:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:20:27,564 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-09-26 08:20:27,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:27,565 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:20:27,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:20:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:20:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:20:27,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:27,566 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-09-26 08:20:27,566 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:27,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-09-26 08:20:27,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:27,933 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:20:27,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:27,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:20:27,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:20:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:20:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:20:27,936 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-09-26 08:20:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,117 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:20:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:20:28,117 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-09-26 08:20:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,118 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:20:28,119 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:20:28,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:20:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:20:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:20:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:20:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:20:28,125 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-09-26 08:20:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:28,126 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:20:28,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:20:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:20:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:20:28,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:28,127 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-09-26 08:20:28,127 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:28,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-09-26 08:20:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:28,639 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:20:28,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:28,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:20:28,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:20:28,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:20:28,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:20:28,642 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-09-26 08:20:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,858 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:20:28,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:20:28,859 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-09-26 08:20:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,860 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:20:28,860 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:20:28,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:20:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:20:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:20:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:20:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:20:28,866 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-09-26 08:20:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:28,867 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:20:28,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:20:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:20:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:20:28,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:28,868 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-09-26 08:20:28,868 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:28,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-09-26 08:20:28,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:29,231 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:20:29,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:29,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:20:29,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:20:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:20:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:20:29,234 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-09-26 08:20:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:29,416 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:20:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:20:29,417 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-09-26 08:20:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:29,418 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:20:29,418 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:20:29,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:20:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:20:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:20:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:20:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:20:29,424 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-09-26 08:20:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:29,425 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:20:29,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:20:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:20:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:20:29,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:29,426 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-09-26 08:20:29,426 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:29,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-09-26 08:20:29,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 10100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:30,129 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:30,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-26 08:20:30,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:20:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:20:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:20:30,131 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-09-26 08:20:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:30,251 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:20:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:20:30,251 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-09-26 08:20:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:30,252 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:20:30,252 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:20:30,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:20:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:20:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:20:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:20:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:20:30,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2018-09-26 08:20:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:30,258 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:20:30,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:20:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:20:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:20:30,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:20:30,386 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 405 [2018-09-26 08:20:30,944 WARN L178 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 405 [2018-09-26 08:20:31,418 WARN L178 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 405 [2018-09-26 08:20:31,423 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 54) the Hoare annotation is: false [2018-09-26 08:20:31,423 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 54) the Hoare annotation is: true [2018-09-26 08:20:31,432 INFO L422 ceAbstractionStarter]: At program point L29(lines 29 42) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~5 58) (<= 58 ULTIMATE.start_main_~j~5)) (and (<= 10 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 10)) (and (<= ULTIMATE.start_main_~i~5 30) (<= 30 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 35) (<= 35 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 77) (<= 77 ULTIMATE.start_main_~j~5)) (and (<= 15 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 15)) (and (<= ULTIMATE.start_main_~i~5 24) (<= 24 ULTIMATE.start_main_~j~5)) (and (<= 79 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 79)) (and (<= 54 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 54)) (and (<= ULTIMATE.start_main_~i~5 61) (<= 61 ULTIMATE.start_main_~j~5)) (and (<= 67 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 67)) (and (<= 80 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 80)) (and (<= ULTIMATE.start_main_~i~5 42) (<= 42 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 46) (<= 46 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 2) (<= 2 ULTIMATE.start_main_~j~5)) (and (<= 94 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 94)) (and (<= ULTIMATE.start_main_~i~5 26) (<= 26 ULTIMATE.start_main_~j~5)) (and (<= 98 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 98)) (and (<= ULTIMATE.start_main_~i~5 43) (<= 43 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 57) (<= 57 ULTIMATE.start_main_~j~5)) (and (<= 45 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 45)) (and (<= 75 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 75)) (and (<= ULTIMATE.start_main_~i~5 88) (<= 88 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 95) (<= 95 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 69) (<= 69 ULTIMATE.start_main_~j~5)) (and (<= 27 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 27)) (and (<= ULTIMATE.start_main_~i~5 60) (<= 60 ULTIMATE.start_main_~j~5)) (and (<= 83 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 83)) (and (<= 29 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 29)) (and (<= 4 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 4)) (and (<= ULTIMATE.start_main_~i~5 87) (<= 87 ULTIMATE.start_main_~j~5)) (and (<= 17 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 17)) (and (<= 12 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 12)) (and (<= ULTIMATE.start_main_~i~5 37) (<= 37 ULTIMATE.start_main_~j~5)) (and (<= 93 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 93)) (and (<= 14 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 14)) (and (<= ULTIMATE.start_main_~i~5 84) (<= 84 ULTIMATE.start_main_~j~5)) (and (<= 49 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 49)) (and (<= 39 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 39)) (and (<= 23 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 23)) (and (<= 44 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 44)) (and (<= 85 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 85)) (and (<= 6 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 6)) (and (<= ULTIMATE.start_main_~i~5 70) (<= 70 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 28) (<= 28 ULTIMATE.start_main_~j~5)) (and (<= 16 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 16)) (and (<= ULTIMATE.start_main_~i~5 38) (<= 38 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 91) (<= 91 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 47) (<= 47 ULTIMATE.start_main_~j~5)) (and (<= 72 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 72)) (and (<= 96 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 96)) (and (<= 89 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 89)) (and (<= 21 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 21)) (and (<= ULTIMATE.start_main_~i~5 66) (<= 66 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 40) (<= 40 ULTIMATE.start_main_~j~5)) (and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 7)) (and (<= 62 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 62)) (and (<= ULTIMATE.start_main_~i~5 73) (<= 73 ULTIMATE.start_main_~j~5)) (and (<= 64 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 64)) (and (<= 33 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 33)) (and (<= 63 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 63)) (and (<= 92 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 92)) (and (<= 31 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 31)) (and (<= ULTIMATE.start_main_~i~5 68) (<= 68 ULTIMATE.start_main_~j~5)) (and (<= 41 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 41)) (and (<= 13 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 13)) (and (<= 25 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 25)) (and (<= ULTIMATE.start_main_~i~5 78) (<= 78 ULTIMATE.start_main_~j~5)) (and (<= 0 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= ULTIMATE.start_main_~i~5 56) (<= 56 ULTIMATE.start_main_~j~5)) (and (<= 55 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 55)) (and (<= 51 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 51)) (and (<= 22 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 22)) (and (<= 3 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 3)) (and (<= ULTIMATE.start_main_~i~5 97) (<= 97 ULTIMATE.start_main_~j~5)) (and (<= 52 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 52)) (and (<= 48 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 48)) (and (<= ULTIMATE.start_main_~i~5 86) (<= 86 ULTIMATE.start_main_~j~5)) (and (<= 11 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 11)) (and (<= ULTIMATE.start_main_~i~5 76) (<= 76 ULTIMATE.start_main_~j~5)) (and (<= 50 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 50)) (and (<= 82 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 82)) (and (<= ULTIMATE.start_main_~i~5 71) (<= 71 ULTIMATE.start_main_~j~5)) (and (<= 32 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 32)) (and (<= 74 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 74)) (and (<= ULTIMATE.start_main_~i~5 19) (<= 19 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 59) (<= 59 ULTIMATE.start_main_~j~5)) (and (<= 20 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 20)) (<= 100 ULTIMATE.start_main_~j~5) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 1)) (and (<= 99 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 99)) (and (<= ULTIMATE.start_main_~i~5 5) (<= 5 ULTIMATE.start_main_~j~5)) (and (<= 90 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 90)) (and (<= 65 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 65)) (and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~j~5)) (and (<= 36 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 36)) (and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~j~5)) (and (<= 34 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 34)) (and (<= 53 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 53)) (and (<= ULTIMATE.start_main_~i~5 18) (<= 18 ULTIMATE.start_main_~j~5)) (and (<= 81 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 81))) [2018-09-26 08:20:31,432 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 54) no Hoare annotation was computed. [2018-09-26 08:20:31,432 INFO L422 ceAbstractionStarter]: At program point L51(lines 51 52) the Hoare annotation is: false [2018-09-26 08:20:31,432 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 53) the Hoare annotation is: false [2018-09-26 08:20:31,438 INFO L422 ceAbstractionStarter]: At program point L41(lines 25 41) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~5 58) (<= 58 ULTIMATE.start_main_~j~5)) (and (<= 10 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 10)) (and (<= ULTIMATE.start_main_~i~5 30) (<= 30 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 35) (<= 35 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 77) (<= 77 ULTIMATE.start_main_~j~5)) (and (<= 15 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 15)) (and (<= ULTIMATE.start_main_~i~5 24) (<= 24 ULTIMATE.start_main_~j~5)) (and (<= 79 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 79)) (and (<= 54 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 54)) (and (<= ULTIMATE.start_main_~i~5 61) (<= 61 ULTIMATE.start_main_~j~5)) (and (<= 67 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 67)) (and (<= 80 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 80)) (and (<= ULTIMATE.start_main_~i~5 42) (<= 42 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 46) (<= 46 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 2) (<= 2 ULTIMATE.start_main_~j~5)) (and (<= 94 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 94)) (and (<= ULTIMATE.start_main_~i~5 26) (<= 26 ULTIMATE.start_main_~j~5)) (and (<= 98 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 98)) (and (<= ULTIMATE.start_main_~i~5 43) (<= 43 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 57) (<= 57 ULTIMATE.start_main_~j~5)) (and (<= 45 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 45)) (and (<= 75 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 75)) (and (<= ULTIMATE.start_main_~i~5 88) (<= 88 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 95) (<= 95 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 69) (<= 69 ULTIMATE.start_main_~j~5)) (and (<= 27 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 27)) (and (<= ULTIMATE.start_main_~i~5 60) (<= 60 ULTIMATE.start_main_~j~5)) (and (<= 83 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 83)) (and (<= 29 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 29)) (and (<= 4 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 4)) (and (<= ULTIMATE.start_main_~i~5 87) (<= 87 ULTIMATE.start_main_~j~5)) (and (<= 17 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 17)) (and (<= 12 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 12)) (and (<= ULTIMATE.start_main_~i~5 37) (<= 37 ULTIMATE.start_main_~j~5)) (and (<= 93 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 93)) (and (<= 14 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 14)) (and (<= ULTIMATE.start_main_~i~5 84) (<= 84 ULTIMATE.start_main_~j~5)) (and (<= 49 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 49)) (and (<= 39 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 39)) (and (<= 23 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 23)) (and (<= 44 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 44)) (and (<= 85 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 85)) (and (<= 6 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 6)) (and (<= ULTIMATE.start_main_~i~5 70) (<= 70 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 28) (<= 28 ULTIMATE.start_main_~j~5)) (and (<= 16 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 16)) (and (<= ULTIMATE.start_main_~i~5 38) (<= 38 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 91) (<= 91 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 47) (<= 47 ULTIMATE.start_main_~j~5)) (and (<= 72 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 72)) (and (<= 96 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 96)) (and (<= 89 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 89)) (and (<= 21 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 21)) (and (<= ULTIMATE.start_main_~i~5 66) (<= 66 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 40) (<= 40 ULTIMATE.start_main_~j~5)) (and (<= 7 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 7)) (and (<= 62 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 62)) (and (<= ULTIMATE.start_main_~i~5 73) (<= 73 ULTIMATE.start_main_~j~5)) (and (<= 64 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 64)) (and (<= 33 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 33)) (and (<= 63 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 63)) (and (<= 92 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 92)) (and (<= 31 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 31)) (and (<= ULTIMATE.start_main_~i~5 68) (<= 68 ULTIMATE.start_main_~j~5)) (and (<= 41 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 41)) (and (<= 13 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 13)) (and (<= 25 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 25)) (and (<= ULTIMATE.start_main_~i~5 78) (<= 78 ULTIMATE.start_main_~j~5)) (and (<= 0 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 0)) (and (<= ULTIMATE.start_main_~i~5 56) (<= 56 ULTIMATE.start_main_~j~5)) (and (<= 55 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 55)) (and (<= 51 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 51)) (and (<= 22 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 22)) (and (<= 3 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 3)) (and (<= ULTIMATE.start_main_~i~5 97) (<= 97 ULTIMATE.start_main_~j~5)) (and (<= 52 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 52)) (and (<= 48 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 48)) (and (<= ULTIMATE.start_main_~i~5 86) (<= 86 ULTIMATE.start_main_~j~5)) (and (<= 11 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 11)) (and (<= ULTIMATE.start_main_~i~5 76) (<= 76 ULTIMATE.start_main_~j~5)) (and (<= 50 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 50)) (and (<= 82 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 82)) (and (<= ULTIMATE.start_main_~i~5 71) (<= 71 ULTIMATE.start_main_~j~5)) (and (<= 32 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 32)) (and (<= 74 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 74)) (and (<= ULTIMATE.start_main_~i~5 19) (<= 19 ULTIMATE.start_main_~j~5)) (and (<= ULTIMATE.start_main_~i~5 59) (<= 59 ULTIMATE.start_main_~j~5)) (and (<= 20 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 20)) (<= 100 ULTIMATE.start_main_~j~5) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 1)) (and (<= 99 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 99)) (and (<= ULTIMATE.start_main_~i~5 5) (<= 5 ULTIMATE.start_main_~j~5)) (and (<= 90 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 90)) (and (<= 65 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 65)) (and (<= ULTIMATE.start_main_~i~5 9) (<= 9 ULTIMATE.start_main_~j~5)) (and (<= 36 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 36)) (and (<= ULTIMATE.start_main_~i~5 8) (<= 8 ULTIMATE.start_main_~j~5)) (and (<= 34 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 34)) (and (<= 53 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 53)) (and (<= ULTIMATE.start_main_~i~5 18) (<= 18 ULTIMATE.start_main_~j~5)) (and (<= 81 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~i~5 81))) [2018-09-26 08:20:31,494 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:20:31 BoogieIcfgContainer [2018-09-26 08:20:31,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:20:31,499 INFO L168 Benchmark]: Toolchain (without parser) took 34045.97 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -919.7 MB). Peak memory consumption was 447.2 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:31,500 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:31,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:31,504 INFO L168 Benchmark]: Boogie Preprocessor took 21.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:31,505 INFO L168 Benchmark]: RCFGBuilder took 276.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 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:20:31,505 INFO L168 Benchmark]: TraceAbstraction took 33700.44 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -930.2 MB). Peak memory consumption was 436.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:31,513 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 276.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33700.44 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -930.2 MB). Peak memory consumption was 436.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 <= 58 && 58 <= main_~j~5) || (10 <= main_~j~5 && main_~i~5 <= 10)) || (main_~i~5 <= 30 && 30 <= main_~j~5)) || (main_~i~5 <= 35 && 35 <= main_~j~5)) || (main_~i~5 <= 77 && 77 <= main_~j~5)) || (15 <= main_~j~5 && main_~i~5 <= 15)) || (main_~i~5 <= 24 && 24 <= main_~j~5)) || (79 <= main_~j~5 && main_~i~5 <= 79)) || (54 <= main_~j~5 && main_~i~5 <= 54)) || (main_~i~5 <= 61 && 61 <= main_~j~5)) || (67 <= main_~j~5 && main_~i~5 <= 67)) || (80 <= main_~j~5 && main_~i~5 <= 80)) || (main_~i~5 <= 42 && 42 <= main_~j~5)) || (main_~i~5 <= 46 && 46 <= main_~j~5)) || (main_~i~5 <= 2 && 2 <= main_~j~5)) || (94 <= main_~j~5 && main_~i~5 <= 94)) || (main_~i~5 <= 26 && 26 <= main_~j~5)) || (98 <= main_~j~5 && main_~i~5 <= 98)) || (main_~i~5 <= 43 && 43 <= main_~j~5)) || (main_~i~5 <= 57 && 57 <= main_~j~5)) || (45 <= main_~j~5 && main_~i~5 <= 45)) || (75 <= main_~j~5 && main_~i~5 <= 75)) || (main_~i~5 <= 88 && 88 <= main_~j~5)) || (main_~i~5 <= 95 && 95 <= main_~j~5)) || (main_~i~5 <= 69 && 69 <= main_~j~5)) || (27 <= main_~j~5 && main_~i~5 <= 27)) || (main_~i~5 <= 60 && 60 <= main_~j~5)) || (83 <= main_~j~5 && main_~i~5 <= 83)) || (29 <= main_~j~5 && main_~i~5 <= 29)) || (4 <= main_~j~5 && main_~i~5 <= 4)) || (main_~i~5 <= 87 && 87 <= main_~j~5)) || (17 <= main_~j~5 && main_~i~5 <= 17)) || (12 <= main_~j~5 && main_~i~5 <= 12)) || (main_~i~5 <= 37 && 37 <= main_~j~5)) || (93 <= main_~j~5 && main_~i~5 <= 93)) || (14 <= main_~j~5 && main_~i~5 <= 14)) || (main_~i~5 <= 84 && 84 <= main_~j~5)) || (49 <= main_~j~5 && main_~i~5 <= 49)) || (39 <= main_~j~5 && main_~i~5 <= 39)) || (23 <= main_~j~5 && main_~i~5 <= 23)) || (44 <= main_~j~5 && main_~i~5 <= 44)) || (85 <= main_~j~5 && main_~i~5 <= 85)) || (6 <= main_~j~5 && main_~i~5 <= 6)) || (main_~i~5 <= 70 && 70 <= main_~j~5)) || (main_~i~5 <= 28 && 28 <= main_~j~5)) || (16 <= main_~j~5 && main_~i~5 <= 16)) || (main_~i~5 <= 38 && 38 <= main_~j~5)) || (main_~i~5 <= 91 && 91 <= main_~j~5)) || (main_~i~5 <= 47 && 47 <= main_~j~5)) || (72 <= main_~j~5 && main_~i~5 <= 72)) || (96 <= main_~j~5 && main_~i~5 <= 96)) || (89 <= main_~j~5 && main_~i~5 <= 89)) || (21 <= main_~j~5 && main_~i~5 <= 21)) || (main_~i~5 <= 66 && 66 <= main_~j~5)) || (main_~i~5 <= 40 && 40 <= main_~j~5)) || (7 <= main_~j~5 && main_~i~5 <= 7)) || (62 <= main_~j~5 && main_~i~5 <= 62)) || (main_~i~5 <= 73 && 73 <= main_~j~5)) || (64 <= main_~j~5 && main_~i~5 <= 64)) || (33 <= main_~j~5 && main_~i~5 <= 33)) || (63 <= main_~j~5 && main_~i~5 <= 63)) || (92 <= main_~j~5 && main_~i~5 <= 92)) || (31 <= main_~j~5 && main_~i~5 <= 31)) || (main_~i~5 <= 68 && 68 <= main_~j~5)) || (41 <= main_~j~5 && main_~i~5 <= 41)) || (13 <= main_~j~5 && main_~i~5 <= 13)) || (25 <= main_~j~5 && main_~i~5 <= 25)) || (main_~i~5 <= 78 && 78 <= main_~j~5)) || (0 <= main_~j~5 && main_~i~5 <= 0)) || (main_~i~5 <= 56 && 56 <= main_~j~5)) || (55 <= main_~j~5 && main_~i~5 <= 55)) || (51 <= main_~j~5 && main_~i~5 <= 51)) || (22 <= main_~j~5 && main_~i~5 <= 22)) || (3 <= main_~j~5 && main_~i~5 <= 3)) || (main_~i~5 <= 97 && 97 <= main_~j~5)) || (52 <= main_~j~5 && main_~i~5 <= 52)) || (48 <= main_~j~5 && main_~i~5 <= 48)) || (main_~i~5 <= 86 && 86 <= main_~j~5)) || (11 <= main_~j~5 && main_~i~5 <= 11)) || (main_~i~5 <= 76 && 76 <= main_~j~5)) || (50 <= main_~j~5 && main_~i~5 <= 50)) || (82 <= main_~j~5 && main_~i~5 <= 82)) || (main_~i~5 <= 71 && 71 <= main_~j~5)) || (32 <= main_~j~5 && main_~i~5 <= 32)) || (74 <= main_~j~5 && main_~i~5 <= 74)) || (main_~i~5 <= 19 && 19 <= main_~j~5)) || (main_~i~5 <= 59 && 59 <= main_~j~5)) || (20 <= main_~j~5 && main_~i~5 <= 20)) || 100 <= main_~j~5) || (1 <= main_~j~5 && main_~i~5 <= 1)) || (99 <= main_~j~5 && main_~i~5 <= 99)) || (main_~i~5 <= 5 && 5 <= main_~j~5)) || (90 <= main_~j~5 && main_~i~5 <= 90)) || (65 <= main_~j~5 && main_~i~5 <= 65)) || (main_~i~5 <= 9 && 9 <= main_~j~5)) || (36 <= main_~j~5 && main_~i~5 <= 36)) || (main_~i~5 <= 8 && 8 <= main_~j~5)) || (34 <= main_~j~5 && main_~i~5 <= 34)) || (53 <= main_~j~5 && main_~i~5 <= 53)) || (main_~i~5 <= 18 && 18 <= main_~j~5)) || (81 <= main_~j~5 && main_~i~5 <= 81) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 <= 58 && 58 <= main_~j~5) || (10 <= main_~j~5 && main_~i~5 <= 10)) || (main_~i~5 <= 30 && 30 <= main_~j~5)) || (main_~i~5 <= 35 && 35 <= main_~j~5)) || (main_~i~5 <= 77 && 77 <= main_~j~5)) || (15 <= main_~j~5 && main_~i~5 <= 15)) || (main_~i~5 <= 24 && 24 <= main_~j~5)) || (79 <= main_~j~5 && main_~i~5 <= 79)) || (54 <= main_~j~5 && main_~i~5 <= 54)) || (main_~i~5 <= 61 && 61 <= main_~j~5)) || (67 <= main_~j~5 && main_~i~5 <= 67)) || (80 <= main_~j~5 && main_~i~5 <= 80)) || (main_~i~5 <= 42 && 42 <= main_~j~5)) || (main_~i~5 <= 46 && 46 <= main_~j~5)) || (main_~i~5 <= 2 && 2 <= main_~j~5)) || (94 <= main_~j~5 && main_~i~5 <= 94)) || (main_~i~5 <= 26 && 26 <= main_~j~5)) || (98 <= main_~j~5 && main_~i~5 <= 98)) || (main_~i~5 <= 43 && 43 <= main_~j~5)) || (main_~i~5 <= 57 && 57 <= main_~j~5)) || (45 <= main_~j~5 && main_~i~5 <= 45)) || (75 <= main_~j~5 && main_~i~5 <= 75)) || (main_~i~5 <= 88 && 88 <= main_~j~5)) || (main_~i~5 <= 95 && 95 <= main_~j~5)) || (main_~i~5 <= 69 && 69 <= main_~j~5)) || (27 <= main_~j~5 && main_~i~5 <= 27)) || (main_~i~5 <= 60 && 60 <= main_~j~5)) || (83 <= main_~j~5 && main_~i~5 <= 83)) || (29 <= main_~j~5 && main_~i~5 <= 29)) || (4 <= main_~j~5 && main_~i~5 <= 4)) || (main_~i~5 <= 87 && 87 <= main_~j~5)) || (17 <= main_~j~5 && main_~i~5 <= 17)) || (12 <= main_~j~5 && main_~i~5 <= 12)) || (main_~i~5 <= 37 && 37 <= main_~j~5)) || (93 <= main_~j~5 && main_~i~5 <= 93)) || (14 <= main_~j~5 && main_~i~5 <= 14)) || (main_~i~5 <= 84 && 84 <= main_~j~5)) || (49 <= main_~j~5 && main_~i~5 <= 49)) || (39 <= main_~j~5 && main_~i~5 <= 39)) || (23 <= main_~j~5 && main_~i~5 <= 23)) || (44 <= main_~j~5 && main_~i~5 <= 44)) || (85 <= main_~j~5 && main_~i~5 <= 85)) || (6 <= main_~j~5 && main_~i~5 <= 6)) || (main_~i~5 <= 70 && 70 <= main_~j~5)) || (main_~i~5 <= 28 && 28 <= main_~j~5)) || (16 <= main_~j~5 && main_~i~5 <= 16)) || (main_~i~5 <= 38 && 38 <= main_~j~5)) || (main_~i~5 <= 91 && 91 <= main_~j~5)) || (main_~i~5 <= 47 && 47 <= main_~j~5)) || (72 <= main_~j~5 && main_~i~5 <= 72)) || (96 <= main_~j~5 && main_~i~5 <= 96)) || (89 <= main_~j~5 && main_~i~5 <= 89)) || (21 <= main_~j~5 && main_~i~5 <= 21)) || (main_~i~5 <= 66 && 66 <= main_~j~5)) || (main_~i~5 <= 40 && 40 <= main_~j~5)) || (7 <= main_~j~5 && main_~i~5 <= 7)) || (62 <= main_~j~5 && main_~i~5 <= 62)) || (main_~i~5 <= 73 && 73 <= main_~j~5)) || (64 <= main_~j~5 && main_~i~5 <= 64)) || (33 <= main_~j~5 && main_~i~5 <= 33)) || (63 <= main_~j~5 && main_~i~5 <= 63)) || (92 <= main_~j~5 && main_~i~5 <= 92)) || (31 <= main_~j~5 && main_~i~5 <= 31)) || (main_~i~5 <= 68 && 68 <= main_~j~5)) || (41 <= main_~j~5 && main_~i~5 <= 41)) || (13 <= main_~j~5 && main_~i~5 <= 13)) || (25 <= main_~j~5 && main_~i~5 <= 25)) || (main_~i~5 <= 78 && 78 <= main_~j~5)) || (0 <= main_~j~5 && main_~i~5 <= 0)) || (main_~i~5 <= 56 && 56 <= main_~j~5)) || (55 <= main_~j~5 && main_~i~5 <= 55)) || (51 <= main_~j~5 && main_~i~5 <= 51)) || (22 <= main_~j~5 && main_~i~5 <= 22)) || (3 <= main_~j~5 && main_~i~5 <= 3)) || (main_~i~5 <= 97 && 97 <= main_~j~5)) || (52 <= main_~j~5 && main_~i~5 <= 52)) || (48 <= main_~j~5 && main_~i~5 <= 48)) || (main_~i~5 <= 86 && 86 <= main_~j~5)) || (11 <= main_~j~5 && main_~i~5 <= 11)) || (main_~i~5 <= 76 && 76 <= main_~j~5)) || (50 <= main_~j~5 && main_~i~5 <= 50)) || (82 <= main_~j~5 && main_~i~5 <= 82)) || (main_~i~5 <= 71 && 71 <= main_~j~5)) || (32 <= main_~j~5 && main_~i~5 <= 32)) || (74 <= main_~j~5 && main_~i~5 <= 74)) || (main_~i~5 <= 19 && 19 <= main_~j~5)) || (main_~i~5 <= 59 && 59 <= main_~j~5)) || (20 <= main_~j~5 && main_~i~5 <= 20)) || 100 <= main_~j~5) || (1 <= main_~j~5 && main_~i~5 <= 1)) || (99 <= main_~j~5 && main_~i~5 <= 99)) || (main_~i~5 <= 5 && 5 <= main_~j~5)) || (90 <= main_~j~5 && main_~i~5 <= 90)) || (65 <= main_~j~5 && main_~i~5 <= 65)) || (main_~i~5 <= 9 && 9 <= main_~j~5)) || (36 <= main_~j~5 && main_~i~5 <= 36)) || (main_~i~5 <= 8 && 8 <= main_~j~5)) || (34 <= main_~j~5 && main_~i~5 <= 34)) || (53 <= main_~j~5 && main_~i~5 <= 53)) || (main_~i~5 <= 18 && 18 <= main_~j~5)) || (81 <= main_~j~5 && main_~i~5 <= 81) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 33.5s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 0 SDslu, 9028 SDs, 0 SdLazy, 9229 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5252 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 206 NumberOfFragments, 1412 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 10504 NumberOfCodeBlocks, 10504 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 4223921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10100/343400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string_concat-noarr.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-20-31-534.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string_concat-noarr.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-20-31-534.csv Received shutdown request...