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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:34:44,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:34:44,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:34:44,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:34:44,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:34:44,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:34:44,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:34:44,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:34:44,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:34:44,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:34:44,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:34:44,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:34:44,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:34:44,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:34:44,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:34:44,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:34:44,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:34:44,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:34:44,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:34:44,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:34:44,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:34:44,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:34:44,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:34:44,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:34:44,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:34:44,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:34:44,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:34:44,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:34:44,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:34:44,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:34:44,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:34:44,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:34:44,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:34:44,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:34:44,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:34:44,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:34:44,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:34:44,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:34:44,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:34:44,098 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:34:44,098 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:34:44,098 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:34:44,099 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:34:44,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:34:44,099 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:34:44,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:34:44,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:34:44,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:34:44,100 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:34:44,100 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:34:44,101 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:34:44,101 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:34:44,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:34:44,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:34:44,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:34:44,183 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:34:44,183 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:34:44,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:34:44,185 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 12:34:44,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:34:44,239 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:34:44,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:34:44,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:34:44,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:34:44,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... [2018-10-15 12:34:44,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:34:44,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:34:44,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:34:44,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:34:44,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:34:44,351 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:34:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:34:44,544 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:34:44,544 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:44 BoogieIcfgContainer [2018-10-15 12:34:44,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:34:44,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:34:44,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:34:44,549 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:34:44,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:44" (1/2) ... [2018-10-15 12:34:44,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f6ce18 and model type diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:34:44, skipping insertion in model container [2018-10-15 12:34:44,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:44" (2/2) ... [2018-10-15 12:34:44,553 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:34:44,561 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:34:44,570 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:34:44,588 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:34:44,619 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:34:44,620 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:34:44,620 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:34:44,621 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:34:44,621 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:34:44,621 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:34:44,621 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:34:44,621 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:34:44,622 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:34:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 12:34:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 12:34:44,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:44,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:44,649 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:44,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1240084208, now seen corresponding path program 1 times [2018-10-15 12:34:44,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:45,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:34:45,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:34:45,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:34:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:34:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:45,095 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 12:34:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:45,225 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 12:34:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:34:45,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 12:34:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:45,249 INFO L225 Difference]: With dead ends: 18 [2018-10-15 12:34:45,249 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 12:34:45,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 12:34:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-10-15 12:34:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 12:34:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 12:34:45,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-10-15 12:34:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:45,312 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 12:34:45,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:34:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 12:34:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 12:34:45,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:45,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:45,314 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:45,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1675509089, now seen corresponding path program 1 times [2018-10-15 12:34:45,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 12:34:45,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:34:45,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:34:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:34:45,570 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-10-15 12:34:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:45,643 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 12:34:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:34:45,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-15 12:34:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:45,645 INFO L225 Difference]: With dead ends: 21 [2018-10-15 12:34:45,645 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 12:34:45,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:34:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 12:34:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-10-15 12:34:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 12:34:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 12:34:45,651 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-10-15 12:34:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:45,652 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 12:34:45,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:34:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 12:34:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 12:34:45,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:45,653 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:45,654 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:45,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1303174288, now seen corresponding path program 2 times [2018-10-15 12:34:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:45,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:45,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:34:45,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:34:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:34:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:34:45,881 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-10-15 12:34:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:46,043 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 12:34:46,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:34:46,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 12:34:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:46,044 INFO L225 Difference]: With dead ends: 24 [2018-10-15 12:34:46,044 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:34:46,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:34:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:34:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-15 12:34:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 12:34:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-15 12:34:46,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-10-15 12:34:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:46,051 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-15 12:34:46,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:34:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-15 12:34:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 12:34:46,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:46,052 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:46,052 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:46,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -940355839, now seen corresponding path program 3 times [2018-10-15 12:34:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:46,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:46,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:34:46,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:34:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:34:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:34:46,612 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 6 states. [2018-10-15 12:34:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:46,864 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 12:34:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:34:46,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-15 12:34:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:46,867 INFO L225 Difference]: With dead ends: 27 [2018-10-15 12:34:46,867 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 12:34:46,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:34:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 12:34:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-15 12:34:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 12:34:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 12:34:46,874 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-10-15 12:34:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:46,875 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 12:34:46,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:34:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 12:34:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:34:46,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:46,876 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:46,876 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:46,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1646341584, now seen corresponding path program 4 times [2018-10-15 12:34:46,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:47,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:34:47,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:34:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:34:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:34:47,469 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 7 states. [2018-10-15 12:34:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:47,706 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 12:34:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:34:47,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 12:34:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:47,710 INFO L225 Difference]: With dead ends: 30 [2018-10-15 12:34:47,710 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 12:34:47,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:34:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 12:34:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-10-15 12:34:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 12:34:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-15 12:34:47,718 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-10-15 12:34:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:47,718 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-15 12:34:47,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:34:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-15 12:34:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-15 12:34:47,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:47,721 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:47,722 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:47,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:47,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1646045345, now seen corresponding path program 5 times [2018-10-15 12:34:47,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:48,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:48,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:34:48,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:34:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:34:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:34:48,061 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2018-10-15 12:34:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:48,515 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 12:34:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:34:48,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-15 12:34:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:48,517 INFO L225 Difference]: With dead ends: 33 [2018-10-15 12:34:48,517 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 12:34:48,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:34:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 12:34:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-15 12:34:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:34:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:34:48,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-10-15 12:34:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:48,523 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:34:48,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:34:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:34:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:34:48,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:48,524 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:48,525 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:48,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1410723888, now seen corresponding path program 6 times [2018-10-15 12:34:48,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:48,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:48,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:34:48,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:34:48,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:34:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:34:48,998 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-10-15 12:34:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:49,184 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 12:34:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:34:49,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-15 12:34:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:49,187 INFO L225 Difference]: With dead ends: 36 [2018-10-15 12:34:49,187 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:34:49,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:34:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:34:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-10-15 12:34:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 12:34:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-15 12:34:49,192 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-10-15 12:34:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:49,193 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-15 12:34:49,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:34:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-15 12:34:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 12:34:49,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:49,194 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:49,195 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:49,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 335825473, now seen corresponding path program 7 times [2018-10-15 12:34:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:49,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:49,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:34:49,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:34:49,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:34:49,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:34:49,509 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 10 states. [2018-10-15 12:34:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:49,780 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 12:34:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:34:49,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-10-15 12:34:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:49,782 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:34:49,782 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:34:49,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:34:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:34:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-15 12:34:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 12:34:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 12:34:49,787 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-10-15 12:34:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:49,788 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 12:34:49,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:34:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 12:34:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 12:34:49,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:49,789 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:49,790 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:49,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1313303184, now seen corresponding path program 8 times [2018-10-15 12:34:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:50,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:34:50,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:34:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:34:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:34:50,196 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-10-15 12:34:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:50,420 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 12:34:50,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:34:50,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-10-15 12:34:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:50,423 INFO L225 Difference]: With dead ends: 42 [2018-10-15 12:34:50,423 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 12:34:50,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:34:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 12:34:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-10-15 12:34:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:34:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:34:50,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-10-15 12:34:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:50,429 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:34:50,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:34:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:34:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:34:50,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:50,430 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:50,431 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:50,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:50,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1473524705, now seen corresponding path program 9 times [2018-10-15 12:34:50,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:50,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:34:50,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:34:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:34:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:34:50,708 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2018-10-15 12:34:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:51,139 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 12:34:51,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:34:51,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-15 12:34:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:51,141 INFO L225 Difference]: With dead ends: 45 [2018-10-15 12:34:51,141 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:34:51,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:34:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:34:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-15 12:34:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:34:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:34:51,147 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-10-15 12:34:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:51,147 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:34:51,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:34:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:34:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:34:51,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:51,149 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:51,149 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:51,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1370776336, now seen corresponding path program 10 times [2018-10-15 12:34:51,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:51,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:51,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:34:51,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:34:51,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:34:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:34:51,444 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-10-15 12:34:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:51,904 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 12:34:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:34:51,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-10-15 12:34:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:51,906 INFO L225 Difference]: With dead ends: 48 [2018-10-15 12:34:51,907 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:34:51,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:34:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:34:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-10-15 12:34:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 12:34:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 12:34:51,912 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-10-15 12:34:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:51,912 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 12:34:51,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:34:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 12:34:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 12:34:51,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:51,914 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:51,914 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:51,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:51,914 INFO L82 PathProgramCache]: Analyzing trace with hash -533305983, now seen corresponding path program 11 times [2018-10-15 12:34:51,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:52,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:52,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:34:52,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:34:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:34:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:34:52,216 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 14 states. [2018-10-15 12:34:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:52,679 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-15 12:34:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:34:52,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-10-15 12:34:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:52,681 INFO L225 Difference]: With dead ends: 51 [2018-10-15 12:34:52,682 INFO L226 Difference]: Without dead ends: 51 [2018-10-15 12:34:52,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:34:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-15 12:34:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-15 12:34:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:34:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 12:34:52,687 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-10-15 12:34:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:52,688 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 12:34:52,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:34:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 12:34:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 12:34:52,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:52,689 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:52,689 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:52,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash -919042224, now seen corresponding path program 12 times [2018-10-15 12:34:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:53,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:53,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:34:53,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:34:53,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:34:53,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:34:53,105 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 15 states. [2018-10-15 12:34:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:53,447 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:34:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:34:53,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-10-15 12:34:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:53,449 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:34:53,449 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:34:53,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:34:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:34:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-15 12:34:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-15 12:34:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-15 12:34:53,455 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-10-15 12:34:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:53,455 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-15 12:34:53,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:34:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-15 12:34:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-15 12:34:53,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:53,457 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:53,457 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:53,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:53,457 INFO L82 PathProgramCache]: Analyzing trace with hash 945086241, now seen corresponding path program 13 times [2018-10-15 12:34:53,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:34:54,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:34:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:34:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:34:54,225 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 16 states. [2018-10-15 12:34:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:54,707 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:34:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:34:54,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-10-15 12:34:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:54,708 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:34:54,709 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:34:54,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:34:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:34:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-15 12:34:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:34:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 12:34:54,714 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-10-15 12:34:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:54,714 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 12:34:54,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:34:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 12:34:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 12:34:54,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:54,716 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:54,716 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:54,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1269049776, now seen corresponding path program 14 times [2018-10-15 12:34:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:34:56,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:34:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:34:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:34:56,042 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2018-10-15 12:34:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:56,887 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 12:34:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:34:56,891 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-15 12:34:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:56,892 INFO L225 Difference]: With dead ends: 60 [2018-10-15 12:34:56,892 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 12:34:56,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:34:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 12:34:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-10-15 12:34:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 12:34:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-15 12:34:56,897 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-10-15 12:34:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:56,898 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-15 12:34:56,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:34:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-15 12:34:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 12:34:56,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:56,907 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:56,907 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:56,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1675206849, now seen corresponding path program 15 times [2018-10-15 12:34:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:58,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:58,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:34:58,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:34:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:34:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:34:58,148 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 18 states. [2018-10-15 12:34:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:59,034 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 12:34:59,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:34:59,034 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-10-15 12:34:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:59,035 INFO L225 Difference]: With dead ends: 63 [2018-10-15 12:34:59,036 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:34:59,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:34:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:34:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-15 12:34:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:34:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 12:34:59,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-10-15 12:34:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:59,048 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 12:34:59,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:34:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 12:34:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:34:59,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:59,049 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:59,050 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:59,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1717271536, now seen corresponding path program 16 times [2018-10-15 12:34:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:59,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:34:59,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:34:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:34:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:34:59,482 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 19 states. [2018-10-15 12:35:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,082 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 12:35:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:35:00,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-15 12:35:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,083 INFO L225 Difference]: With dead ends: 66 [2018-10-15 12:35:00,083 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 12:35:00,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:35:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 12:35:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-15 12:35:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-15 12:35:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-15 12:35:00,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-10-15 12:35:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,089 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-15 12:35:00,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:35:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-15 12:35:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-15 12:35:00,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,090 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,091 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2129570401, now seen corresponding path program 17 times [2018-10-15 12:35:00,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:01,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:01,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:35:01,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:35:01,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:35:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:01,450 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 20 states. [2018-10-15 12:35:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:02,045 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 12:35:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:35:02,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-10-15 12:35:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:02,047 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:35:02,047 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:35:02,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:35:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-15 12:35:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:35:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:35:02,051 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-10-15 12:35:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:02,051 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:35:02,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:35:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:35:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:35:02,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:02,052 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:02,052 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:02,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash 785356400, now seen corresponding path program 18 times [2018-10-15 12:35:02,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:02,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:02,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:35:02,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:35:02,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:35:02,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:35:02,415 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 21 states. [2018-10-15 12:35:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:03,289 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 12:35:03,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:35:03,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-15 12:35:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:03,291 INFO L225 Difference]: With dead ends: 72 [2018-10-15 12:35:03,291 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:35:03,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:35:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:35:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-10-15 12:35:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:35:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 12:35:03,295 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-10-15 12:35:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:03,295 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 12:35:03,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:35:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 12:35:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:35:03,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:03,296 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:03,297 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:03,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1581120513, now seen corresponding path program 19 times [2018-10-15 12:35:03,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:03,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:03,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:35:03,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:35:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:35:03,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:35:03,714 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-10-15 12:35:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:04,404 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-15 12:35:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:35:04,405 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-10-15 12:35:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:04,406 INFO L225 Difference]: With dead ends: 75 [2018-10-15 12:35:04,406 INFO L226 Difference]: Without dead ends: 75 [2018-10-15 12:35:04,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:35:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-15 12:35:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-10-15 12:35:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:35:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:35:04,409 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-10-15 12:35:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:04,409 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:35:04,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:35:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:35:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:35:04,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:04,410 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:04,411 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:04,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -29663024, now seen corresponding path program 20 times [2018-10-15 12:35:04,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:35:05,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:35:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:35:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:05,217 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 23 states. [2018-10-15 12:35:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:05,932 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:35:05,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:35:05,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-10-15 12:35:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:05,934 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:35:05,934 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:35:05,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:35:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-15 12:35:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 12:35:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 12:35:05,937 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-10-15 12:35:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:05,937 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 12:35:05,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:35:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 12:35:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 12:35:05,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:05,938 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:05,939 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:05,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash 787584417, now seen corresponding path program 21 times [2018-10-15 12:35:05,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:35:06,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:35:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:35:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:35:06,798 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-15 12:35:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,580 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:35:07,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:35:07,584 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-15 12:35:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,585 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:35:07,585 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:35:07,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:35:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:35:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-15 12:35:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 12:35:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 12:35:07,588 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-10-15 12:35:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,589 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 12:35:07,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:35:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 12:35:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:35:07,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,590 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,590 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,590 INFO L82 PathProgramCache]: Analyzing trace with hash -763501776, now seen corresponding path program 22 times [2018-10-15 12:35:07,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:08,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:08,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:35:08,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:35:08,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:35:08,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:08,425 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 25 states. [2018-10-15 12:35:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:09,348 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 12:35:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:35:09,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-10-15 12:35:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:09,350 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:35:09,351 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:35:09,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:35:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-15 12:35:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-15 12:35:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-15 12:35:09,356 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-10-15 12:35:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:09,356 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-15 12:35:09,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:35:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-15 12:35:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-15 12:35:09,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:09,357 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:09,357 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:09,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash 380860225, now seen corresponding path program 23 times [2018-10-15 12:35:09,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:10,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:10,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:35:10,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:35:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:35:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:10,891 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 26 states. [2018-10-15 12:35:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:11,818 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-15 12:35:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:35:11,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-10-15 12:35:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:11,820 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:35:11,820 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 12:35:11,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 12:35:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-15 12:35:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 12:35:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 12:35:11,824 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-15 12:35:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:11,824 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 12:35:11,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:35:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 12:35:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 12:35:11,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:11,825 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:11,825 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:11,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1381163632, now seen corresponding path program 24 times [2018-10-15 12:35:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:12,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:35:12,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:35:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:35:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:12,670 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 27 states. [2018-10-15 12:35:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:13,834 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 12:35:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:35:13,835 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-10-15 12:35:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:13,836 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:35:13,836 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:35:13,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:35:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-15 12:35:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-15 12:35:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-15 12:35:13,840 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-15 12:35:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:13,841 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-15 12:35:13,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:35:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-15 12:35:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-15 12:35:13,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:13,842 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:13,842 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:13,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash -743595807, now seen corresponding path program 25 times [2018-10-15 12:35:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:14,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:14,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:35:14,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:35:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:35:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:35:14,529 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 28 states. [2018-10-15 12:35:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:15,592 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 12:35:15,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:35:15,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2018-10-15 12:35:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:15,599 INFO L225 Difference]: With dead ends: 93 [2018-10-15 12:35:15,599 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 12:35:15,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:35:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 12:35:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-15 12:35:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:35:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:35:15,602 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-15 12:35:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:15,602 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:35:15,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:35:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:35:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:35:15,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:15,603 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:15,603 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:15,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 694095856, now seen corresponding path program 26 times [2018-10-15 12:35:15,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:17,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:17,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:35:17,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:35:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:35:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:17,018 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 29 states. [2018-10-15 12:35:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:18,240 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 12:35:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:35:18,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-10-15 12:35:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:18,242 INFO L225 Difference]: With dead ends: 96 [2018-10-15 12:35:18,242 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 12:35:18,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 12:35:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-15 12:35:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 12:35:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-15 12:35:18,247 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-15 12:35:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:18,247 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-15 12:35:18,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:35:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-15 12:35:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-15 12:35:18,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:18,248 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:18,248 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:18,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1552552577, now seen corresponding path program 27 times [2018-10-15 12:35:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:19,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:19,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:35:19,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:35:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:35:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:35:19,604 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 30 states. [2018-10-15 12:35:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:20,835 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:35:20,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:35:20,835 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2018-10-15 12:35:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:20,837 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:35:20,837 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:35:20,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:35:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:35:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-15 12:35:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 12:35:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 12:35:20,842 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-15 12:35:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:20,842 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 12:35:20,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:35:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 12:35:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 12:35:20,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:20,843 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:20,843 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:20,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash -693519792, now seen corresponding path program 28 times [2018-10-15 12:35:20,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:22,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:22,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:35:22,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:35:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:35:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:22,528 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-10-15 12:35:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:24,004 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 12:35:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:35:24,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2018-10-15 12:35:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:24,006 INFO L225 Difference]: With dead ends: 102 [2018-10-15 12:35:24,006 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:35:24,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:35:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-15 12:35:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 12:35:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 12:35:24,010 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-15 12:35:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:24,010 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 12:35:24,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:35:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 12:35:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:35:24,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:24,011 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:24,011 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:24,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2139960287, now seen corresponding path program 29 times [2018-10-15 12:35:24,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:35:24,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:35:24,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:35:24,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:24,788 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 32 states. [2018-10-15 12:35:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:26,261 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 12:35:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:35:26,261 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-10-15 12:35:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:26,262 INFO L225 Difference]: With dead ends: 105 [2018-10-15 12:35:26,263 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 12:35:26,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 12:35:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-15 12:35:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 12:35:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 12:35:26,266 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-15 12:35:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:26,266 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 12:35:26,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:35:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 12:35:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 12:35:26,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:26,267 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:26,268 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:26,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:26,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1641866064, now seen corresponding path program 30 times [2018-10-15 12:35:26,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:27,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:35:27,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:35:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:35:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:27,151 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 33 states. [2018-10-15 12:35:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:28,880 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:35:28,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:35:28,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2018-10-15 12:35:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:28,881 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:35:28,882 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:35:28,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:35:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-15 12:35:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 12:35:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 12:35:28,886 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-15 12:35:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:28,886 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 12:35:28,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:35:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 12:35:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 12:35:28,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:28,887 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:28,888 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:28,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2028876351, now seen corresponding path program 31 times [2018-10-15 12:35:28,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:29,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:29,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 12:35:29,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 12:35:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 12:35:29,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:35:29,571 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 34 states. [2018-10-15 12:35:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:31,156 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-15 12:35:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:35:31,156 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 105 [2018-10-15 12:35:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:31,158 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:35:31,158 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 12:35:31,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:35:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 12:35:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-15 12:35:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 12:35:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 12:35:31,163 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-15 12:35:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:31,163 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 12:35:31,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 12:35:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 12:35:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 12:35:31,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:31,164 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:31,164 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:31,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 534853392, now seen corresponding path program 32 times [2018-10-15 12:35:31,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:31,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:31,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:35:31,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:35:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:35:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:31,969 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 35 states. [2018-10-15 12:35:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:33,808 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 12:35:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:35:33,809 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2018-10-15 12:35:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:33,810 INFO L225 Difference]: With dead ends: 114 [2018-10-15 12:35:33,810 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:35:33,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:35:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-15 12:35:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-15 12:35:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-15 12:35:33,815 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-15 12:35:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:33,815 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-15 12:35:33,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:35:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-15 12:35:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-15 12:35:33,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:33,816 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:33,817 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:33,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:33,817 INFO L82 PathProgramCache]: Analyzing trace with hash -795797663, now seen corresponding path program 33 times [2018-10-15 12:35:33,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:34,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:34,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:35:34,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:35:34,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:35:34,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:35:34,869 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 36 states. [2018-10-15 12:35:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:36,652 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:35:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:35:36,652 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2018-10-15 12:35:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:36,653 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:35:36,654 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:35:36,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:35:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:35:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-15 12:35:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:35:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:35:36,658 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-15 12:35:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:36,658 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:35:36,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:35:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:35:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:35:36,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:36,660 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:36,660 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:36,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash 326764912, now seen corresponding path program 34 times [2018-10-15 12:35:36,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:37,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:37,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:35:37,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:35:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:35:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:35:37,501 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 37 states. [2018-10-15 12:35:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:39,691 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 12:35:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:35:39,692 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-10-15 12:35:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:39,693 INFO L225 Difference]: With dead ends: 120 [2018-10-15 12:35:39,693 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 12:35:39,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:35:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 12:35:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-15 12:35:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 12:35:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-15 12:35:39,697 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-15 12:35:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:39,698 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-15 12:35:39,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:35:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-15 12:35:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-15 12:35:39,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:39,698 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:39,698 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:39,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1973070081, now seen corresponding path program 35 times [2018-10-15 12:35:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:40,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:40,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:35:40,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:35:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:35:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:40,778 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 38 states. [2018-10-15 12:35:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:42,750 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-15 12:35:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:35:42,751 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 117 [2018-10-15 12:35:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:42,752 INFO L225 Difference]: With dead ends: 123 [2018-10-15 12:35:42,752 INFO L226 Difference]: Without dead ends: 123 [2018-10-15 12:35:42,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-15 12:35:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-15 12:35:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:35:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 12:35:42,756 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-15 12:35:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:42,757 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 12:35:42,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:35:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 12:35:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:35:42,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:42,758 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:42,758 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:42,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1476160560, now seen corresponding path program 36 times [2018-10-15 12:35:42,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:44,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:44,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:35:44,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:35:44,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:35:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:44,251 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-15 12:35:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:46,340 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:35:46,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:35:46,340 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-15 12:35:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:46,342 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:35:46,342 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:35:46,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:35:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-15 12:35:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 12:35:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-15 12:35:46,345 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-15 12:35:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:46,346 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-15 12:35:46,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:35:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-15 12:35:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-15 12:35:46,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:46,347 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:46,347 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:46,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -413629791, now seen corresponding path program 37 times [2018-10-15 12:35:46,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:47,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:47,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 12:35:47,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 12:35:47,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 12:35:47,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:35:47,330 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 40 states. [2018-10-15 12:35:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:49,806 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:35:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:35:49,807 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 123 [2018-10-15 12:35:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:49,808 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:35:49,808 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:35:49,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:35:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:35:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-15 12:35:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 12:35:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 12:35:49,812 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-15 12:35:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:49,812 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 12:35:49,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 12:35:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 12:35:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 12:35:49,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:49,813 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:49,813 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:49,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash -468462032, now seen corresponding path program 38 times [2018-10-15 12:35:49,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:50,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:50,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:35:50,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:35:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:35:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:50,970 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 41 states. [2018-10-15 12:35:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:53,310 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 12:35:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:35:53,311 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 126 [2018-10-15 12:35:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:53,312 INFO L225 Difference]: With dead ends: 132 [2018-10-15 12:35:53,313 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:35:53,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:35:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-15 12:35:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 12:35:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 12:35:53,317 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-15 12:35:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:53,318 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 12:35:53,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:35:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 12:35:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:35:53,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:53,319 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:53,319 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:53,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1888181183, now seen corresponding path program 39 times [2018-10-15 12:35:53,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:54,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:54,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:35:54,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:35:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:35:54,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:35:54,599 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 42 states. [2018-10-15 12:35:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:57,037 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 12:35:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:35:57,037 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 129 [2018-10-15 12:35:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:57,039 INFO L225 Difference]: With dead ends: 135 [2018-10-15 12:35:57,039 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:35:57,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:35:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:35:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-15 12:35:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:35:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 12:35:57,043 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-15 12:35:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:57,044 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 12:35:57,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:35:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 12:35:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 12:35:57,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:57,045 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:57,045 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:57,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash 96522384, now seen corresponding path program 40 times [2018-10-15 12:35:57,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:58,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:58,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:35:58,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:35:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:35:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:58,737 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-15 12:36:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:01,436 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 12:36:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:36:01,436 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-15 12:36:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:01,438 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:36:01,438 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:36:01,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:36:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:36:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-15 12:36:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 12:36:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 12:36:01,442 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-15 12:36:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:01,443 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 12:36:01,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:36:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 12:36:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:36:01,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:01,444 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:01,444 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:01,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1880690145, now seen corresponding path program 41 times [2018-10-15 12:36:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:02,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:36:02,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:36:02,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:36:02,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:36:02,908 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 44 states. [2018-10-15 12:36:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:05,730 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 12:36:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:36:05,730 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 135 [2018-10-15 12:36:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:05,732 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:36:05,732 INFO L226 Difference]: Without dead ends: 141 [2018-10-15 12:36:05,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:36:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-15 12:36:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-15 12:36:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:36:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:36:05,736 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-15 12:36:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:05,737 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:36:05,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:36:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:36:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:36:05,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:05,738 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:05,738 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:05,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash -492797200, now seen corresponding path program 42 times [2018-10-15 12:36:05,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:07,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:07,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:36:07,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:36:07,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:36:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:36:07,065 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 45 states. [2018-10-15 12:36:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:10,547 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:36:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:36:10,547 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 138 [2018-10-15 12:36:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:10,548 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:36:10,548 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:36:10,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:36:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:36:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-15 12:36:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-15 12:36:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-15 12:36:10,553 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-15 12:36:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:10,554 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-15 12:36:10,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:36:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-15 12:36:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-15 12:36:10,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:10,555 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:10,555 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:10,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1007698047, now seen corresponding path program 43 times [2018-10-15 12:36:10,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:11,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:11,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:36:11,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:36:11,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:36:11,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:36:11,731 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 46 states. [2018-10-15 12:36:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:14,747 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-15 12:36:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:36:14,748 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 141 [2018-10-15 12:36:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:14,749 INFO L225 Difference]: With dead ends: 147 [2018-10-15 12:36:14,749 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 12:36:14,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:36:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 12:36:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-15 12:36:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:36:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 12:36:14,753 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-15 12:36:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:14,753 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 12:36:14,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:36:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 12:36:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 12:36:14,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:14,754 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:14,755 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:14,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1204350288, now seen corresponding path program 44 times [2018-10-15 12:36:14,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:16,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:16,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:36:16,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:36:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:36:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:36:16,723 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 47 states. [2018-10-15 12:36:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:19,852 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 12:36:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:36:19,852 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 144 [2018-10-15 12:36:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:19,853 INFO L225 Difference]: With dead ends: 150 [2018-10-15 12:36:19,854 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 12:36:19,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:36:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 12:36:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-15 12:36:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-15 12:36:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-15 12:36:19,857 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-15 12:36:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:19,858 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-15 12:36:19,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:36:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-15 12:36:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-15 12:36:19,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:19,859 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:19,859 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:19,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1641891551, now seen corresponding path program 45 times [2018-10-15 12:36:19,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:21,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:21,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:36:21,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:36:21,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:36:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:36:21,385 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 48 states. [2018-10-15 12:36:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:24,707 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:36:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:36:24,707 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 147 [2018-10-15 12:36:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:24,708 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:36:24,709 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:36:24,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:36:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:36:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-15 12:36:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:36:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:36:24,713 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-15 12:36:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:24,713 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:36:24,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:36:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:36:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:36:24,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:24,714 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:24,714 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:24,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1506807728, now seen corresponding path program 46 times [2018-10-15 12:36:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:26,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:26,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:36:26,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:36:26,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:36:26,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:36:26,391 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 49 states. [2018-10-15 12:36:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:29,682 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 12:36:29,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:36:29,683 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-10-15 12:36:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:29,684 INFO L225 Difference]: With dead ends: 156 [2018-10-15 12:36:29,684 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 12:36:29,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:36:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 12:36:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-15 12:36:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 12:36:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-15 12:36:29,687 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-15 12:36:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:29,687 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-15 12:36:29,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:36:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-15 12:36:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-15 12:36:29,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:29,688 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:29,689 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:29,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1973683519, now seen corresponding path program 47 times [2018-10-15 12:36:29,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:32,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:36:32,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:36:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:36:32,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:36:32,324 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 50 states. [2018-10-15 12:36:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:35,927 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 12:36:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:36:35,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 153 [2018-10-15 12:36:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:35,929 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:36:35,929 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:36:35,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:36:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:36:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-15 12:36:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 12:36:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 12:36:35,932 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-15 12:36:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:35,933 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 12:36:35,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:36:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 12:36:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:36:35,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:35,934 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:35,934 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:35,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash -187962864, now seen corresponding path program 48 times [2018-10-15 12:36:35,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:36:37,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:36:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:36:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:36:37,850 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 51 states. [2018-10-15 12:36:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:41,604 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:36:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:36:41,604 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 156 [2018-10-15 12:36:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:41,606 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:36:41,606 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:36:41,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:36:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:36:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-15 12:36:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 12:36:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 12:36:41,609 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-15 12:36:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:41,609 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 12:36:41,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:36:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 12:36:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:36:41,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:41,610 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:41,610 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:41,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:41,611 INFO L82 PathProgramCache]: Analyzing trace with hash 751141985, now seen corresponding path program 49 times [2018-10-15 12:36:41,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:44,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:36:44,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:36:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:36:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:36:44,753 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 52 states. [2018-10-15 12:36:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:48,598 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-15 12:36:48,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:36:48,599 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 159 [2018-10-15 12:36:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:48,600 INFO L225 Difference]: With dead ends: 165 [2018-10-15 12:36:48,600 INFO L226 Difference]: Without dead ends: 165 [2018-10-15 12:36:48,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:36:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-15 12:36:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-15 12:36:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:36:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:36:48,604 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-15 12:36:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:48,604 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:36:48,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:36:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:36:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:36:48,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:48,605 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:48,606 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:48,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash 206732400, now seen corresponding path program 50 times [2018-10-15 12:36:48,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:13,486 WARN L179 SmtUtils]: Spent 24.17 s on a formula simplification. DAG size of input: 40 DAG size of output: 16 [2018-10-15 12:37:25,585 WARN L179 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 40 DAG size of output: 16 [2018-10-15 12:37:37,670 WARN L179 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:37:49,733 WARN L179 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:38:13,838 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:38:50,048 WARN L179 SmtUtils]: Spent 36.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:39:14,165 WARN L179 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:39:38,262 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:39:50,336 WARN L179 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:40:26,456 WARN L179 SmtUtils]: Spent 36.09 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:41:26,632 WARN L179 SmtUtils]: Spent 1.00 m on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:41:50,733 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:42:03,066 WARN L179 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:42:15,240 WARN L179 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:42:51,381 WARN L179 SmtUtils]: Spent 36.09 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:43:15,508 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:43:39,722 WARN L179 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2018-10-15 12:43:51,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse7 (* 2 .cse10))) (let ((.cse8 (* (- 2) .cse10)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse9 (= .cse7 c_ULTIMATE.start_main_~y~0))) (let ((.cse1 (not .cse9)) (.cse2 (< c_ULTIMATE.start_main_~y~0 .cse0)) (.cse4 (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8 (- 2)) 4294967296)) .cse7 c_ULTIMATE.start_main_~x~0)) (.cse5 (or (<= .cse0 c_ULTIMATE.start_main_~y~0) .cse9)) (.cse6 (+ .cse7 c_ULTIMATE.start_main_~x~0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~y~0 .cse8) 4294967296)))) (.cse3 (+ c_ULTIMATE.start_main_~y~0 44))) (and (< .cse0 (+ c_ULTIMATE.start_main_~y~0 1)) (or (and .cse1 .cse2 (<= .cse3 .cse4)) (and .cse5 (<= .cse3 .cse6))) (<= 44 c_ULTIMATE.start_main_~x~0) (<= c_ULTIMATE.start_main_~x~0 44) (or (and .cse1 .cse2 (<= .cse4 .cse3)) (and .cse5 (<= .cse6 .cse3)))))))) is different from true