java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b01_single_pca_UNSAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:11:35,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:11:35,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:11:35,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:11:35,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:11:35,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:11:35,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:11:35,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:11:35,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:11:35,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:11:35,194 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:11:35,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:11:35,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:11:35,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:11:35,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:11:35,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:11:35,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:11:35,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:11:35,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:11:35,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:11:35,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:11:35,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:11:35,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:11:35,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:11:35,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:11:35,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:11:35,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:11:35,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:11:35,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:11:35,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:11:35,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:11:35,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:11:35,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:11:35,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:11:35,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:11:35,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:11:35,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:11:35,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:11:35,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:11:35,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:11:35,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:11:35,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:11:35,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:11:35,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:11:35,293 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:11:35,294 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:11:35,295 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b01_single_pca_UNSAFE.bpl [2019-08-05 10:11:35,295 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b01_single_pca_UNSAFE.bpl' [2019-08-05 10:11:35,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:11:35,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:11:35,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:11:35,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:11:35,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:11:35,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,394 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:11:35,394 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:11:35,394 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:11:35,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:11:35,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:11:35,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:11:35,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:11:35,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... [2019-08-05 10:11:35,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:11:35,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:11:35,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:11:35,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:11:35,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:11:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:11:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:11:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_x [2019-08-05 10:11:35,514 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:11:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:11:35,515 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:11:35,631 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:11:36,129 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:11:36,129 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:11:36,130 INFO L202 PluginConnector]: Adding new model u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:11:36 BoogieIcfgContainer [2019-08-05 10:11:36,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:11:36,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:11:36,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:11:36,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:11:36,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:11:35" (1/2) ... [2019-08-05 10:11:36,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453b0f43 and model type u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:11:36, skipping insertion in model container [2019-08-05 10:11:36,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:11:36" (2/2) ... [2019-08-05 10:11:36,139 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b01_single_pca_UNSAFE.bpl [2019-08-05 10:11:36,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:11:36,156 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:11:36,173 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:11:36,199 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:11:36,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:11:36,200 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:11:36,200 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:11:36,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:11:36,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:11:36,201 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:11:36,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:11:36,201 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:11:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-08-05 10:11:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:11:36,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:36,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:11:36,224 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2762, now seen corresponding path program 1 times [2019-08-05 10:11:36,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:36,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:36,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:36,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:36,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:11:36,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:36,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:36,377 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-08-05 10:11:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:36,413 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 10:11:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:36,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:11:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:36,426 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:11:36,426 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:11:36,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:11:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:11:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:11:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 10:11:36,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 2 [2019-08-05 10:11:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:36,464 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 10:11:36,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 10:11:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:11:36,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:36,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:11:36,466 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2714449, now seen corresponding path program 1 times [2019-08-05 10:11:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:36,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:36,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:36,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:11:36,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:36,536 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-08-05 10:11:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:36,636 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 10:11:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:36,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:11:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:36,637 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:11:36,637 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:11:36,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:11:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-08-05 10:11:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:11:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-08-05 10:11:36,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 4 [2019-08-05 10:11:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:36,643 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-08-05 10:11:36,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-08-05 10:11:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:11:36,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:36,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:11:36,644 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 84149744, now seen corresponding path program 1 times [2019-08-05 10:11:36,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:36,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:11:36,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:36,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:36,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:36,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:36,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:11:36,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:11:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:11:36,865 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 5 states. [2019-08-05 10:11:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:37,105 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-08-05 10:11:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:11:37,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:11:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:37,108 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:11:37,108 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:11:37,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:11:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:11:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:11:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:11:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-08-05 10:11:37,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2019-08-05 10:11:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:37,115 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-08-05 10:11:37,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:11:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-08-05 10:11:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:11:37,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:37,116 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:37,116 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1563109312, now seen corresponding path program 1 times [2019-08-05 10:11:37,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:37,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:11:37,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:37,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:37,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:37,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:11:37,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:37,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:37,370 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 7 states. [2019-08-05 10:11:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:37,692 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-08-05 10:11:37,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:37,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:11:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:37,695 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:11:37,695 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:11:37,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:11:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:11:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-08-05 10:11:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:11:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-08-05 10:11:37,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 10 [2019-08-05 10:11:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:37,702 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-08-05 10:11:37,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-08-05 10:11:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:11:37,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:37,704 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:37,704 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2023343670, now seen corresponding path program 1 times [2019-08-05 10:11:37,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:37,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:11:37,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:37,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,255 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:11:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:38,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:11:38,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:11:38,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:11:38,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:11:38,298 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 10 states. [2019-08-05 10:11:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:38,623 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-08-05 10:11:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:11:38,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:11:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:38,626 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:11:38,626 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:11:38,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:11:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-08-05 10:11:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:11:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-08-05 10:11:38,632 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2019-08-05 10:11:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:38,632 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-08-05 10:11:38,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:11:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-08-05 10:11:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:11:38,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:38,634 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:11:38,634 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -925172570, now seen corresponding path program 2 times [2019-08-05 10:11:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:38,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:11:38,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:38,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:38,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:38,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:11:38,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:11:38,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:11:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:38,939 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 12 states. [2019-08-05 10:11:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:39,424 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-08-05 10:11:39,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:11:39,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 10:11:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:39,428 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:11:39,428 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:11:39,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:11:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:11:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:11:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:11:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-08-05 10:11:39,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2019-08-05 10:11:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:39,437 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-08-05 10:11:39,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:11:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-08-05 10:11:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:11:39,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:39,438 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1] [2019-08-05 10:11:39,439 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1129875804, now seen corresponding path program 3 times [2019-08-05 10:11:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:39,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:11:39,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:39,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:39,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:39,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:11:39,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:11:39,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:11:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:11:39,727 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 15 states. [2019-08-05 10:11:40,244 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-08-05 10:11:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:40,496 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-08-05 10:11:40,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:11:40,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-08-05 10:11:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:40,500 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:11:40,500 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:11:40,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:11:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:11:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2019-08-05 10:11:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:11:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-08-05 10:11:40,507 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 29 [2019-08-05 10:11:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:40,507 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-08-05 10:11:40,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:11:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-08-05 10:11:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:11:40,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:40,509 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1] [2019-08-05 10:11:40,509 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1962952692, now seen corresponding path program 4 times [2019-08-05 10:11:40,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:40,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:11:40,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:40,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:40,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:40,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:41,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:41,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:11:41,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:11:41,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:11:41,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:11:41,038 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 17 states. [2019-08-05 10:11:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:41,494 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-08-05 10:11:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:11:41,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-05 10:11:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:41,495 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:11:41,495 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:11:41,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:11:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:11:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2019-08-05 10:11:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:11:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-08-05 10:11:41,502 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 34 [2019-08-05 10:11:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:41,502 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-08-05 10:11:41,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:11:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-08-05 10:11:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:11:41,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:41,504 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1] [2019-08-05 10:11:41,504 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash -377340802, now seen corresponding path program 5 times [2019-08-05 10:11:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:41,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:11:41,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:41,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:41,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:41,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:41,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:41,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:41,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:11:41,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:11:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:11:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:11:41,985 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 20 states. [2019-08-05 10:11:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:42,566 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-08-05 10:11:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:11:42,567 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-08-05 10:11:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:42,568 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:11:42,568 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:11:42,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=856, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:11:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:11:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2019-08-05 10:11:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:11:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-08-05 10:11:42,575 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 41 [2019-08-05 10:11:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:42,576 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-08-05 10:11:42,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:11:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-08-05 10:11:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:11:42,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:42,578 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 1, 1] [2019-08-05 10:11:42,578 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash -182941070, now seen corresponding path program 6 times [2019-08-05 10:11:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:42,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:11:42,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:42,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:42,931 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:11:43,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:43,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:43,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:11:43,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:11:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:11:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:11:43,244 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 22 states. [2019-08-05 10:11:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:44,531 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2019-08-05 10:11:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:11:44,532 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-08-05 10:11:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:44,533 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:11:44,533 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:11:44,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=1210, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:11:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:11:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-08-05 10:11:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:11:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2019-08-05 10:11:44,541 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 46 [2019-08-05 10:11:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:44,541 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2019-08-05 10:11:44,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:11:44,541 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2019-08-05 10:11:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:11:44,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:44,543 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1] [2019-08-05 10:11:44,543 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:44,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1896805544, now seen corresponding path program 7 times [2019-08-05 10:11:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:44,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:11:44,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:44,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:44,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:44,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:44,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:45,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:45,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:45,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:11:45,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:11:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:11:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:11:45,076 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 25 states. [2019-08-05 10:11:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:45,745 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-08-05 10:11:45,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:11:45,745 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2019-08-05 10:11:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:45,746 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:11:45,746 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:11:45,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=529, Invalid=1451, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:11:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:11:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2019-08-05 10:11:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:11:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-08-05 10:11:45,756 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 53 [2019-08-05 10:11:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:45,756 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-08-05 10:11:45,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:11:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-08-05 10:11:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:11:45,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:45,758 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 1, 1] [2019-08-05 10:11:45,758 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2126181336, now seen corresponding path program 8 times [2019-08-05 10:11:45,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:45,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:11:45,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:45,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:46,085 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:11:46,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:46,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:46,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:46,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:46,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:46,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:11:46,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:11:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:11:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:11:46,385 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 27 states. [2019-08-05 10:11:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:47,154 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-08-05 10:11:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:11:47,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-08-05 10:11:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:47,156 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:11:47,156 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:11:47,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=646, Invalid=1904, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:11:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:11:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2019-08-05 10:11:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:11:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2019-08-05 10:11:47,163 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 58 [2019-08-05 10:11:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:47,164 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2019-08-05 10:11:47,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:11:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2019-08-05 10:11:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:11:47,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:47,165 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 6, 5, 5, 5, 5, 1, 1] [2019-08-05 10:11:47,166 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:47,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash 170812210, now seen corresponding path program 9 times [2019-08-05 10:11:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:47,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:11:47,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:47,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:47,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:47,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:47,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:47,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:47,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:47,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:47,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:11:47,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:11:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:11:47,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:11:47,793 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 30 states. [2019-08-05 10:11:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:48,787 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-08-05 10:11:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:11:48,788 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-08-05 10:11:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:48,789 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:11:48,789 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:11:48,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=767, Invalid=2203, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:11:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:11:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2019-08-05 10:11:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:11:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-08-05 10:11:48,797 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 65 [2019-08-05 10:11:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:48,798 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-08-05 10:11:48,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:11:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2019-08-05 10:11:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:11:48,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:48,799 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 5, 5, 1, 1] [2019-08-05 10:11:48,800 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:48,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1799124030, now seen corresponding path program 10 times [2019-08-05 10:11:48,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:48,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:11:48,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:48,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:49,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:49,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:49,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:49,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:49,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:49,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:49,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:11:49,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:11:49,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:11:49,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:11:49,539 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 32 states. [2019-08-05 10:11:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:50,861 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2019-08-05 10:11:50,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:11:50,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-08-05 10:11:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:50,863 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:11:50,863 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:11:50,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=905, Invalid=2755, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:11:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:11:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2019-08-05 10:11:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:11:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2019-08-05 10:11:50,869 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 70 [2019-08-05 10:11:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:50,870 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-08-05 10:11:50,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:11:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2019-08-05 10:11:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:11:50,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:50,872 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 6, 6, 6, 6, 1, 1] [2019-08-05 10:11:50,872 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:50,872 INFO L82 PathProgramCache]: Analyzing trace with hash 884261900, now seen corresponding path program 11 times [2019-08-05 10:11:50,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:50,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:11:50,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:50,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:11:51,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:11:51,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:11:51,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:11:51,704 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 35 states. [2019-08-05 10:11:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:53,017 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-08-05 10:11:53,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:11:53,018 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2019-08-05 10:11:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:53,019 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:11:53,019 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:11:53,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1048, Invalid=3112, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:11:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:11:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2019-08-05 10:11:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:11:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2019-08-05 10:11:53,025 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 77 [2019-08-05 10:11:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:53,026 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-08-05 10:11:53,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:11:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2019-08-05 10:11:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:11:53,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:53,028 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 6, 6, 1, 1] [2019-08-05 10:11:53,028 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 699567012, now seen corresponding path program 12 times [2019-08-05 10:11:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:53,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:11:53,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:53,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:53,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:53,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:53,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:53,562 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:11:53,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:53,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:54,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:54,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:54,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:11:54,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:11:54,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:11:54,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:11:54,147 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 37 states. [2019-08-05 10:11:55,040 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-08-05 10:11:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:55,651 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2019-08-05 10:11:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:11:55,651 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 82 [2019-08-05 10:11:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:55,653 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:11:55,653 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:11:55,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1207, Invalid=3763, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:11:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:11:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 100. [2019-08-05 10:11:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:11:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2019-08-05 10:11:55,660 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 82 [2019-08-05 10:11:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:55,660 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2019-08-05 10:11:55,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:11:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2019-08-05 10:11:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:11:55,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:55,662 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 7, 7, 7, 7, 1, 1] [2019-08-05 10:11:55,662 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 71216614, now seen corresponding path program 13 times [2019-08-05 10:11:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:55,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:11:55,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:55,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:55,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:55,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:55,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:56,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:56,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:56,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:56,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:56,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:11:56,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:11:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:11:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:11:56,816 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 40 states. [2019-08-05 10:11:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:58,294 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-08-05 10:11:58,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:11:58,294 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 89 [2019-08-05 10:11:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:58,296 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:11:58,296 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:11:58,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:11:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:11:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2019-08-05 10:11:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:11:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-08-05 10:11:58,302 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 89 [2019-08-05 10:11:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:58,302 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-08-05 10:11:58,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:11:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-08-05 10:11:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:11:58,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:58,304 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 8, 8, 8, 8, 7, 7, 1, 1] [2019-08-05 10:11:58,304 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1259161078, now seen corresponding path program 14 times [2019-08-05 10:11:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:58,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:11:58,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:58,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:58,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:58,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:58,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:58,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:59,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:59,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:59,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:59,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:59,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:11:59,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:11:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:11:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1349, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:11:59,399 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 42 states. [2019-08-05 10:12:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:00,829 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2019-08-05 10:12:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:12:00,830 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 94 [2019-08-05 10:12:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:00,831 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:12:00,831 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:12:00,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1574, Invalid=5068, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:12:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:12:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2019-08-05 10:12:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:12:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2019-08-05 10:12:00,838 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 94 [2019-08-05 10:12:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:00,838 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2019-08-05 10:12:00,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:12:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2019-08-05 10:12:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:12:00,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:00,839 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 9, 9, 8, 8, 8, 8, 1, 1] [2019-08-05 10:12:00,839 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:00,840 INFO L82 PathProgramCache]: Analyzing trace with hash 717660352, now seen corresponding path program 15 times [2019-08-05 10:12:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:00,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:12:00,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:00,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:00,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:01,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:01,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:12:01,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:12:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:12:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=1550, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:12:01,812 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 45 states. [2019-08-05 10:12:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:03,336 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2019-08-05 10:12:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:12:03,339 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 101 [2019-08-05 10:12:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:03,340 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:12:03,340 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:12:03,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1762, Invalid=5548, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:12:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:12:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2019-08-05 10:12:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:12:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2019-08-05 10:12:03,345 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 101 [2019-08-05 10:12:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:03,346 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2019-08-05 10:12:03,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:12:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2019-08-05 10:12:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:12:03,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:03,347 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 8, 8, 1, 1] [2019-08-05 10:12:03,347 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash -208502928, now seen corresponding path program 16 times [2019-08-05 10:12:03,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:03,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:12:03,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:03,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:03,738 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:03,903 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:12:04,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:04,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:05,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:05,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:12:05,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:12:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:12:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1700, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:12:05,067 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 47 states. [2019-08-05 10:12:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:07,038 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2019-08-05 10:12:07,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:12:07,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 106 [2019-08-05 10:12:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:07,040 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:12:07,041 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:12:07,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2000, Invalid=6556, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:12:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:12:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 124. [2019-08-05 10:12:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:12:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2019-08-05 10:12:07,047 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 106 [2019-08-05 10:12:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:07,047 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2019-08-05 10:12:07,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:12:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2019-08-05 10:12:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:12:07,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:07,048 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 1, 1] [2019-08-05 10:12:07,048 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:07,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1232659302, now seen corresponding path program 17 times [2019-08-05 10:12:07,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:07,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:12:07,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:07,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:07,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:07,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:12:07,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:12:07,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:12:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1925, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:12:07,993 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand 50 states. [2019-08-05 10:12:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:10,044 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2019-08-05 10:12:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:12:10,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 113 [2019-08-05 10:12:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:10,047 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:12:10,047 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:12:10,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2211, Invalid=7101, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:12:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:12:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 130. [2019-08-05 10:12:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:12:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2019-08-05 10:12:10,052 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 113 [2019-08-05 10:12:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:10,053 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2019-08-05 10:12:10,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:12:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2019-08-05 10:12:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:12:10,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:10,054 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 10, 10, 10, 9, 9, 1, 1] [2019-08-05 10:12:10,054 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:10,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:10,055 INFO L82 PathProgramCache]: Analyzing trace with hash 401038294, now seen corresponding path program 18 times [2019-08-05 10:12:10,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:10,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:12:10,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:10,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:10,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 0 proven. 993 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:11,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:11,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:12:11,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:12:11,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:12:11,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2091, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:12:11,089 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 52 states. [2019-08-05 10:12:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:13,147 INFO L93 Difference]: Finished difference Result 187 states and 211 transitions. [2019-08-05 10:12:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:12:13,148 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 118 [2019-08-05 10:12:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:13,149 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:12:13,149 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:12:13,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2485, Invalid=8227, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:12:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:12:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 136. [2019-08-05 10:12:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:12:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2019-08-05 10:12:13,155 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 118 [2019-08-05 10:12:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:13,156 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2019-08-05 10:12:13,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:12:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2019-08-05 10:12:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:12:13,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:13,158 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 11, 10, 10, 10, 10, 1, 1] [2019-08-05 10:12:13,158 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1308974732, now seen corresponding path program 19 times [2019-08-05 10:12:13,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:13,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:12:13,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:13,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:13,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:14,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 0 proven. 1110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:15,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:15,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:12:15,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:12:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:12:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2340, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:12:15,084 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 55 states. [2019-08-05 10:12:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:17,242 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2019-08-05 10:12:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:12:17,243 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 125 [2019-08-05 10:12:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:17,244 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:12:17,245 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 10:12:17,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3600 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2719, Invalid=8837, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:12:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 10:12:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 142. [2019-08-05 10:12:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:12:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2019-08-05 10:12:17,250 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 125 [2019-08-05 10:12:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:17,250 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2019-08-05 10:12:17,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:12:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2019-08-05 10:12:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:12:17,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:17,251 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 11, 11, 11, 11, 10, 10, 1, 1] [2019-08-05 10:12:17,251 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash 446268, now seen corresponding path program 20 times [2019-08-05 10:12:17,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:17,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:12:17,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:17,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:17,633 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:17,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:17,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:17,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:17,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:17,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:18,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:18,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:18,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:18,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:18,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 0 proven. 1213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:18,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:18,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:12:18,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:12:18,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:12:18,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=2522, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:12:18,677 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 57 states. [2019-08-05 10:12:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:21,192 INFO L93 Difference]: Finished difference Result 204 states and 230 transitions. [2019-08-05 10:12:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:12:21,192 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 130 [2019-08-05 10:12:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:21,194 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:12:21,194 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:12:21,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4131 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3029, Invalid=10081, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:12:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:12:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2019-08-05 10:12:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:12:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2019-08-05 10:12:21,200 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 130 [2019-08-05 10:12:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:21,201 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2019-08-05 10:12:21,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:12:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2019-08-05 10:12:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:12:21,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:21,202 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 12, 12, 11, 11, 11, 11, 1, 1] [2019-08-05 10:12:21,202 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1009012914, now seen corresponding path program 21 times [2019-08-05 10:12:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:21,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:12:21,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:21,403 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:12:21,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,592 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:21,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:21,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1342 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:22,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:22,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:12:22,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:12:22,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:12:22,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=2795, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:12:22,704 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand 60 states. [2019-08-05 10:12:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:25,546 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2019-08-05 10:12:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:12:25,547 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 137 [2019-08-05 10:12:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:25,548 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:12:25,549 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:12:25,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4427 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3286, Invalid=10756, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:12:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:12:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 154. [2019-08-05 10:12:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:12:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2019-08-05 10:12:25,555 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 137 [2019-08-05 10:12:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:25,555 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2019-08-05 10:12:25,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:12:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2019-08-05 10:12:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 10:12:25,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:25,556 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 12, 12, 12, 12, 11, 11, 1, 1] [2019-08-05 10:12:25,557 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1782163038, now seen corresponding path program 22 times [2019-08-05 10:12:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:25,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:12:25,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:25,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:27,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 1455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:27,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:27,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:12:27,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:12:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:12:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=2993, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:12:27,272 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand 62 states. [2019-08-05 10:12:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:30,293 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2019-08-05 10:12:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:12:30,293 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 142 [2019-08-05 10:12:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:30,295 INFO L225 Difference]: With dead ends: 221 [2019-08-05 10:12:30,295 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:12:30,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5018 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3632, Invalid=12118, Unknown=0, NotChecked=0, Total=15750 [2019-08-05 10:12:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:12:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 160. [2019-08-05 10:12:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:12:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 188 transitions. [2019-08-05 10:12:30,301 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 188 transitions. Word has length 142 [2019-08-05 10:12:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:30,301 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 188 transitions. [2019-08-05 10:12:30,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:12:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 188 transitions. [2019-08-05 10:12:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:12:30,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:30,303 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 13, 13, 12, 12, 12, 12, 1, 1] [2019-08-05 10:12:30,303 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash -819673560, now seen corresponding path program 23 times [2019-08-05 10:12:30,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:30,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:12:30,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:30,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:30,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:30,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:30,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:30,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:30,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:30,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:31,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:31,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:12:31,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:12:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:12:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=3290, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:12:31,951 INFO L87 Difference]: Start difference. First operand 160 states and 188 transitions. Second operand 65 states. [2019-08-05 10:12:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:35,315 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2019-08-05 10:12:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:12:35,315 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 149 [2019-08-05 10:12:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:35,317 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:12:35,317 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 10:12:35,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5343 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3912, Invalid=12858, Unknown=0, NotChecked=0, Total=16770 [2019-08-05 10:12:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 10:12:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 166. [2019-08-05 10:12:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:12:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 194 transitions. [2019-08-05 10:12:35,323 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 194 transitions. Word has length 149 [2019-08-05 10:12:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:35,323 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 194 transitions. [2019-08-05 10:12:35,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:12:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 194 transitions. [2019-08-05 10:12:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:12:35,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:35,324 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 13, 13, 13, 13, 12, 12, 1, 1] [2019-08-05 10:12:35,324 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 784038664, now seen corresponding path program 24 times [2019-08-05 10:12:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:35,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:12:35,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:35,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 0 proven. 1719 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:36,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:36,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:12:36,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:12:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:12:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=918, Invalid=3504, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:12:36,843 INFO L87 Difference]: Start difference. First operand 166 states and 194 transitions. Second operand 67 states. [2019-08-05 10:12:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,299 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2019-08-05 10:12:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:12:40,300 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 154 [2019-08-05 10:12:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,302 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:12:40,302 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 10:12:40,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5994 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4294, Invalid=14338, Unknown=0, NotChecked=0, Total=18632 [2019-08-05 10:12:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 10:12:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 172. [2019-08-05 10:12:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:12:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2019-08-05 10:12:40,307 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 154 [2019-08-05 10:12:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,308 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2019-08-05 10:12:40,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:12:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2019-08-05 10:12:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:12:40,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,309 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 14, 14, 13, 13, 13, 13, 1, 1] [2019-08-05 10:12:40,309 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1827641854, now seen corresponding path program 25 times [2019-08-05 10:12:40,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,722 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:41,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 0 proven. 1872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:42,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:42,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:12:42,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:12:42,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:12:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=3825, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:12:42,894 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand 70 states. [2019-08-05 10:12:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:46,274 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2019-08-05 10:12:46,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:12:46,275 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 161 [2019-08-05 10:12:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:46,277 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:12:46,277 INFO L226 Difference]: Without dead ends: 243 [2019-08-05 10:12:46,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6348 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4597, Invalid=15143, Unknown=0, NotChecked=0, Total=19740 [2019-08-05 10:12:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-08-05 10:12:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 178. [2019-08-05 10:12:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:12:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 208 transitions. [2019-08-05 10:12:46,284 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 208 transitions. Word has length 161 [2019-08-05 10:12:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:46,284 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 208 transitions. [2019-08-05 10:12:46,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:12:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 208 transitions. [2019-08-05 10:12:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:12:46,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:46,285 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 14, 14, 14, 14, 13, 13, 1, 1] [2019-08-05 10:12:46,285 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:46,286 INFO L82 PathProgramCache]: Analyzing trace with hash -331631762, now seen corresponding path program 26 times [2019-08-05 10:12:46,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:46,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:12:46,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:46,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,723 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:46,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 0 proven. 2005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:48,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:48,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:12:48,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:12:48,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:12:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=4055, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:12:48,216 INFO L87 Difference]: Start difference. First operand 178 states and 208 transitions. Second operand 72 states. [2019-08-05 10:12:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:52,000 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2019-08-05 10:12:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:12:52,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 166 [2019-08-05 10:12:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:52,003 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:12:52,003 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:12:52,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7059 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5015, Invalid=16741, Unknown=0, NotChecked=0, Total=21756 [2019-08-05 10:12:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:12:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 184. [2019-08-05 10:12:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:12:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 216 transitions. [2019-08-05 10:12:52,009 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 216 transitions. Word has length 166 [2019-08-05 10:12:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:52,009 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 216 transitions. [2019-08-05 10:12:52,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:12:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 216 transitions. [2019-08-05 10:12:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:12:52,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:52,010 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 1, 1] [2019-08-05 10:12:52,011 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1259933404, now seen corresponding path program 27 times [2019-08-05 10:12:52,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:52,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:12:52,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:52,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2170 backedges. 0 proven. 2170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:53,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:53,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:12:53,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:12:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:12:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=4400, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:12:53,839 INFO L87 Difference]: Start difference. First operand 184 states and 216 transitions. Second operand 75 states. [2019-08-05 10:12:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:57,802 INFO L93 Difference]: Finished difference Result 260 states and 292 transitions. [2019-08-05 10:12:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:12:57,802 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 173 [2019-08-05 10:12:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:57,805 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:12:57,805 INFO L226 Difference]: Without dead ends: 260 [2019-08-05 10:12:57,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7442 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5341, Invalid=17611, Unknown=0, NotChecked=0, Total=22952 [2019-08-05 10:12:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-05 10:12:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 190. [2019-08-05 10:12:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:12:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 222 transitions. [2019-08-05 10:12:57,811 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 222 transitions. Word has length 173 [2019-08-05 10:12:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,811 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 222 transitions. [2019-08-05 10:12:57,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:12:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 222 transitions. [2019-08-05 10:12:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:12:57,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,813 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 15, 15, 15, 15, 14, 14, 1, 1] [2019-08-05 10:12:57,813 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash 459047636, now seen corresponding path program 28 times [2019-08-05 10:12:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,573 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2313 backedges. 0 proven. 2313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:59,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:12:59,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:12:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:12:59,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=4646, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:12:59,771 INFO L87 Difference]: Start difference. First operand 190 states and 222 transitions. Second operand 77 states. [2019-08-05 10:13:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:04,309 INFO L93 Difference]: Finished difference Result 272 states and 306 transitions. [2019-08-05 10:13:04,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-08-05 10:13:04,310 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 178 [2019-08-05 10:13:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:04,312 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:13:04,312 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:13:04,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8213 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5795, Invalid=19327, Unknown=0, NotChecked=0, Total=25122 [2019-08-05 10:13:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:13:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 196. [2019-08-05 10:13:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:13:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2019-08-05 10:13:04,317 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 178 [2019-08-05 10:13:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:04,317 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2019-08-05 10:13:04,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:13:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2019-08-05 10:13:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 10:13:04,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:04,319 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 16, 16, 15, 15, 15, 15, 1, 1] [2019-08-05 10:13:04,319 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1324957878, now seen corresponding path program 29 times [2019-08-05 10:13:04,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:04,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:13:04,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:04,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2490 backedges. 0 proven. 2490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:13:06,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:13:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:13:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1305, Invalid=5015, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:13:06,726 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand 80 states. [2019-08-05 10:13:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:11,280 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2019-08-05 10:13:11,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-08-05 10:13:11,280 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 185 [2019-08-05 10:13:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:11,283 INFO L225 Difference]: With dead ends: 277 [2019-08-05 10:13:11,283 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 10:13:11,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8625 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6144, Invalid=20262, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:13:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 10:13:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 202. [2019-08-05 10:13:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:13:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 236 transitions. [2019-08-05 10:13:11,289 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 236 transitions. Word has length 185 [2019-08-05 10:13:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:11,289 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 236 transitions. [2019-08-05 10:13:11,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:13:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 236 transitions. [2019-08-05 10:13:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-05 10:13:11,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:11,290 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 16, 16, 16, 16, 15, 15, 1, 1] [2019-08-05 10:13:11,291 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1795987142, now seen corresponding path program 30 times [2019-08-05 10:13:11,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:11,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:13:11,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2643 backedges. 0 proven. 2643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:13,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:13,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:13:13,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:13:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:13:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1365, Invalid=5277, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:13:13,367 INFO L87 Difference]: Start difference. First operand 202 states and 236 transitions. Second operand 82 states. [2019-08-05 10:13:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:18,312 INFO L93 Difference]: Finished difference Result 289 states and 325 transitions. [2019-08-05 10:13:18,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-08-05 10:13:18,313 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 190 [2019-08-05 10:13:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:18,315 INFO L225 Difference]: With dead ends: 289 [2019-08-05 10:13:18,315 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 10:13:18,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6634, Invalid=22096, Unknown=0, NotChecked=0, Total=28730 [2019-08-05 10:13:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 10:13:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 208. [2019-08-05 10:13:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 10:13:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 244 transitions. [2019-08-05 10:13:18,320 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 244 transitions. Word has length 190 [2019-08-05 10:13:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:18,320 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 244 transitions. [2019-08-05 10:13:18,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:13:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 244 transitions. [2019-08-05 10:13:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 10:13:18,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:18,322 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 17, 17, 16, 16, 16, 16, 1, 1] [2019-08-05 10:13:18,322 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1297384560, now seen corresponding path program 31 times [2019-08-05 10:13:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:18,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:13:18,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:18,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 0 proven. 2832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:20,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:20,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:13:20,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:13:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:13:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1470, Invalid=5670, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:13:20,567 INFO L87 Difference]: Start difference. First operand 208 states and 244 transitions. Second operand 85 states. [2019-08-05 10:13:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,664 INFO L93 Difference]: Finished difference Result 294 states and 330 transitions. [2019-08-05 10:13:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-08-05 10:13:25,664 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 197 [2019-08-05 10:13:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,666 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:13:25,666 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:13:25,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9897 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7006, Invalid=23096, Unknown=0, NotChecked=0, Total=30102 [2019-08-05 10:13:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:13:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 214. [2019-08-05 10:13:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 10:13:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2019-08-05 10:13:25,673 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 197 [2019-08-05 10:13:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,673 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2019-08-05 10:13:25,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:13:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2019-08-05 10:13:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-05 10:13:25,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,674 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 17, 17, 17, 17, 16, 16, 1, 1] [2019-08-05 10:13:25,675 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash 496363168, now seen corresponding path program 32 times [2019-08-05 10:13:25,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,824 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:13:28,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2995 backedges. 0 proven. 2995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:31,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:31,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:13:31,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:13:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:13:31,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1534, Invalid=5948, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:13:31,395 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand 87 states. [2019-08-05 10:13:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:36,835 INFO L93 Difference]: Finished difference Result 306 states and 344 transitions. [2019-08-05 10:13:36,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-08-05 10:13:36,836 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 202 [2019-08-05 10:13:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:36,838 INFO L225 Difference]: With dead ends: 306 [2019-08-05 10:13:36,838 INFO L226 Difference]: Without dead ends: 306 [2019-08-05 10:13:36,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10788 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=7532, Invalid=25048, Unknown=0, NotChecked=0, Total=32580 [2019-08-05 10:13:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-08-05 10:13:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 220. [2019-08-05 10:13:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:13:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2019-08-05 10:13:36,844 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 202 [2019-08-05 10:13:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:36,844 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2019-08-05 10:13:36,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:13:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2019-08-05 10:13:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 10:13:36,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:36,845 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 18, 18, 17, 17, 17, 17, 1, 1] [2019-08-05 10:13:36,845 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash -429244566, now seen corresponding path program 33 times [2019-08-05 10:13:36,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:36,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:13:36,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:37,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:39,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:39,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 0 proven. 3196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:39,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:39,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:13:39,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:13:39,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:13:39,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1645, Invalid=6365, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:13:39,393 INFO L87 Difference]: Start difference. First operand 220 states and 258 transitions. Second operand 90 states. [2019-08-05 10:13:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:44,968 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2019-08-05 10:13:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-08-05 10:13:44,968 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 209 [2019-08-05 10:13:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:44,970 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:13:44,971 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 10:13:44,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11258 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7927, Invalid=26113, Unknown=0, NotChecked=0, Total=34040 [2019-08-05 10:13:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 10:13:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 226. [2019-08-05 10:13:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-08-05 10:13:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 264 transitions. [2019-08-05 10:13:44,977 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 264 transitions. Word has length 209 [2019-08-05 10:13:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:44,977 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 264 transitions. [2019-08-05 10:13:44,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:13:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 264 transitions. [2019-08-05 10:13:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-05 10:13:44,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:44,979 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 18, 18, 18, 18, 17, 17, 1, 1] [2019-08-05 10:13:44,979 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash -979797242, now seen corresponding path program 34 times [2019-08-05 10:13:44,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:45,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:13:45,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:45,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,478 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:45,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3369 backedges. 0 proven. 3369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:13:48,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:13:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:13:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=6659, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:13:48,320 INFO L87 Difference]: Start difference. First operand 226 states and 264 transitions. Second operand 92 states. [2019-08-05 10:13:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:54,877 INFO L93 Difference]: Finished difference Result 323 states and 363 transitions. [2019-08-05 10:13:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-08-05 10:13:54,878 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 214 [2019-08-05 10:13:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:54,880 INFO L225 Difference]: With dead ends: 323 [2019-08-05 10:13:54,880 INFO L226 Difference]: Without dead ends: 323 [2019-08-05 10:13:54,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12209 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=8489, Invalid=28183, Unknown=0, NotChecked=0, Total=36672 [2019-08-05 10:13:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-08-05 10:13:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 232. [2019-08-05 10:13:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-08-05 10:13:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-08-05 10:13:54,887 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 214 [2019-08-05 10:13:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:54,887 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-08-05 10:13:54,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:13:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-08-05 10:13:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 10:13:54,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:54,889 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 19, 19, 18, 18, 18, 18, 1, 1] [2019-08-05 10:13:54,889 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1454378052, now seen corresponding path program 35 times [2019-08-05 10:13:54,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:55,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3582 backedges. 0 proven. 3582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:13:58,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:13:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:13:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=7100, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:13:58,022 INFO L87 Difference]: Start difference. First operand 232 states and 272 transitions. Second operand 95 states. [2019-08-05 10:14:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:04,122 INFO L93 Difference]: Finished difference Result 328 states and 368 transitions. [2019-08-05 10:14:04,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-08-05 10:14:04,122 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 221 [2019-08-05 10:14:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:04,124 INFO L225 Difference]: With dead ends: 328 [2019-08-05 10:14:04,125 INFO L226 Difference]: Without dead ends: 328 [2019-08-05 10:14:04,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12708 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=8907, Invalid=29313, Unknown=0, NotChecked=0, Total=38220 [2019-08-05 10:14:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-08-05 10:14:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 238. [2019-08-05 10:14:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 10:14:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 278 transitions. [2019-08-05 10:14:04,130 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 278 transitions. Word has length 221 [2019-08-05 10:14:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:04,131 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 278 transitions. [2019-08-05 10:14:04,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:14:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 278 transitions. [2019-08-05 10:14:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-05 10:14:04,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:04,133 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 19, 19, 19, 19, 18, 18, 1, 1] [2019-08-05 10:14:04,133 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:04,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1226024556, now seen corresponding path program 36 times [2019-08-05 10:14:04,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:04,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:14:04,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:04,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,670 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:04,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3765 backedges. 0 proven. 3765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:07,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:07,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:14:07,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:14:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:14:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1902, Invalid=7410, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:14:07,862 INFO L87 Difference]: Start difference. First operand 238 states and 278 transitions. Second operand 97 states. [2019-08-05 10:14:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:14,547 INFO L93 Difference]: Finished difference Result 340 states and 382 transitions. [2019-08-05 10:14:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-08-05 10:14:14,548 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 226 [2019-08-05 10:14:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:14,550 INFO L225 Difference]: With dead ends: 340 [2019-08-05 10:14:14,550 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 10:14:14,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13719 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=9505, Invalid=31501, Unknown=0, NotChecked=0, Total=41006 [2019-08-05 10:14:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 10:14:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 244. [2019-08-05 10:14:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:14:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2019-08-05 10:14:14,556 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 226 [2019-08-05 10:14:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:14,556 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2019-08-05 10:14:14,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:14:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2019-08-05 10:14:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-08-05 10:14:14,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:14,558 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 20, 20, 19, 19, 19, 19, 1, 1] [2019-08-05 10:14:14,558 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash 204956190, now seen corresponding path program 37 times [2019-08-05 10:14:14,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:14,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:14:14,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:14,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3990 backedges. 0 proven. 3990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:17,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:17,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:14:17,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:14:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:14:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2025, Invalid=7875, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:14:17,929 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand 100 states. [2019-08-05 10:14:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:24,544 INFO L93 Difference]: Finished difference Result 345 states and 387 transitions. [2019-08-05 10:14:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-08-05 10:14:24,544 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 233 [2019-08-05 10:14:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:24,547 INFO L225 Difference]: With dead ends: 345 [2019-08-05 10:14:24,547 INFO L226 Difference]: Without dead ends: 345 [2019-08-05 10:14:24,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14247 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=9946, Invalid=32696, Unknown=0, NotChecked=0, Total=42642 [2019-08-05 10:14:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-08-05 10:14:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 250. [2019-08-05 10:14:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-08-05 10:14:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 292 transitions. [2019-08-05 10:14:24,552 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 292 transitions. Word has length 233 [2019-08-05 10:14:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:24,553 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 292 transitions. [2019-08-05 10:14:24,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:14:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 292 transitions. [2019-08-05 10:14:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-05 10:14:24,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:24,554 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 20, 20, 20, 20, 19, 19, 1, 1] [2019-08-05 10:14:24,554 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1876551890, now seen corresponding path program 38 times [2019-08-05 10:14:24,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:24,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:14:24,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:24,905 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:14:24,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:26,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:26,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:26,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:26,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4183 backedges. 0 proven. 4183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:28,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:28,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:14:28,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:14:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:14:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2101, Invalid=8201, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:14:28,246 INFO L87 Difference]: Start difference. First operand 250 states and 292 transitions. Second operand 102 states. [2019-08-05 10:14:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:35,348 INFO L93 Difference]: Finished difference Result 355 states and 398 transitions. [2019-08-05 10:14:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-08-05 10:14:35,348 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 238 [2019-08-05 10:14:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:35,350 INFO L225 Difference]: With dead ends: 355 [2019-08-05 10:14:35,350 INFO L226 Difference]: Without dead ends: 355 [2019-08-05 10:14:35,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15318 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=10580, Invalid=35002, Unknown=0, NotChecked=0, Total=45582 [2019-08-05 10:14:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-08-05 10:14:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 253. [2019-08-05 10:14:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:14:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 296 transitions. [2019-08-05 10:14:35,357 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 296 transitions. Word has length 238 [2019-08-05 10:14:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:35,357 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 296 transitions. [2019-08-05 10:14:35,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:14:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 296 transitions. [2019-08-05 10:14:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-08-05 10:14:35,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:35,359 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 21, 21, 20, 20, 20, 20, 1, 1] [2019-08-05 10:14:35,359 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:35,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1274724600, now seen corresponding path program 39 times [2019-08-05 10:14:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:14:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:14:36,438 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:14:36,572 INFO L202 PluginConnector]: Adding new model u2b01_single_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:14:36 BoogieIcfgContainer [2019-08-05 10:14:36,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:14:36,574 INFO L168 Benchmark]: Toolchain (without parser) took 181218.80 ms. Allocated memory was 141.6 MB in the beginning and 594.5 MB in the end (delta: 453.0 MB). Free memory was 109.4 MB in the beginning and 247.4 MB in the end (delta: -138.0 MB). Peak memory consumption was 508.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:36,575 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:14:36,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.73 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 107.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:36,576 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 141.6 MB. Free memory was 107.6 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:36,577 INFO L168 Benchmark]: RCFGBuilder took 693.63 ms. Allocated memory is still 141.6 MB. Free memory was 106.3 MB in the beginning and 89.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:36,577 INFO L168 Benchmark]: TraceAbstraction took 180440.62 ms. Allocated memory was 141.6 MB in the beginning and 594.5 MB in the end (delta: 453.0 MB). Free memory was 89.6 MB in the beginning and 247.4 MB in the end (delta: -157.8 MB). Peak memory consumption was 488.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:14:36,580 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.73 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 107.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 141.6 MB. Free memory was 107.6 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 693.63 ms. Allocated memory is still 141.6 MB. Free memory was 106.3 MB in the beginning and 89.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180440.62 ms. Allocated memory was 141.6 MB in the beginning and 594.5 MB in the end (delta: 453.0 MB). Free memory was 89.6 MB in the beginning and 247.4 MB in the end (delta: -157.8 MB). Peak memory consumption was 488.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 113]: assertion can be violated assertion can be violated We found a FailurePath: [L67-L69] requires time == 0.0; [L67-L70] requires x == 0.0; [L67-L71] requires time$new == time; [L67-L72] requires x$new == x; [L67-L73] requires !time$reset; [L67-L74] requires !x$reset; [L77] sync := sync_none; [L78] loc$Template_1 := id1_1; [L79] Template_1$power := 0.0; VAL [Template_1$power=0.0, time=0.0, time$new=0.0, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=50.0, time=10.0, time$new=10.0, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=50.0, time=10.0, time$new=10.0, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=50.0, time=10.0, time$new=10.0, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=50.0, time=10.0, time$new=10.0, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=50.0, time=10.0, time$new=10.0, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=50.0, time=10.0, time$new=10.0, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1083/1103, Template_1$power=163450/1103, time=12113/1103, time$new=12113/1103, time$reset=false, x=12113/1103, x$new=12113/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1083/1103, Template_1$power=163450/1103, time=12113/1103, time$new=12113/1103, time$reset=false, x=12113/1103, x$new=12113/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1083/1103, Template_1$power=163450/1103, time=12113/1103, time$new=12113/1103, time$reset=false, x=12113/1103, x$new=12113/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1083/1103, Template_1$power=163450/1103, time=12113/1103, time$new=12113/1103, time$reset=false, x=12113/1103, x$new=12113/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1083/1103, Template_1$power=163450/1103, time=12113/1103, time$new=12113/1103, time$reset=false, x=12113/1103, x$new=12113/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1083/1103, Template_1$power=163450/1103, time=12113/1103, time$new=12113/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=218600/1103, time=23143/1103, time$new=23143/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=218600/1103, time=23143/1103, time$new=23143/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=218600/1103, time=23143/1103, time$new=23143/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=218600/1103, time=23143/1103, time$new=23143/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=218600/1103, time=23143/1103, time$new=23143/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=218600/1103, time=23143/1103, time$new=23143/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1082/1103, Template_1$power=326800/1103, time=24225/1103, time$new=24225/1103, time$reset=false, x=12112/1103, x$new=12112/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1082/1103, Template_1$power=326800/1103, time=24225/1103, time$new=24225/1103, time$reset=false, x=12112/1103, x$new=12112/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1082/1103, Template_1$power=326800/1103, time=24225/1103, time$new=24225/1103, time$reset=false, x=12112/1103, x$new=12112/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1082/1103, Template_1$power=326800/1103, time=24225/1103, time$new=24225/1103, time$reset=false, x=12112/1103, x$new=12112/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1082/1103, Template_1$power=326800/1103, time=24225/1103, time$new=24225/1103, time$reset=false, x=12112/1103, x$new=12112/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1082/1103, Template_1$power=326800/1103, time=24225/1103, time$new=24225/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=381950/1103, time=35255/1103, time$new=35255/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=381950/1103, time=35255/1103, time$new=35255/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=381950/1103, time=35255/1103, time$new=35255/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=381950/1103, time=35255/1103, time$new=35255/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=381950/1103, time=35255/1103, time$new=35255/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=381950/1103, time=35255/1103, time$new=35255/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1081/1103, Template_1$power=490050/1103, time=36336/1103, time$new=36336/1103, time$reset=false, x=12111/1103, x$new=12111/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1081/1103, Template_1$power=490050/1103, time=36336/1103, time$new=36336/1103, time$reset=false, x=12111/1103, x$new=12111/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1081/1103, Template_1$power=490050/1103, time=36336/1103, time$new=36336/1103, time$reset=false, x=12111/1103, x$new=12111/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1081/1103, Template_1$power=490050/1103, time=36336/1103, time$new=36336/1103, time$reset=false, x=12111/1103, x$new=12111/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1081/1103, Template_1$power=490050/1103, time=36336/1103, time$new=36336/1103, time$reset=false, x=12111/1103, x$new=12111/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1081/1103, Template_1$power=490050/1103, time=36336/1103, time$new=36336/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=545200/1103, time=47366/1103, time$new=47366/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=545200/1103, time=47366/1103, time$new=47366/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=545200/1103, time=47366/1103, time$new=47366/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=545200/1103, time=47366/1103, time$new=47366/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=545200/1103, time=47366/1103, time$new=47366/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=545200/1103, time=47366/1103, time$new=47366/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1080/1103, Template_1$power=653200/1103, time=48446/1103, time$new=48446/1103, time$reset=false, x=12110/1103, x$new=12110/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1080/1103, Template_1$power=653200/1103, time=48446/1103, time$new=48446/1103, time$reset=false, x=12110/1103, x$new=12110/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1080/1103, Template_1$power=653200/1103, time=48446/1103, time$new=48446/1103, time$reset=false, x=12110/1103, x$new=12110/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1080/1103, Template_1$power=653200/1103, time=48446/1103, time$new=48446/1103, time$reset=false, x=12110/1103, x$new=12110/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1080/1103, Template_1$power=653200/1103, time=48446/1103, time$new=48446/1103, time$reset=false, x=12110/1103, x$new=12110/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1080/1103, Template_1$power=653200/1103, time=48446/1103, time$new=48446/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=708350/1103, time=59476/1103, time$new=59476/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=708350/1103, time=59476/1103, time$new=59476/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=708350/1103, time=59476/1103, time$new=59476/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=708350/1103, time=59476/1103, time$new=59476/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=708350/1103, time=59476/1103, time$new=59476/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=708350/1103, time=59476/1103, time$new=59476/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1079/1103, Template_1$power=816250/1103, time=60555/1103, time$new=60555/1103, time$reset=false, x=12109/1103, x$new=12109/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1079/1103, Template_1$power=816250/1103, time=60555/1103, time$new=60555/1103, time$reset=false, x=12109/1103, x$new=12109/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1079/1103, Template_1$power=816250/1103, time=60555/1103, time$new=60555/1103, time$reset=false, x=12109/1103, x$new=12109/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1079/1103, Template_1$power=816250/1103, time=60555/1103, time$new=60555/1103, time$reset=false, x=12109/1103, x$new=12109/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1079/1103, Template_1$power=816250/1103, time=60555/1103, time$new=60555/1103, time$reset=false, x=12109/1103, x$new=12109/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1079/1103, Template_1$power=816250/1103, time=60555/1103, time$new=60555/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=871400/1103, time=71585/1103, time$new=71585/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=871400/1103, time=71585/1103, time$new=71585/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=871400/1103, time=71585/1103, time$new=71585/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=871400/1103, time=71585/1103, time$new=71585/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=871400/1103, time=71585/1103, time$new=71585/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=871400/1103, time=71585/1103, time$new=71585/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1078/1103, Template_1$power=979200/1103, time=72663/1103, time$new=72663/1103, time$reset=false, x=12108/1103, x$new=12108/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1078/1103, Template_1$power=979200/1103, time=72663/1103, time$new=72663/1103, time$reset=false, x=12108/1103, x$new=12108/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1078/1103, Template_1$power=979200/1103, time=72663/1103, time$new=72663/1103, time$reset=false, x=12108/1103, x$new=12108/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1078/1103, Template_1$power=979200/1103, time=72663/1103, time$new=72663/1103, time$reset=false, x=12108/1103, x$new=12108/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1078/1103, Template_1$power=979200/1103, time=72663/1103, time$new=72663/1103, time$reset=false, x=12108/1103, x$new=12108/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1078/1103, Template_1$power=979200/1103, time=72663/1103, time$new=72663/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=1034350/1103, time=83693/1103, time$new=83693/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=1034350/1103, time=83693/1103, time$new=83693/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=1034350/1103, time=83693/1103, time$new=83693/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=1034350/1103, time=83693/1103, time$new=83693/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=1034350/1103, time=83693/1103, time$new=83693/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=1034350/1103, time=83693/1103, time$new=83693/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1077/1103, Template_1$power=1142050/1103, time=84770/1103, time$new=84770/1103, time$reset=false, x=12107/1103, x$new=12107/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1077/1103, Template_1$power=1142050/1103, time=84770/1103, time$new=84770/1103, time$reset=false, x=12107/1103, x$new=12107/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1077/1103, Template_1$power=1142050/1103, time=84770/1103, time$new=84770/1103, time$reset=false, x=12107/1103, x$new=12107/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1077/1103, Template_1$power=1142050/1103, time=84770/1103, time$new=84770/1103, time$reset=false, x=12107/1103, x$new=12107/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1077/1103, Template_1$power=1142050/1103, time=84770/1103, time$new=84770/1103, time$reset=false, x=12107/1103, x$new=12107/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1077/1103, Template_1$power=1142050/1103, time=84770/1103, time$new=84770/1103, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=1197200/1103, time=95800/1103, time$new=95800/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=1197200/1103, time=95800/1103, time$new=95800/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=1197200/1103, time=95800/1103, time$new=95800/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=1197200/1103, time=95800/1103, time$new=95800/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=1197200/1103, time=95800/1103, time$new=95800/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=1197200/1103, time=95800/1103, time$new=95800/1103, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=110263/110300, Template_1$power=1307463/1103, time=9690263/110300, time$new=9690263/110300, time$reset=false, x=1213263/110300, x$new=1213263/110300, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=110263/110300, Template_1$power=1307463/1103, time=9690263/110300, time$new=9690263/110300, time$reset=false, x=1213263/110300, x$new=1213263/110300, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=110263/110300, Template_1$power=1307463/1103, time=9690263/110300, time$new=9690263/110300, time$reset=false, x=1213263/110300, x$new=1213263/110300, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=110263/110300, Template_1$power=1307463/1103, time=9690263/110300, time$new=9690263/110300, time$reset=false, x=1213263/110300, x$new=1213263/110300, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=110263/110300, Template_1$power=1307463/1103, time=9690263/110300, time$new=9690263/110300, time$reset=false, x=1213263/110300, x$new=1213263/110300, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=110263/110300, Template_1$power=1307463/1103, time=9690263/110300, time$new=9690263/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=1362613/1103, time=10793263/110300, time$new=10793263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=1362613/1103, time=10793263/110300, time$new=10793263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=1362613/1103, time=10793263/110300, time$new=10793263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=1362613/1103, time=10793263/110300, time$new=10793263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=1362613/1103, time=10793263/110300, time$new=10793263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=1362613/1103, time=10793263/110300, time$new=10793263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1076/1103, Template_1$power=1470213/1103, time=10900863/110300, time$new=10900863/110300, time$reset=false, x=12106/1103, x$new=12106/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1076/1103, Template_1$power=1470213/1103, time=10900863/110300, time$new=10900863/110300, time$reset=false, x=12106/1103, x$new=12106/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1076/1103, Template_1$power=1470213/1103, time=10900863/110300, time$new=10900863/110300, time$reset=false, x=12106/1103, x$new=12106/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1076/1103, Template_1$power=1470213/1103, time=10900863/110300, time$new=10900863/110300, time$reset=false, x=12106/1103, x$new=12106/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1076/1103, Template_1$power=1470213/1103, time=10900863/110300, time$new=10900863/110300, time$reset=false, x=12106/1103, x$new=12106/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1076/1103, Template_1$power=1470213/1103, time=10900863/110300, time$new=10900863/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=1525363/1103, time=12003863/110300, time$new=12003863/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=1525363/1103, time=12003863/110300, time$new=12003863/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=1525363/1103, time=12003863/110300, time$new=12003863/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=1525363/1103, time=12003863/110300, time$new=12003863/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=1525363/1103, time=12003863/110300, time$new=12003863/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=1525363/1103, time=12003863/110300, time$new=12003863/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1075/1103, Template_1$power=1632863/1103, time=12111363/110300, time$new=12111363/110300, time$reset=false, x=12105/1103, x$new=12105/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1075/1103, Template_1$power=1632863/1103, time=12111363/110300, time$new=12111363/110300, time$reset=false, x=12105/1103, x$new=12105/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1075/1103, Template_1$power=1632863/1103, time=12111363/110300, time$new=12111363/110300, time$reset=false, x=12105/1103, x$new=12105/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1075/1103, Template_1$power=1632863/1103, time=12111363/110300, time$new=12111363/110300, time$reset=false, x=12105/1103, x$new=12105/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1075/1103, Template_1$power=1632863/1103, time=12111363/110300, time$new=12111363/110300, time$reset=false, x=12105/1103, x$new=12105/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1075/1103, Template_1$power=1632863/1103, time=12111363/110300, time$new=12111363/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=1688013/1103, time=13214363/110300, time$new=13214363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=1688013/1103, time=13214363/110300, time$new=13214363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=1688013/1103, time=13214363/110300, time$new=13214363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=1688013/1103, time=13214363/110300, time$new=13214363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=1688013/1103, time=13214363/110300, time$new=13214363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=1688013/1103, time=13214363/110300, time$new=13214363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1074/1103, Template_1$power=1795413/1103, time=13321763/110300, time$new=13321763/110300, time$reset=false, x=12104/1103, x$new=12104/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1074/1103, Template_1$power=1795413/1103, time=13321763/110300, time$new=13321763/110300, time$reset=false, x=12104/1103, x$new=12104/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1074/1103, Template_1$power=1795413/1103, time=13321763/110300, time$new=13321763/110300, time$reset=false, x=12104/1103, x$new=12104/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1074/1103, Template_1$power=1795413/1103, time=13321763/110300, time$new=13321763/110300, time$reset=false, x=12104/1103, x$new=12104/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1074/1103, Template_1$power=1795413/1103, time=13321763/110300, time$new=13321763/110300, time$reset=false, x=12104/1103, x$new=12104/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1074/1103, Template_1$power=1795413/1103, time=13321763/110300, time$new=13321763/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=1850563/1103, time=14424763/110300, time$new=14424763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=1850563/1103, time=14424763/110300, time$new=14424763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=1850563/1103, time=14424763/110300, time$new=14424763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=1850563/1103, time=14424763/110300, time$new=14424763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=1850563/1103, time=14424763/110300, time$new=14424763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=1850563/1103, time=14424763/110300, time$new=14424763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1073/1103, Template_1$power=1957863/1103, time=14532063/110300, time$new=14532063/110300, time$reset=false, x=12103/1103, x$new=12103/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1073/1103, Template_1$power=1957863/1103, time=14532063/110300, time$new=14532063/110300, time$reset=false, x=12103/1103, x$new=12103/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1073/1103, Template_1$power=1957863/1103, time=14532063/110300, time$new=14532063/110300, time$reset=false, x=12103/1103, x$new=12103/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1073/1103, Template_1$power=1957863/1103, time=14532063/110300, time$new=14532063/110300, time$reset=false, x=12103/1103, x$new=12103/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1073/1103, Template_1$power=1957863/1103, time=14532063/110300, time$new=14532063/110300, time$reset=false, x=12103/1103, x$new=12103/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1073/1103, Template_1$power=1957863/1103, time=14532063/110300, time$new=14532063/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2013013/1103, time=15635063/110300, time$new=15635063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2013013/1103, time=15635063/110300, time$new=15635063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2013013/1103, time=15635063/110300, time$new=15635063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2013013/1103, time=15635063/110300, time$new=15635063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2013013/1103, time=15635063/110300, time$new=15635063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2013013/1103, time=15635063/110300, time$new=15635063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1072/1103, Template_1$power=2120213/1103, time=15742263/110300, time$new=15742263/110300, time$reset=false, x=12102/1103, x$new=12102/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1072/1103, Template_1$power=2120213/1103, time=15742263/110300, time$new=15742263/110300, time$reset=false, x=12102/1103, x$new=12102/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1072/1103, Template_1$power=2120213/1103, time=15742263/110300, time$new=15742263/110300, time$reset=false, x=12102/1103, x$new=12102/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1072/1103, Template_1$power=2120213/1103, time=15742263/110300, time$new=15742263/110300, time$reset=false, x=12102/1103, x$new=12102/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1072/1103, Template_1$power=2120213/1103, time=15742263/110300, time$new=15742263/110300, time$reset=false, x=12102/1103, x$new=12102/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1072/1103, Template_1$power=2120213/1103, time=15742263/110300, time$new=15742263/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2175363/1103, time=16845263/110300, time$new=16845263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2175363/1103, time=16845263/110300, time$new=16845263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2175363/1103, time=16845263/110300, time$new=16845263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2175363/1103, time=16845263/110300, time$new=16845263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2175363/1103, time=16845263/110300, time$new=16845263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2175363/1103, time=16845263/110300, time$new=16845263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1071/1103, Template_1$power=2282463/1103, time=16952363/110300, time$new=16952363/110300, time$reset=false, x=12101/1103, x$new=12101/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1071/1103, Template_1$power=2282463/1103, time=16952363/110300, time$new=16952363/110300, time$reset=false, x=12101/1103, x$new=12101/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1071/1103, Template_1$power=2282463/1103, time=16952363/110300, time$new=16952363/110300, time$reset=false, x=12101/1103, x$new=12101/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1071/1103, Template_1$power=2282463/1103, time=16952363/110300, time$new=16952363/110300, time$reset=false, x=12101/1103, x$new=12101/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1071/1103, Template_1$power=2282463/1103, time=16952363/110300, time$new=16952363/110300, time$reset=false, x=12101/1103, x$new=12101/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1071/1103, Template_1$power=2282463/1103, time=16952363/110300, time$new=16952363/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2337613/1103, time=18055363/110300, time$new=18055363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2337613/1103, time=18055363/110300, time$new=18055363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2337613/1103, time=18055363/110300, time$new=18055363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2337613/1103, time=18055363/110300, time$new=18055363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2337613/1103, time=18055363/110300, time$new=18055363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2337613/1103, time=18055363/110300, time$new=18055363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1070/1103, Template_1$power=2444613/1103, time=18162363/110300, time$new=18162363/110300, time$reset=false, x=12100/1103, x$new=12100/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1070/1103, Template_1$power=2444613/1103, time=18162363/110300, time$new=18162363/110300, time$reset=false, x=12100/1103, x$new=12100/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1070/1103, Template_1$power=2444613/1103, time=18162363/110300, time$new=18162363/110300, time$reset=false, x=12100/1103, x$new=12100/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1070/1103, Template_1$power=2444613/1103, time=18162363/110300, time$new=18162363/110300, time$reset=false, x=12100/1103, x$new=12100/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1070/1103, Template_1$power=2444613/1103, time=18162363/110300, time$new=18162363/110300, time$reset=false, x=12100/1103, x$new=12100/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1070/1103, Template_1$power=2444613/1103, time=18162363/110300, time$new=18162363/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2499763/1103, time=19265363/110300, time$new=19265363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2499763/1103, time=19265363/110300, time$new=19265363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2499763/1103, time=19265363/110300, time$new=19265363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2499763/1103, time=19265363/110300, time$new=19265363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2499763/1103, time=19265363/110300, time$new=19265363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2499763/1103, time=19265363/110300, time$new=19265363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1069/1103, Template_1$power=2606663/1103, time=19372263/110300, time$new=19372263/110300, time$reset=false, x=12099/1103, x$new=12099/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1069/1103, Template_1$power=2606663/1103, time=19372263/110300, time$new=19372263/110300, time$reset=false, x=12099/1103, x$new=12099/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1069/1103, Template_1$power=2606663/1103, time=19372263/110300, time$new=19372263/110300, time$reset=false, x=12099/1103, x$new=12099/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1069/1103, Template_1$power=2606663/1103, time=19372263/110300, time$new=19372263/110300, time$reset=false, x=12099/1103, x$new=12099/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1069/1103, Template_1$power=2606663/1103, time=19372263/110300, time$new=19372263/110300, time$reset=false, x=12099/1103, x$new=12099/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1069/1103, Template_1$power=2606663/1103, time=19372263/110300, time$new=19372263/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2661813/1103, time=20475263/110300, time$new=20475263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2661813/1103, time=20475263/110300, time$new=20475263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2661813/1103, time=20475263/110300, time$new=20475263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2661813/1103, time=20475263/110300, time$new=20475263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2661813/1103, time=20475263/110300, time$new=20475263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2661813/1103, time=20475263/110300, time$new=20475263/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1068/1103, Template_1$power=2768613/1103, time=20582063/110300, time$new=20582063/110300, time$reset=false, x=12098/1103, x$new=12098/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1068/1103, Template_1$power=2768613/1103, time=20582063/110300, time$new=20582063/110300, time$reset=false, x=12098/1103, x$new=12098/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1068/1103, Template_1$power=2768613/1103, time=20582063/110300, time$new=20582063/110300, time$reset=false, x=12098/1103, x$new=12098/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1068/1103, Template_1$power=2768613/1103, time=20582063/110300, time$new=20582063/110300, time$reset=false, x=12098/1103, x$new=12098/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1068/1103, Template_1$power=2768613/1103, time=20582063/110300, time$new=20582063/110300, time$reset=false, x=12098/1103, x$new=12098/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1068/1103, Template_1$power=2768613/1103, time=20582063/110300, time$new=20582063/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2823763/1103, time=21685063/110300, time$new=21685063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2823763/1103, time=21685063/110300, time$new=21685063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2823763/1103, time=21685063/110300, time$new=21685063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2823763/1103, time=21685063/110300, time$new=21685063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2823763/1103, time=21685063/110300, time$new=21685063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2823763/1103, time=21685063/110300, time$new=21685063/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1067/1103, Template_1$power=2930463/1103, time=21791763/110300, time$new=21791763/110300, time$reset=false, x=12097/1103, x$new=12097/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1067/1103, Template_1$power=2930463/1103, time=21791763/110300, time$new=21791763/110300, time$reset=false, x=12097/1103, x$new=12097/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1067/1103, Template_1$power=2930463/1103, time=21791763/110300, time$new=21791763/110300, time$reset=false, x=12097/1103, x$new=12097/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1067/1103, Template_1$power=2930463/1103, time=21791763/110300, time$new=21791763/110300, time$reset=false, x=12097/1103, x$new=12097/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1067/1103, Template_1$power=2930463/1103, time=21791763/110300, time$new=21791763/110300, time$reset=false, x=12097/1103, x$new=12097/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1067/1103, Template_1$power=2930463/1103, time=21791763/110300, time$new=21791763/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=2985613/1103, time=22894763/110300, time$new=22894763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=2985613/1103, time=22894763/110300, time$new=22894763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=2985613/1103, time=22894763/110300, time$new=22894763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=2985613/1103, time=22894763/110300, time$new=22894763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=2985613/1103, time=22894763/110300, time$new=22894763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=2985613/1103, time=22894763/110300, time$new=22894763/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1066/1103, Template_1$power=3092213/1103, time=23001363/110300, time$new=23001363/110300, time$reset=false, x=12096/1103, x$new=12096/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1066/1103, Template_1$power=3092213/1103, time=23001363/110300, time$new=23001363/110300, time$reset=false, x=12096/1103, x$new=12096/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1066/1103, Template_1$power=3092213/1103, time=23001363/110300, time$new=23001363/110300, time$reset=false, x=12096/1103, x$new=12096/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1066/1103, Template_1$power=3092213/1103, time=23001363/110300, time$new=23001363/110300, time$reset=false, x=12096/1103, x$new=12096/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1066/1103, Template_1$power=3092213/1103, time=23001363/110300, time$new=23001363/110300, time$reset=false, x=12096/1103, x$new=12096/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1066/1103, Template_1$power=3092213/1103, time=23001363/110300, time$new=23001363/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=10.0, Template_1$power=3147363/1103, time=24104363/110300, time$new=24104363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=10.0, Template_1$power=3147363/1103, time=24104363/110300, time$new=24104363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=10.0, Template_1$power=3147363/1103, time=24104363/110300, time$new=24104363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=10.0, Template_1$power=3147363/1103, time=24104363/110300, time$new=24104363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=10.0, Template_1$power=3147363/1103, time=24104363/110300, time$new=24104363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L118] COND TRUE loc$Template_1 == id1_1 [L122] assume x >= 10.0; [L123] loc$Template_1 := id0_1; VAL [delay=10.0, Template_1$power=3147363/1103, time=24104363/110300, time$new=24104363/110300, time$reset=false, x=10.0, x$new=10.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND TRUE loc$Template_1 == id0_1 [L93] Template_1$power := Template_1$power + 100.0 * delay; VAL [delay=1065/1103, Template_1$power=3253863/1103, time=24210863/110300, time$new=24210863/110300, time$reset=false, x=12095/1103, x$new=12095/1103, x$reset=false] [L100] COND TRUE loc$Template_1 == id0_1 [L102] assume x <= 11.0; VAL [delay=1065/1103, Template_1$power=3253863/1103, time=24210863/110300, time$new=24210863/110300, time$reset=false, x=12095/1103, x$new=12095/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=1065/1103, Template_1$power=3253863/1103, time=24210863/110300, time$new=24210863/110300, time$reset=false, x=12095/1103, x$new=12095/1103, x$reset=false] [L116] COND TRUE sync == sync_none VAL [delay=1065/1103, Template_1$power=3253863/1103, time=24210863/110300, time$new=24210863/110300, time$reset=false, x=12095/1103, x$new=12095/1103, x$reset=false] [L118] COND FALSE !(loc$Template_1 == id1_1) VAL [delay=1065/1103, Template_1$power=3253863/1103, time=24210863/110300, time$new=24210863/110300, time$reset=false, x=12095/1103, x$new=12095/1103, x$reset=false] [L126] COND TRUE loc$Template_1 == id0_1 [L131] loc$Template_1 := id1_1; [L132] x := 0.0; [L133] x$new := x; VAL [delay=1065/1103, Template_1$power=3253863/1103, time=24210863/110300, time$new=24210863/110300, time$reset=false, x=0.0, x$new=0.0, x$reset=false] [L82] assert Template_1$power <= 3000.0; [L83] havoc delay; [L84] assume delay >= 0.0; [L86] time := time + delay; [L87] time$new := time; [L88] x := x + delay; [L89] x$new := x; [L91] COND FALSE !(loc$Template_1 == id0_1) [L95] COND TRUE loc$Template_1 == id1_1 [L97] Template_1$power := Template_1$power + 5.0 * delay; VAL [delay=11028/1103, Template_1$power=3309003/1103, time=25313663/110300, time$new=25313663/110300, time$reset=false, x=11028/1103, x$new=11028/1103, x$reset=false] [L100] COND FALSE !(loc$Template_1 == id0_1) VAL [delay=11028/1103, Template_1$power=3309003/1103, time=25313663/110300, time$new=25313663/110300, time$reset=false, x=11028/1103, x$new=11028/1103, x$reset=false] [L105] COND TRUE loc$Template_1 == id1_1 [L107] assume x <= 10.0; VAL [delay=11028/1103, Template_1$power=3309003/1103, time=25313663/110300, time$new=25313663/110300, time$reset=false, x=11028/1103, x$new=11028/1103, x$reset=false] [L113] assert Template_1$power <= 3000.0; VAL [delay=11028/1103, Template_1$power=3309003/1103, time=25313663/110300, time$new=25313663/110300, time$reset=false, x=11028/1103, x$new=11028/1103, x$reset=false] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 2 error locations. UNSAFE Result, 180.3s OverallTime, 43 OverallIterations, 41 TraceHistogramMax, 113.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 421 SDtfs, 18552 SDslu, 5651 SDs, 0 SdLazy, 13219 SolverSat, 7727 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6974 GetRequests, 2761 SyntacticMatches, 1 SemanticMatches, 4212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197453 ImplicationChecksByTransitivity, 148.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 2024 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 61.8s InterpolantComputationTime, 5111 NumberOfCodeBlocks, 5111 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4824 ConstructedInterpolants, 0 QuantifiedInterpolants, 5747736 SizeOfPredicates, 2061 NumberOfNonLiveVariables, 17227 ConjunctsInSsa, 3784 ConjunctsInUnsatCore, 42 InterpolantComputations, 3 PerfectInterpolantSequences, 0/56680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...