java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:37:14,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:37:14,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:37:14,564 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:37:14,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:37:14,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:37:14,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:37:14,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:37:14,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:37:14,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:37:14,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:37:14,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:37:14,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:37:14,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:37:14,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:37:14,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:37:14,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:37:14,598 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:37:14,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:37:14,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:37:14,609 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:37:14,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:37:14,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:37:14,617 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:37:14,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:37:14,618 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:37:14,619 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:37:14,620 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:37:14,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:37:14,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:37:14,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:37:14,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:37:14,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:37:14,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:37:14,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:37:14,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:37:14,631 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:37:14,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:37:14,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:37:14,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:37:14,656 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:37:14,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:37:14,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:37:14,657 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:37:14,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:37:14,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:37:14,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:37:14,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:37:14,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:37:14,728 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:37:14,729 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-07-23 13:37:14,729 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-07-23 13:37:14,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:37:14,784 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:37:14,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:37:14,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:37:14,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:37:14,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:37:14,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:37:14,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:37:14,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:37:14,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/1) ... [2018-07-23 13:37:14,930 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 13:37:14,930 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 13:37:14,930 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 13:37:15,131 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:37:15,132 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:37:15 BoogieIcfgContainer [2018-07-23 13:37:15,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:37:15,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:37:15,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:37:15,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:37:15,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:37:14" (1/2) ... [2018-07-23 13:37:15,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ccd234 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:37:15, skipping insertion in model container [2018-07-23 13:37:15,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:37:15" (2/2) ... [2018-07-23 13:37:15,142 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-07-23 13:37:15,153 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:37:15,161 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-23 13:37:15,211 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:37:15,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:37:15,212 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:37:15,212 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:37:15,213 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:37:15,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:37:15,213 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:37:15,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:37:15,214 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:37:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-07-23 13:37:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:37:15,242 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:15,243 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:37:15,244 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-07-23 13:37:15,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,343 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:15,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:37:15,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,347 INFO L185 omatonBuilderFactory]: Interpolants [20#true, 21#false, 22#(<= (+ product_working1 1) product_next), 23#(<= (+ product_working1 1) product_begin0), 24#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:37:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,349 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:37:15,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:37:15,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:37:15,367 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-07-23 13:37:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,570 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-07-23 13:37:15,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:37:15,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:37:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,585 INFO L225 Difference]: With dead ends: 32 [2018-07-23 13:37:15,585 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:37:15,589 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:37:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-07-23 13:37:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:37:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-07-23 13:37:15,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-07-23 13:37:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:15,639 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-07-23 13:37:15,640 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:37:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-07-23 13:37:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:37:15,640 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:15,641 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:37:15,641 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-07-23 13:37:15,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,685 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:15,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:37:15,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,691 INFO L185 omatonBuilderFactory]: Interpolants [139#true, 140#false, 141#(<= (+ product_working0 1) product_next), 142#(<= (+ product_working0 1) product_begin1), 143#(<= (+ product_working0 1) product_working1)] [2018-07-23 13:37:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,697 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:37:15,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:37:15,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:37:15,698 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-07-23 13:37:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:15,880 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-07-23 13:37:15,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:37:15,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-23 13:37:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:15,884 INFO L225 Difference]: With dead ends: 38 [2018-07-23 13:37:15,885 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:37:15,886 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:37:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-07-23 13:37:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:37:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-07-23 13:37:15,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-07-23 13:37:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:15,897 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-07-23 13:37:15,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:37:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-07-23 13:37:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:37:15,898 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:15,898 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 13:37:15,898 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-07-23 13:37:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,936 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:15,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:37:15,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,937 INFO L185 omatonBuilderFactory]: Interpolants [282#true, 283#false, 284#(<= (+ product_working0 2) (+ product_workload product_next)), 285#(not (= product_working0 product_next)), 286#(not (= product_working0 product_begin1)), 287#(not (= product_working0 product_working1))] [2018-07-23 13:37:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:15,939 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:37:15,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:37:15,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:15,941 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-07-23 13:37:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,068 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-07-23 13:37:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:16,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-23 13:37:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,069 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:37:16,069 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:37:16,070 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:37:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-07-23 13:37:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:37:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-07-23 13:37:16,092 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-07-23 13:37:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,092 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-07-23 13:37:16,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:37:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-07-23 13:37:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:37:16,094 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,095 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 13:37:16,095 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-07-23 13:37:16,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,137 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:16,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-23 13:37:16,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,138 INFO L185 omatonBuilderFactory]: Interpolants [458#true, 459#false, 460#(<= (+ product_working1 2) (+ product_workload product_next)), 461#(<= (+ product_working1 2) product_next), 462#(<= (+ product_working1 2) product_begin0), 463#(<= (+ product_working1 2) product_working0)] [2018-07-23 13:37:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,139 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:37:16,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:37:16,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:37:16,140 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-07-23 13:37:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,279 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-07-23 13:37:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:37:16,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-23 13:37:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,281 INFO L225 Difference]: With dead ends: 54 [2018-07-23 13:37:16,281 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:37:16,282 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:37:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-07-23 13:37:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:37:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-07-23 13:37:16,302 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-07-23 13:37:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,303 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-07-23 13:37:16,303 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:37:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-07-23 13:37:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:16,304 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,304 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:16,305 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-07-23 13:37:16,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:16,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:16,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,404 INFO L185 omatonBuilderFactory]: Interpolants [660#true, 661#false, 662#(= product_end0 product_next), 663#(= product_end0 product_begin1), 664#(and (or (= product_working0 product_end0) (= product_end0 product_begin1)) (or (<= product_working0 product_begin0) (not (= product_working0 product_end0)))), 665#(and (or (= product_working0 product_end0) (= product_end0 product_begin1)) (or (<= (+ product_working0 1) product_begin0) (not (= product_working0 product_end0)))), 666#(not (= product_working0 product_begin1)), 667#(not (= product_working0 product_working1))] [2018-07-23 13:37:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,405 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:16,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:16,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:16,406 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 8 states. [2018-07-23 13:37:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,603 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2018-07-23 13:37:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:16,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,605 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:37:16,606 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:37:16,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:37:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2018-07-23 13:37:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:37:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 100 transitions. [2018-07-23 13:37:16,628 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 100 transitions. Word has length 8 [2018-07-23 13:37:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,628 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 100 transitions. [2018-07-23 13:37:16,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 100 transitions. [2018-07-23 13:37:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:16,632 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,632 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:16,636 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:16,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-07-23 13:37:16,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,692 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:16,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-23 13:37:16,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,697 INFO L185 omatonBuilderFactory]: Interpolants [960#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 961#(and (= product_end0 product_begin1) (not (= product_working0 product_end0))), 962#(not (= product_working0 product_begin1)), 963#(not (= product_working0 product_working1)), 956#true, 957#false, 958#(<= 1 product_workload), 959#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0))] [2018-07-23 13:37:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,697 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:16,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:16,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:16,700 INFO L87 Difference]: Start difference. First operand 59 states and 100 transitions. Second operand 8 states. [2018-07-23 13:37:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:16,866 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2018-07-23 13:37:16,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:16,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:16,875 INFO L225 Difference]: With dead ends: 92 [2018-07-23 13:37:16,876 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:37:16,877 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:37:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-07-23 13:37:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:37:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions. [2018-07-23 13:37:16,915 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 8 [2018-07-23 13:37:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions. [2018-07-23 13:37:16,916 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2018-07-23 13:37:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:16,917 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:16,917 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:16,917 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-07-23 13:37:16,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:16,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:16,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,958 INFO L185 omatonBuilderFactory]: Interpolants [1312#(<= (+ product_begin0 product_workload) product_next), 1313#(<= (+ product_begin0 product_end1) (* 2 product_begin1)), 1314#(<= (+ product_begin0 product_end1) (+ product_working1 product_begin1)), 1315#(<= (+ product_begin0 product_end1 1) (+ product_working1 product_begin1)), 1316#(<= (+ product_begin0 2) product_working1), 1317#(not (= product_working0 product_working1)), 1310#true, 1311#false] [2018-07-23 13:37:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:16,959 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:16,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:16,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:16,961 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 8 states. [2018-07-23 13:37:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,155 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2018-07-23 13:37:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:17,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,157 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:37:17,158 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:37:17,158 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:37:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2018-07-23 13:37:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:37:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 135 transitions. [2018-07-23 13:37:17,201 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 135 transitions. Word has length 8 [2018-07-23 13:37:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:17,203 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 135 transitions. [2018-07-23 13:37:17,203 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 135 transitions. [2018-07-23 13:37:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:17,204 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:17,205 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:17,205 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-07-23 13:37:17,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:17,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:17,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,237 INFO L185 omatonBuilderFactory]: Interpolants [1696#true, 1697#false, 1698#(<= (+ product_working0 1) product_next), 1699#(<= (+ product_workload product_working0 1) product_next), 1700#(<= (+ product_end1 product_working0 1) (* 2 product_begin1)), 1701#(<= (+ product_end1 product_working0 3) (* 2 product_begin1)), 1702#(<= (+ product_working0 4) product_begin1), 1703#(<= (+ product_working0 4) product_working1)] [2018-07-23 13:37:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,238 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:17,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:17,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:17,243 INFO L87 Difference]: Start difference. First operand 78 states and 135 transitions. Second operand 8 states. [2018-07-23 13:37:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,379 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2018-07-23 13:37:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:37:17,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,381 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:37:17,381 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 13:37:17,382 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 13:37:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2018-07-23 13:37:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:37:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 144 transitions. [2018-07-23 13:37:17,422 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 144 transitions. Word has length 8 [2018-07-23 13:37:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:17,423 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 144 transitions. [2018-07-23 13:37:17,423 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 144 transitions. [2018-07-23 13:37:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:17,427 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:17,427 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:17,427 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times [2018-07-23 13:37:17,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:17,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:17,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,461 INFO L185 omatonBuilderFactory]: Interpolants [2096#(<= (+ product_begin0 1) product_begin1), 2097#(<= (+ product_begin0 1) product_working1), 2098#(not (= product_working0 product_working1)), 2092#true, 2093#false, 2094#(<= 1 product_workload), 2095#(<= (+ product_begin0 1) product_next)] [2018-07-23 13:37:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,462 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:17,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:17,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:17,463 INFO L87 Difference]: Start difference. First operand 83 states and 144 transitions. Second operand 7 states. [2018-07-23 13:37:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,604 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions. [2018-07-23 13:37:17,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:17,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:37:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,606 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:37:17,606 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:37:17,607 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:37:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-07-23 13:37:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:37:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 147 transitions. [2018-07-23 13:37:17,644 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 147 transitions. Word has length 8 [2018-07-23 13:37:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:17,644 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 147 transitions. [2018-07-23 13:37:17,644 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 147 transitions. [2018-07-23 13:37:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:17,645 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:17,646 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:17,646 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-07-23 13:37:17,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:17,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:17,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,675 INFO L185 omatonBuilderFactory]: Interpolants [2496#(not (= product_working0 product_working1)), 2489#true, 2490#false, 2491#(<= 1 product_workload), 2492#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 2493#(and (not (= product_working0 product_end0)) (= product_end0 product_next)), 2494#(not (= product_working0 product_next)), 2495#(not (= product_working0 product_begin1))] [2018-07-23 13:37:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,676 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:17,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:17,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:17,677 INFO L87 Difference]: Start difference. First operand 85 states and 147 transitions. Second operand 8 states. [2018-07-23 13:37:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:17,865 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2018-07-23 13:37:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:17,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:17,868 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:37:17,868 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:37:17,869 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:37:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-07-23 13:37:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:37:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions. [2018-07-23 13:37:17,905 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 151 transitions. Word has length 8 [2018-07-23 13:37:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:17,905 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 151 transitions. [2018-07-23 13:37:17,905 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 151 transitions. [2018-07-23 13:37:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:17,906 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:17,907 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:17,907 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-07-23 13:37:17,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:17,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:17,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,930 INFO L185 omatonBuilderFactory]: Interpolants [2901#true, 2902#false, 2903#(<= (+ product_workload product_begin1) product_next), 2904#(<= (+ product_end0 product_begin1) (* 2 product_begin0)), 2905#(<= (+ product_end0 product_begin1) (+ product_begin0 product_working0)), 2906#(<= (+ product_end0 product_begin1 1) (+ product_begin0 product_working0)), 2907#(<= (+ product_begin1 2) product_working0), 2908#(<= (+ product_working1 2) product_working0)] [2018-07-23 13:37:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:17,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:17,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:17,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:17,932 INFO L87 Difference]: Start difference. First operand 87 states and 151 transitions. Second operand 8 states. [2018-07-23 13:37:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,098 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2018-07-23 13:37:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:18,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,100 INFO L225 Difference]: With dead ends: 128 [2018-07-23 13:37:18,100 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 13:37:18,101 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 13:37:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2018-07-23 13:37:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:37:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-07-23 13:37:18,137 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 8 [2018-07-23 13:37:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,138 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-07-23 13:37:18,138 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-07-23 13:37:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:18,139 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,139 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,139 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-07-23 13:37:18,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:18,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,157 INFO L185 omatonBuilderFactory]: Interpolants [3377#true, 3378#false, 3379#(<= 1 product_workload), 3380#(<= (+ product_begin1 1) product_next), 3381#(<= (+ product_begin1 1) product_begin0), 3382#(<= (+ product_begin1 1) product_working0), 3383#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:37:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,157 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:18,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:18,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:18,158 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 7 states. [2018-07-23 13:37:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,294 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions. [2018-07-23 13:37:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:18,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:37:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,296 INFO L225 Difference]: With dead ends: 136 [2018-07-23 13:37:18,296 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 13:37:18,297 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 13:37:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2018-07-23 13:37:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:37:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 178 transitions. [2018-07-23 13:37:18,336 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 178 transitions. Word has length 8 [2018-07-23 13:37:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,337 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 178 transitions. [2018-07-23 13:37:18,337 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 178 transitions. [2018-07-23 13:37:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:18,338 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,338 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,338 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-07-23 13:37:18,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,357 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:18,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,358 INFO L185 omatonBuilderFactory]: Interpolants [3874#true, 3875#false, 3876#(<= product_end1 product_next), 3877#(<= product_end1 product_begin0), 3878#(<= (+ product_working1 product_end1) (+ product_begin0 product_begin1)), 3879#(<= (+ product_working1 product_end1 1) (+ product_begin0 product_begin1)), 3880#(<= (+ product_working1 2) product_begin0), 3881#(<= (+ product_working1 2) product_working0)] [2018-07-23 13:37:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:18,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:18,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:18,359 INFO L87 Difference]: Start difference. First operand 102 states and 178 transitions. Second operand 8 states. [2018-07-23 13:37:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,517 INFO L93 Difference]: Finished difference Result 150 states and 251 transitions. [2018-07-23 13:37:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:37:18,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:37:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,519 INFO L225 Difference]: With dead ends: 150 [2018-07-23 13:37:18,519 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 13:37:18,520 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 13:37:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2018-07-23 13:37:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 13:37:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2018-07-23 13:37:18,566 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 8 [2018-07-23 13:37:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2018-07-23 13:37:18,567 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2018-07-23 13:37:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:18,568 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,568 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,568 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-07-23 13:37:18,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,582 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:18,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 13:37:18,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,583 INFO L185 omatonBuilderFactory]: Interpolants [4432#true, 4433#false, 4434#(<= 1 product_workload), 4435#(<= (+ product_begin1 1) product_next), 4436#(<= (+ product_begin1 1) product_begin0), 4437#(<= (+ product_working1 1) product_begin0), 4438#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:37:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:18,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:18,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:18,585 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 7 states. [2018-07-23 13:37:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:18,779 INFO L93 Difference]: Finished difference Result 178 states and 308 transitions. [2018-07-23 13:37:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:18,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:37:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:18,781 INFO L225 Difference]: With dead ends: 178 [2018-07-23 13:37:18,781 INFO L226 Difference]: Without dead ends: 176 [2018-07-23 13:37:18,782 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-23 13:37:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132. [2018-07-23 13:37:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-23 13:37:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 233 transitions. [2018-07-23 13:37:18,841 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 233 transitions. Word has length 8 [2018-07-23 13:37:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:18,842 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 233 transitions. [2018-07-23 13:37:18,842 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 233 transitions. [2018-07-23 13:37:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:37:18,843 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:18,843 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:18,843 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-07-23 13:37:18,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:18,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:37:18,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,858 INFO L185 omatonBuilderFactory]: Interpolants [5079#true, 5080#false, 5081#(<= 1 product_workload), 5082#(<= (+ product_begin1 1) product_next), 5083#(<= (+ product_working1 1) product_next), 5084#(<= (+ product_working1 1) product_begin0), 5085#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:37:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:18,859 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:18,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:18,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:18,860 INFO L87 Difference]: Start difference. First operand 132 states and 233 transitions. Second operand 7 states. [2018-07-23 13:37:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:19,062 INFO L93 Difference]: Finished difference Result 235 states and 413 transitions. [2018-07-23 13:37:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:19,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-07-23 13:37:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:19,064 INFO L225 Difference]: With dead ends: 235 [2018-07-23 13:37:19,064 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 13:37:19,065 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 13:37:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2018-07-23 13:37:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 13:37:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 320 transitions. [2018-07-23 13:37:19,145 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 320 transitions. Word has length 8 [2018-07-23 13:37:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:19,145 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 320 transitions. [2018-07-23 13:37:19,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 320 transitions. [2018-07-23 13:37:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:37:19,146 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:19,146 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:37:19,146 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:19,147 INFO L82 PathProgramCache]: Analyzing trace with hash -799219888, now seen corresponding path program 1 times [2018-07-23 13:37:19,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:19,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:19,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,172 INFO L185 omatonBuilderFactory]: Interpolants [5928#true, 5929#false, 5930#(<= (+ product_working0 3) (+ (* 2 product_workload) product_next)), 5931#(<= (+ product_working0 3) (+ product_workload product_next)), 5932#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 5933#(not (= product_working0 product_next)), 5934#(not (= product_working0 product_begin1)), 5935#(not (= product_working0 product_working1))] [2018-07-23 13:37:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:19,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:19,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:19,174 INFO L87 Difference]: Start difference. First operand 179 states and 320 transitions. Second operand 8 states. [2018-07-23 13:37:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:19,391 INFO L93 Difference]: Finished difference Result 206 states and 368 transitions. [2018-07-23 13:37:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:19,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-07-23 13:37:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:19,393 INFO L225 Difference]: With dead ends: 206 [2018-07-23 13:37:19,393 INFO L226 Difference]: Without dead ends: 204 [2018-07-23 13:37:19,394 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-23 13:37:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-07-23 13:37:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-23 13:37:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 351 transitions. [2018-07-23 13:37:19,481 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 351 transitions. Word has length 9 [2018-07-23 13:37:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:19,481 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 351 transitions. [2018-07-23 13:37:19,481 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 351 transitions. [2018-07-23 13:37:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:37:19,482 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:19,482 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:19,482 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1170716006, now seen corresponding path program 1 times [2018-07-23 13:37:19,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:19,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:19,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,514 INFO L185 omatonBuilderFactory]: Interpolants [6758#true, 6759#false, 6760#(<= 1 product_workload), 6761#(and (<= (+ product_begin0 2) (+ product_workload product_end0)) (= product_end0 product_next)), 6762#(and (<= (+ product_working0 2) (+ product_workload product_end0)) (= product_end0 product_next)), 6763#(<= (+ product_working0 2) (+ product_workload product_next)), 6764#(not (= product_working0 product_next)), 6765#(not (= product_working0 product_begin1)), 6766#(not (= product_working0 product_working1))] [2018-07-23 13:37:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,515 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:19,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:19,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:19,515 INFO L87 Difference]: Start difference. First operand 196 states and 351 transitions. Second operand 9 states. [2018-07-23 13:37:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:19,823 INFO L93 Difference]: Finished difference Result 266 states and 466 transitions. [2018-07-23 13:37:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:19,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:37:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:19,826 INFO L225 Difference]: With dead ends: 266 [2018-07-23 13:37:19,826 INFO L226 Difference]: Without dead ends: 264 [2018-07-23 13:37:19,828 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-23 13:37:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222. [2018-07-23 13:37:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-23 13:37:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 402 transitions. [2018-07-23 13:37:19,920 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 402 transitions. Word has length 9 [2018-07-23 13:37:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:19,920 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 402 transitions. [2018-07-23 13:37:19,920 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 402 transitions. [2018-07-23 13:37:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:19,921 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:19,921 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:19,921 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-07-23 13:37:19,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:19,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:19,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,936 INFO L185 omatonBuilderFactory]: Interpolants [7776#(= product_end0 product_begin1), 7777#(<= (+ product_begin0 1) product_begin1), 7778#(<= (+ product_begin0 1) product_working1), 7779#(not (= product_working0 product_working1)), 7773#true, 7774#false, 7775#(= product_end0 product_next)] [2018-07-23 13:37:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:19,936 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:19,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:19,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:19,937 INFO L87 Difference]: Start difference. First operand 222 states and 402 transitions. Second operand 7 states. [2018-07-23 13:37:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,116 INFO L93 Difference]: Finished difference Result 264 states and 459 transitions. [2018-07-23 13:37:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:20,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,120 INFO L225 Difference]: With dead ends: 264 [2018-07-23 13:37:20,120 INFO L226 Difference]: Without dead ends: 262 [2018-07-23 13:37:20,121 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-23 13:37:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2018-07-23 13:37:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-23 13:37:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 420 transitions. [2018-07-23 13:37:20,223 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 420 transitions. Word has length 11 [2018-07-23 13:37:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:20,223 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 420 transitions. [2018-07-23 13:37:20,223 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 420 transitions. [2018-07-23 13:37:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:20,224 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:20,224 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:20,224 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000296, now seen corresponding path program 1 times [2018-07-23 13:37:20,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:20,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:20,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,245 INFO L185 omatonBuilderFactory]: Interpolants [8786#true, 8787#false, 8788#(= product_end0 product_next), 8789#(= product_end0 product_begin1), 8790#(and (= product_end0 product_begin1) (<= product_working0 product_begin0)), 8791#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_begin1)), 8792#(<= (+ product_working0 2) product_begin1), 8793#(<= (+ product_working0 3) product_begin1), 8794#(<= (+ product_working0 3) product_working1)] [2018-07-23 13:37:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:20,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:20,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:20,247 INFO L87 Difference]: Start difference. First operand 231 states and 420 transitions. Second operand 9 states. [2018-07-23 13:37:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,409 INFO L93 Difference]: Finished difference Result 250 states and 439 transitions. [2018-07-23 13:37:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:20,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-23 13:37:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,412 INFO L225 Difference]: With dead ends: 250 [2018-07-23 13:37:20,412 INFO L226 Difference]: Without dead ends: 249 [2018-07-23 13:37:20,413 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-23 13:37:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2018-07-23 13:37:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-23 13:37:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 419 transitions. [2018-07-23 13:37:20,512 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 419 transitions. Word has length 11 [2018-07-23 13:37:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:20,512 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 419 transitions. [2018-07-23 13:37:20,512 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 419 transitions. [2018-07-23 13:37:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:20,513 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:20,513 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:20,513 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-07-23 13:37:20,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:20,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:20,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,540 INFO L185 omatonBuilderFactory]: Interpolants [9761#true, 9762#false, 9763#(<= 1 product_workload), 9764#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 9765#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 9766#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_begin1)), 9767#(<= (+ product_working0 1) product_begin1), 9768#(<= (+ product_working0 2) product_begin1), 9769#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:20,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:20,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:20,543 INFO L87 Difference]: Start difference. First operand 231 states and 419 transitions. Second operand 9 states. [2018-07-23 13:37:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:20,807 INFO L93 Difference]: Finished difference Result 278 states and 490 transitions. [2018-07-23 13:37:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:20,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-23 13:37:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:20,809 INFO L225 Difference]: With dead ends: 278 [2018-07-23 13:37:20,810 INFO L226 Difference]: Without dead ends: 276 [2018-07-23 13:37:20,810 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-07-23 13:37:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2018-07-23 13:37:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-23 13:37:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 439 transitions. [2018-07-23 13:37:20,909 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 439 transitions. Word has length 11 [2018-07-23 13:37:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:20,910 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 439 transitions. [2018-07-23 13:37:20,910 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 439 transitions. [2018-07-23 13:37:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:20,911 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:20,911 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:20,911 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times [2018-07-23 13:37:20,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:20,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:20,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,927 INFO L185 omatonBuilderFactory]: Interpolants [10834#true, 10835#false, 10836#(= product_end0 product_next), 10837#(= product_end0 product_begin1), 10838#(= product_end0 product_working1), 10839#(<= (+ product_begin0 1) product_working1), 10840#(not (= product_working0 product_working1))] [2018-07-23 13:37:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:20,928 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:20,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:20,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:20,929 INFO L87 Difference]: Start difference. First operand 242 states and 439 transitions. Second operand 7 states. [2018-07-23 13:37:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:21,121 INFO L93 Difference]: Finished difference Result 300 states and 527 transitions. [2018-07-23 13:37:21,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:21,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:21,124 INFO L225 Difference]: With dead ends: 300 [2018-07-23 13:37:21,124 INFO L226 Difference]: Without dead ends: 298 [2018-07-23 13:37:21,124 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-23 13:37:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 267. [2018-07-23 13:37:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 13:37:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 484 transitions. [2018-07-23 13:37:21,228 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 484 transitions. Word has length 11 [2018-07-23 13:37:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,229 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 484 transitions. [2018-07-23 13:37:21,229 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 484 transitions. [2018-07-23 13:37:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:21,230 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,230 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:21,230 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 2 times [2018-07-23 13:37:21,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:21,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:21,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,253 INFO L185 omatonBuilderFactory]: Interpolants [11985#true, 11986#false, 11987#(= product_end0 product_next), 11988#(= product_begin1 product_end0), 11989#(<= (+ product_end0 1) product_begin1), 11990#(<= (+ product_end0 product_working0 1) (+ product_begin0 product_begin1)), 11991#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_begin1)), 11992#(<= (+ product_working0 3) product_begin1), 11993#(<= (+ product_working0 3) product_working1)] [2018-07-23 13:37:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,254 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:21,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:21,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:21,254 INFO L87 Difference]: Start difference. First operand 267 states and 484 transitions. Second operand 9 states. [2018-07-23 13:37:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:21,497 INFO L93 Difference]: Finished difference Result 334 states and 589 transitions. [2018-07-23 13:37:21,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:21,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-23 13:37:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:21,501 INFO L225 Difference]: With dead ends: 334 [2018-07-23 13:37:21,501 INFO L226 Difference]: Without dead ends: 333 [2018-07-23 13:37:21,502 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-23 13:37:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2018-07-23 13:37:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-07-23 13:37:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 512 transitions. [2018-07-23 13:37:21,614 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 512 transitions. Word has length 11 [2018-07-23 13:37:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:21,614 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 512 transitions. [2018-07-23 13:37:21,615 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 512 transitions. [2018-07-23 13:37:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:21,615 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:21,616 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:21,616 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-07-23 13:37:21,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:21,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:21,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,639 INFO L185 omatonBuilderFactory]: Interpolants [13234#true, 13235#false, 13236#(<= 1 product_workload), 13237#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 13238#(and (= product_begin1 product_end0) (<= (+ product_begin0 1) product_end0)), 13239#(<= (+ product_begin0 2) product_begin1), 13240#(<= (+ product_working0 2) product_begin1), 13241#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:21,639 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:21,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:21,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:21,640 INFO L87 Difference]: Start difference. First operand 282 states and 512 transitions. Second operand 8 states. [2018-07-23 13:37:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:21,958 INFO L93 Difference]: Finished difference Result 342 states and 604 transitions. [2018-07-23 13:37:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:21,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-07-23 13:37:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:21,961 INFO L225 Difference]: With dead ends: 342 [2018-07-23 13:37:21,961 INFO L226 Difference]: Without dead ends: 340 [2018-07-23 13:37:21,962 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-07-23 13:37:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2018-07-23 13:37:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-23 13:37:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 518 transitions. [2018-07-23 13:37:22,126 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 518 transitions. Word has length 11 [2018-07-23 13:37:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:22,126 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 518 transitions. [2018-07-23 13:37:22,126 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 518 transitions. [2018-07-23 13:37:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:22,127 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:22,127 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:22,128 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 285598401, now seen corresponding path program 1 times [2018-07-23 13:37:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:22,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:22,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,151 INFO L185 omatonBuilderFactory]: Interpolants [14528#(<= (+ product_working0 2) product_working1), 14520#true, 14521#false, 14522#(<= 1 product_workload), 14523#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 14524#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_next)), 14525#(<= (+ product_working0 1) product_next), 14526#(<= (+ product_working0 1) product_begin1), 14527#(<= (+ product_working0 2) product_begin1)] [2018-07-23 13:37:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,151 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:22,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:22,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:22,152 INFO L87 Difference]: Start difference. First operand 286 states and 518 transitions. Second operand 9 states. [2018-07-23 13:37:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,427 INFO L93 Difference]: Finished difference Result 300 states and 532 transitions. [2018-07-23 13:37:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:22,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-07-23 13:37:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,430 INFO L225 Difference]: With dead ends: 300 [2018-07-23 13:37:22,430 INFO L226 Difference]: Without dead ends: 298 [2018-07-23 13:37:22,431 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-23 13:37:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 251. [2018-07-23 13:37:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-23 13:37:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 450 transitions. [2018-07-23 13:37:22,542 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 450 transitions. Word has length 11 [2018-07-23 13:37:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:22,542 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 450 transitions. [2018-07-23 13:37:22,542 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 450 transitions. [2018-07-23 13:37:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:22,543 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:22,543 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:22,543 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-07-23 13:37:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,561 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:37:22,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 13:37:22,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,562 INFO L185 omatonBuilderFactory]: Interpolants [15655#true, 15656#false, 15657#(= product_end0 product_next), 15658#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 15659#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 15660#(and (= product_end0 product_begin1) (not (= product_end0 product_working0))), 15661#(not (= product_working0 product_begin1)), 15662#(not (= product_working0 product_working1))] [2018-07-23 13:37:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,563 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:22,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:22,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:22,563 INFO L87 Difference]: Start difference. First operand 251 states and 450 transitions. Second operand 8 states. [2018-07-23 13:37:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:22,777 INFO L93 Difference]: Finished difference Result 286 states and 493 transitions. [2018-07-23 13:37:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:22,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-07-23 13:37:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:22,780 INFO L225 Difference]: With dead ends: 286 [2018-07-23 13:37:22,780 INFO L226 Difference]: Without dead ends: 284 [2018-07-23 13:37:22,781 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-23 13:37:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 257. [2018-07-23 13:37:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 13:37:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 460 transitions. [2018-07-23 13:37:22,893 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 460 transitions. Word has length 11 [2018-07-23 13:37:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:22,894 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 460 transitions. [2018-07-23 13:37:22,894 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 460 transitions. [2018-07-23 13:37:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:22,895 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:22,895 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:22,895 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-07-23 13:37:22,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:22,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:22,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,908 INFO L185 omatonBuilderFactory]: Interpolants [16768#(<= (+ product_begin0 1) product_working1), 16769#(not (= product_working0 product_working1)), 16763#true, 16764#false, 16765#(= product_end0 product_next), 16766#(<= (+ product_begin0 1) product_next), 16767#(<= (+ product_begin0 1) product_begin1)] [2018-07-23 13:37:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:22,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:22,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:22,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:22,909 INFO L87 Difference]: Start difference. First operand 257 states and 460 transitions. Second operand 7 states. [2018-07-23 13:37:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:23,107 INFO L93 Difference]: Finished difference Result 292 states and 503 transitions. [2018-07-23 13:37:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:23,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:23,109 INFO L225 Difference]: With dead ends: 292 [2018-07-23 13:37:23,109 INFO L226 Difference]: Without dead ends: 290 [2018-07-23 13:37:23,110 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-23 13:37:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256. [2018-07-23 13:37:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-23 13:37:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 458 transitions. [2018-07-23 13:37:23,215 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 458 transitions. Word has length 11 [2018-07-23 13:37:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,216 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 458 transitions. [2018-07-23 13:37:23,216 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 458 transitions. [2018-07-23 13:37:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:23,217 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,217 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,217 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-07-23 13:37:23,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:23,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:23,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,230 INFO L185 omatonBuilderFactory]: Interpolants [17880#true, 17881#false, 17882#(<= product_end1 product_next), 17883#(<= product_end1 product_begin0), 17884#(<= product_end1 product_working0), 17885#(<= (+ product_begin1 1) product_working0), 17886#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:37:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,230 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:23,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:23,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:23,231 INFO L87 Difference]: Start difference. First operand 256 states and 458 transitions. Second operand 7 states. [2018-07-23 13:37:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:23,460 INFO L93 Difference]: Finished difference Result 320 states and 559 transitions. [2018-07-23 13:37:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:23,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:23,463 INFO L225 Difference]: With dead ends: 320 [2018-07-23 13:37:23,463 INFO L226 Difference]: Without dead ends: 318 [2018-07-23 13:37:23,464 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-07-23 13:37:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2018-07-23 13:37:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-23 13:37:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 503 transitions. [2018-07-23 13:37:23,582 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 503 transitions. Word has length 11 [2018-07-23 13:37:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 503 transitions. [2018-07-23 13:37:23,582 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 503 transitions. [2018-07-23 13:37:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:23,583 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,583 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,583 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-07-23 13:37:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:23,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:23,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,597 INFO L185 omatonBuilderFactory]: Interpolants [19107#true, 19108#false, 19109#(<= product_end1 product_next), 19110#(<= product_end1 product_begin0), 19111#(<= (+ product_begin1 1) product_begin0), 19112#(<= (+ product_begin1 1) product_working0), 19113#(<= (+ product_working1 1) product_working0)] [2018-07-23 13:37:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:23,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:23,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:23,599 INFO L87 Difference]: Start difference. First operand 281 states and 503 transitions. Second operand 7 states. [2018-07-23 13:37:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:23,847 INFO L93 Difference]: Finished difference Result 333 states and 581 transitions. [2018-07-23 13:37:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:23,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:23,850 INFO L225 Difference]: With dead ends: 333 [2018-07-23 13:37:23,850 INFO L226 Difference]: Without dead ends: 331 [2018-07-23 13:37:23,851 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-23 13:37:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 285. [2018-07-23 13:37:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-23 13:37:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 510 transitions. [2018-07-23 13:37:23,975 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 510 transitions. Word has length 11 [2018-07-23 13:37:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:23,975 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 510 transitions. [2018-07-23 13:37:23,975 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 510 transitions. [2018-07-23 13:37:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:23,976 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:23,978 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:23,978 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-07-23 13:37:23,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:23,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:23,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,992 INFO L185 omatonBuilderFactory]: Interpolants [20368#(<= (+ product_begin1 1) product_begin0), 20369#(<= (+ product_working1 1) product_begin0), 20370#(<= (+ product_working1 1) product_working0), 20364#true, 20365#false, 20366#(<= product_end1 product_next), 20367#(<= product_end1 product_begin0)] [2018-07-23 13:37:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:23,993 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:23,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:23,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:23,993 INFO L87 Difference]: Start difference. First operand 285 states and 510 transitions. Second operand 7 states. [2018-07-23 13:37:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:24,271 INFO L93 Difference]: Finished difference Result 353 states and 620 transitions. [2018-07-23 13:37:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:24,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:24,273 INFO L225 Difference]: With dead ends: 353 [2018-07-23 13:37:24,274 INFO L226 Difference]: Without dead ends: 351 [2018-07-23 13:37:24,274 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-23 13:37:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 306. [2018-07-23 13:37:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-07-23 13:37:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 547 transitions. [2018-07-23 13:37:24,420 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 547 transitions. Word has length 11 [2018-07-23 13:37:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 547 transitions. [2018-07-23 13:37:24,421 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 547 transitions. [2018-07-23 13:37:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:24,422 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:24,422 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:24,422 INFO L414 AbstractCegarLoop]: === Iteration 30 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-07-23 13:37:24,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:24,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:24,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,438 INFO L185 omatonBuilderFactory]: Interpolants [21712#(<= (+ product_begin1 1) product_working0), 21713#(<= (+ product_working1 1) product_working0), 21707#true, 21708#false, 21709#(<= product_end1 product_next), 21710#(<= (+ product_begin1 1) product_next), 21711#(<= (+ product_begin1 1) product_begin0)] [2018-07-23 13:37:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,439 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:24,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:24,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:24,440 INFO L87 Difference]: Start difference. First operand 306 states and 547 transitions. Second operand 7 states. [2018-07-23 13:37:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:24,690 INFO L93 Difference]: Finished difference Result 331 states and 575 transitions. [2018-07-23 13:37:24,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:24,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:24,693 INFO L225 Difference]: With dead ends: 331 [2018-07-23 13:37:24,693 INFO L226 Difference]: Without dead ends: 329 [2018-07-23 13:37:24,694 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-23 13:37:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 300. [2018-07-23 13:37:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-07-23 13:37:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 534 transitions. [2018-07-23 13:37:24,844 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 534 transitions. Word has length 11 [2018-07-23 13:37:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:24,845 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 534 transitions. [2018-07-23 13:37:24,845 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 534 transitions. [2018-07-23 13:37:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:24,846 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:24,846 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:24,846 INFO L414 AbstractCegarLoop]: === Iteration 31 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-07-23 13:37:24,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:24,861 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:24,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,862 INFO L185 omatonBuilderFactory]: Interpolants [22992#(<= (+ product_working1 1) product_working0), 22986#true, 22987#false, 22988#(<= product_end1 product_next), 22989#(<= (+ product_begin1 1) product_next), 22990#(<= (+ product_begin1 1) product_begin0), 22991#(<= (+ product_working1 1) product_begin0)] [2018-07-23 13:37:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:24,862 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:24,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:24,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:24,863 INFO L87 Difference]: Start difference. First operand 300 states and 534 transitions. Second operand 7 states. [2018-07-23 13:37:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,130 INFO L93 Difference]: Finished difference Result 354 states and 618 transitions. [2018-07-23 13:37:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:25,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,132 INFO L225 Difference]: With dead ends: 354 [2018-07-23 13:37:25,132 INFO L226 Difference]: Without dead ends: 352 [2018-07-23 13:37:25,133 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-23 13:37:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-07-23 13:37:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-23 13:37:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 510 transitions. [2018-07-23 13:37:25,257 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 510 transitions. Word has length 11 [2018-07-23 13:37:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:25,257 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 510 transitions. [2018-07-23 13:37:25,257 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 510 transitions. [2018-07-23 13:37:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:37:25,258 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:25,258 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:25,258 INFO L414 AbstractCegarLoop]: === Iteration 32 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-07-23 13:37:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:25,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:37:25,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,272 INFO L185 omatonBuilderFactory]: Interpolants [24288#(<= (+ product_begin1 1) product_next), 24289#(<= (+ product_working1 1) product_next), 24290#(<= (+ product_working1 1) product_begin0), 24291#(<= (+ product_working1 1) product_working0), 24285#true, 24286#false, 24287#(<= product_end1 product_next)] [2018-07-23 13:37:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,273 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:25,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:25,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:25,274 INFO L87 Difference]: Start difference. First operand 286 states and 510 transitions. Second operand 7 states. [2018-07-23 13:37:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,509 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2018-07-23 13:37:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:25,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-07-23 13:37:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,511 INFO L225 Difference]: With dead ends: 344 [2018-07-23 13:37:25,512 INFO L226 Difference]: Without dead ends: 342 [2018-07-23 13:37:25,512 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-23 13:37:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2018-07-23 13:37:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-23 13:37:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 496 transitions. [2018-07-23 13:37:25,650 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 496 transitions. Word has length 11 [2018-07-23 13:37:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:25,650 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 496 transitions. [2018-07-23 13:37:25,650 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 496 transitions. [2018-07-23 13:37:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:25,652 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:25,652 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:25,652 INFO L414 AbstractCegarLoop]: === Iteration 33 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1894600283, now seen corresponding path program 1 times [2018-07-23 13:37:25,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:25,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:25,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,690 INFO L185 omatonBuilderFactory]: Interpolants [25552#true, 25553#false, 25554#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 25555#(and (<= (* 2 product_end0) (+ product_begin0 product_end1)) (= product_end0 product_begin1)), 25556#(and (= product_end0 product_begin1) (<= (+ (* 2 product_end0) 1) (+ product_begin0 product_end1))), 25557#(<= (+ product_begin1 2) product_end1), 25558#(<= (+ product_begin1 1) product_end1)] [2018-07-23 13:37:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:25,690 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:25,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:25,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:25,691 INFO L87 Difference]: Start difference. First operand 279 states and 496 transitions. Second operand 7 states. [2018-07-23 13:37:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:25,960 INFO L93 Difference]: Finished difference Result 634 states and 1102 transitions. [2018-07-23 13:37:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:37:25,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:37:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:25,963 INFO L225 Difference]: With dead ends: 634 [2018-07-23 13:37:25,963 INFO L226 Difference]: Without dead ends: 356 [2018-07-23 13:37:25,965 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-07-23 13:37:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 339. [2018-07-23 13:37:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-23 13:37:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 589 transitions. [2018-07-23 13:37:26,135 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 589 transitions. Word has length 12 [2018-07-23 13:37:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:26,135 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 589 transitions. [2018-07-23 13:37:26,135 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 589 transitions. [2018-07-23 13:37:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:26,136 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:26,137 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:26,137 INFO L414 AbstractCegarLoop]: === Iteration 34 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1217022044, now seen corresponding path program 1 times [2018-07-23 13:37:26,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:26,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:26,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,166 INFO L185 omatonBuilderFactory]: Interpolants [27511#true, 27512#false, 27513#(<= 1 product_workload), 27514#(and (= product_next product_end0) (<= (+ product_begin0 2) (+ product_workload product_end0))), 27515#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 27516#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 27517#(not (= product_working0 product_next)), 27518#(not (= product_working0 product_begin1)), 27519#(not (= product_working0 product_working1))] [2018-07-23 13:37:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,166 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:26,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:26,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:26,167 INFO L87 Difference]: Start difference. First operand 339 states and 589 transitions. Second operand 9 states. [2018-07-23 13:37:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:26,485 INFO L93 Difference]: Finished difference Result 433 states and 739 transitions. [2018-07-23 13:37:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:37:26,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:37:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:26,488 INFO L225 Difference]: With dead ends: 433 [2018-07-23 13:37:26,488 INFO L226 Difference]: Without dead ends: 431 [2018-07-23 13:37:26,488 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-07-23 13:37:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 396. [2018-07-23 13:37:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-23 13:37:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 693 transitions. [2018-07-23 13:37:26,661 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 693 transitions. Word has length 12 [2018-07-23 13:37:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:26,661 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 693 transitions. [2018-07-23 13:37:26,661 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 693 transitions. [2018-07-23 13:37:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:26,662 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:26,662 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:26,662 INFO L414 AbstractCegarLoop]: === Iteration 35 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496441, now seen corresponding path program 2 times [2018-07-23 13:37:26,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:26,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:26,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,679 INFO L185 omatonBuilderFactory]: Interpolants [29204#true, 29205#false, 29206#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 29207#(and (<= (* 2 product_end0) (+ product_begin0 product_end1)) (= product_begin1 product_end0)), 29208#(<= (+ product_end0 product_begin1) (+ product_begin0 product_end1 1)), 29209#(<= product_end0 (+ product_begin0 1)), 29210#(<= product_end0 product_begin0)] [2018-07-23 13:37:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:26,680 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:26,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:26,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:26,680 INFO L87 Difference]: Start difference. First operand 396 states and 693 transitions. Second operand 7 states. [2018-07-23 13:37:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,022 INFO L93 Difference]: Finished difference Result 897 states and 1547 transitions. [2018-07-23 13:37:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:37:27,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:37:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,025 INFO L225 Difference]: With dead ends: 897 [2018-07-23 13:37:27,025 INFO L226 Difference]: Without dead ends: 502 [2018-07-23 13:37:27,027 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-07-23 13:37:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 435. [2018-07-23 13:37:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-07-23 13:37:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 751 transitions. [2018-07-23 13:37:27,254 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 751 transitions. Word has length 12 [2018-07-23 13:37:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:27,254 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 751 transitions. [2018-07-23 13:37:27,254 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 751 transitions. [2018-07-23 13:37:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:27,255 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:27,255 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:27,255 INFO L414 AbstractCegarLoop]: === Iteration 36 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-07-23 13:37:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:27,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:27,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,278 INFO L185 omatonBuilderFactory]: Interpolants [31888#(and (= product_next product_end0) (<= (+ product_begin0 2) (+ product_workload product_end0))), 31889#(and (<= (+ product_begin0 2) product_end1) (= product_end1 product_next)), 31890#(<= (+ product_begin0 2) product_next), 31891#(<= (+ product_begin0 2) product_begin1), 31892#(not (= product_working0 product_begin1)), 31893#(not (= product_working0 product_working1)), 31885#true, 31886#false, 31887#(<= 1 product_workload)] [2018-07-23 13:37:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,278 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:27,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:27,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:27,279 INFO L87 Difference]: Start difference. First operand 435 states and 751 transitions. Second operand 9 states. [2018-07-23 13:37:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:27,655 INFO L93 Difference]: Finished difference Result 481 states and 818 transitions. [2018-07-23 13:37:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:27,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:37:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:27,658 INFO L225 Difference]: With dead ends: 481 [2018-07-23 13:37:27,659 INFO L226 Difference]: Without dead ends: 479 [2018-07-23 13:37:27,660 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:37:27,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-23 13:37:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2018-07-23 13:37:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-07-23 13:37:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 764 transitions. [2018-07-23 13:37:27,926 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 764 transitions. Word has length 12 [2018-07-23 13:37:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:27,926 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 764 transitions. [2018-07-23 13:37:27,927 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 764 transitions. [2018-07-23 13:37:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:37:27,927 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:27,928 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:27,928 INFO L414 AbstractCegarLoop]: === Iteration 37 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-07-23 13:37:27,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:27,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:27,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,948 INFO L185 omatonBuilderFactory]: Interpolants [33764#true, 33765#false, 33766#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 33767#(<= (+ (* 2 product_end1) 1) (+ product_workload product_next product_begin1)), 33768#(<= (+ product_begin1 3) (+ product_workload product_next)), 33769#(<= (+ product_working1 3) (+ product_workload product_next)), 33770#(<= (+ product_working1 3) product_next), 33771#(<= (+ product_working1 3) product_begin0), 33772#(<= (+ product_working1 3) product_working0)] [2018-07-23 13:37:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:27,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:27,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:27,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:27,951 INFO L87 Difference]: Start difference. First operand 444 states and 764 transitions. Second operand 9 states. [2018-07-23 13:37:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:28,446 INFO L93 Difference]: Finished difference Result 515 states and 880 transitions. [2018-07-23 13:37:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:28,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 13:37:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:28,450 INFO L225 Difference]: With dead ends: 515 [2018-07-23 13:37:28,450 INFO L226 Difference]: Without dead ends: 513 [2018-07-23 13:37:28,450 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-07-23 13:37:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 468. [2018-07-23 13:37:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-07-23 13:37:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 808 transitions. [2018-07-23 13:37:28,709 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 808 transitions. Word has length 12 [2018-07-23 13:37:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:28,709 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 808 transitions. [2018-07-23 13:37:28,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 808 transitions. [2018-07-23 13:37:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:37:28,710 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:28,710 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:28,710 INFO L414 AbstractCegarLoop]: === Iteration 38 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash -317442274, now seen corresponding path program 1 times [2018-07-23 13:37:28,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:28,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:28,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,733 INFO L185 omatonBuilderFactory]: Interpolants [35760#(and (<= (+ product_working0 3) (+ product_workload product_end1)) (= product_next product_end1)), 35761#(not (= product_working0 product_next)), 35762#(not (= product_working0 product_begin1)), 35763#(not (= product_working0 product_working1)), 35755#true, 35756#false, 35757#(<= 1 product_workload), 35758#(and (= product_next product_end0) (<= (+ product_begin0 3) (+ (* 2 product_workload) product_end0))), 35759#(and (<= (+ product_begin0 3) (+ product_workload product_end1)) (= product_next product_end1))] [2018-07-23 13:37:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:28,733 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:28,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:28,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:28,734 INFO L87 Difference]: Start difference. First operand 468 states and 808 transitions. Second operand 9 states. [2018-07-23 13:37:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:29,242 INFO L93 Difference]: Finished difference Result 550 states and 930 transitions. [2018-07-23 13:37:29,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:29,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 13:37:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:29,246 INFO L225 Difference]: With dead ends: 550 [2018-07-23 13:37:29,246 INFO L226 Difference]: Without dead ends: 548 [2018-07-23 13:37:29,247 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:37:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-23 13:37:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 483. [2018-07-23 13:37:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-07-23 13:37:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 836 transitions. [2018-07-23 13:37:29,529 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 836 transitions. Word has length 13 [2018-07-23 13:37:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:29,529 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 836 transitions. [2018-07-23 13:37:29,529 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 836 transitions. [2018-07-23 13:37:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:29,533 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:29,533 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:29,534 INFO L414 AbstractCegarLoop]: === Iteration 39 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-07-23 13:37:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:29,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:29,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,548 INFO L185 omatonBuilderFactory]: Interpolants [37872#(= product_end0 product_next), 37873#(= product_end0 product_begin1), 37874#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 37875#(<= (+ product_begin0 2) product_begin1), 37876#(<= (+ product_working0 2) product_begin1), 37877#(<= (+ product_working0 2) product_working1), 37870#true, 37871#false] [2018-07-23 13:37:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:29,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:29,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:29,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:29,549 INFO L87 Difference]: Start difference. First operand 483 states and 836 transitions. Second operand 8 states. [2018-07-23 13:37:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:29,920 INFO L93 Difference]: Finished difference Result 528 states and 903 transitions. [2018-07-23 13:37:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:29,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:29,923 INFO L225 Difference]: With dead ends: 528 [2018-07-23 13:37:29,924 INFO L226 Difference]: Without dead ends: 526 [2018-07-23 13:37:29,924 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-07-23 13:37:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 487. [2018-07-23 13:37:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-23 13:37:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-07-23 13:37:30,184 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-07-23 13:37:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,184 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-07-23 13:37:30,184 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-07-23 13:37:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:30,185 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,185 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:30,185 INFO L414 AbstractCegarLoop]: === Iteration 40 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-07-23 13:37:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:30,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,206 INFO L185 omatonBuilderFactory]: Interpolants [39920#true, 39921#false, 39922#(= product_end0 product_next), 39923#(= product_begin1 product_end0), 39924#(<= (+ product_end0 1) product_begin1), 39925#(<= (+ product_begin0 2) product_begin1), 39926#(<= (+ product_working0 2) product_begin1), 39927#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,207 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:30,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:30,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:30,208 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-07-23 13:37:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:30,623 INFO L93 Difference]: Finished difference Result 562 states and 960 transitions. [2018-07-23 13:37:30,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:30,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:30,626 INFO L225 Difference]: With dead ends: 562 [2018-07-23 13:37:30,627 INFO L226 Difference]: Without dead ends: 560 [2018-07-23 13:37:30,627 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-07-23 13:37:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487. [2018-07-23 13:37:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-23 13:37:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions. [2018-07-23 13:37:30,890 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14 [2018-07-23 13:37:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:30,891 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions. [2018-07-23 13:37:30,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions. [2018-07-23 13:37:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:30,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:30,892 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:30,892 INFO L414 AbstractCegarLoop]: === Iteration 41 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1602335980, now seen corresponding path program 3 times [2018-07-23 13:37:30,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:30,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:30,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,906 INFO L185 omatonBuilderFactory]: Interpolants [42048#(<= (+ product_end0 1) product_begin1), 42049#(<= (+ product_begin0 2) product_begin1), 42050#(<= (+ product_begin0 2) product_working1), 42051#(<= (+ product_working0 2) product_working1), 42044#true, 42045#false, 42046#(= product_end0 product_next), 42047#(= product_begin1 product_end0)] [2018-07-23 13:37:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:30,907 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:30,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:30,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:30,908 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states. [2018-07-23 13:37:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:31,361 INFO L93 Difference]: Finished difference Result 554 states and 945 transitions. [2018-07-23 13:37:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:31,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:31,364 INFO L225 Difference]: With dead ends: 554 [2018-07-23 13:37:31,364 INFO L226 Difference]: Without dead ends: 552 [2018-07-23 13:37:31,365 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-07-23 13:37:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481. [2018-07-23 13:37:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-07-23 13:37:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 832 transitions. [2018-07-23 13:37:31,601 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 832 transitions. Word has length 14 [2018-07-23 13:37:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 832 transitions. [2018-07-23 13:37:31,601 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 832 transitions. [2018-07-23 13:37:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:31,602 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:31,602 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:31,602 INFO L414 AbstractCegarLoop]: === Iteration 42 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -245567750, now seen corresponding path program 4 times [2018-07-23 13:37:31,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:31,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:31,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,620 INFO L185 omatonBuilderFactory]: Interpolants [44144#(<= (+ product_begin0 2) product_working1), 44145#(<= (+ product_working0 2) product_working1), 44138#true, 44139#false, 44140#(= product_end0 product_next), 44141#(= product_begin1 product_end0), 44142#(<= (+ product_end0 1) product_begin1), 44143#(<= (+ product_end0 1) product_working1)] [2018-07-23 13:37:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:31,620 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:31,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:31,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:31,621 INFO L87 Difference]: Start difference. First operand 481 states and 832 transitions. Second operand 8 states. [2018-07-23 13:37:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,024 INFO L93 Difference]: Finished difference Result 547 states and 937 transitions. [2018-07-23 13:37:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:32,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,027 INFO L225 Difference]: With dead ends: 547 [2018-07-23 13:37:32,028 INFO L226 Difference]: Without dead ends: 545 [2018-07-23 13:37:32,028 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-07-23 13:37:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 488. [2018-07-23 13:37:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-07-23 13:37:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 844 transitions. [2018-07-23 13:37:32,308 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 844 transitions. Word has length 14 [2018-07-23 13:37:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:32,308 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 844 transitions. [2018-07-23 13:37:32,308 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 844 transitions. [2018-07-23 13:37:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:32,309 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:32,309 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:32,309 INFO L414 AbstractCegarLoop]: === Iteration 43 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:32,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-07-23 13:37:32,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:32,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:32,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,336 INFO L185 omatonBuilderFactory]: Interpolants [46240#(<= (+ product_working0 1) product_begin1), 46241#(<= (+ product_working0 2) product_begin1), 46242#(<= (+ product_working0 2) product_working1), 46234#true, 46235#false, 46236#(= product_end0 product_next), 46237#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 46238#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 46239#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_begin1))] [2018-07-23 13:37:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:32,337 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:32,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:32,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:32,337 INFO L87 Difference]: Start difference. First operand 488 states and 844 transitions. Second operand 9 states. [2018-07-23 13:37:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:32,750 INFO L93 Difference]: Finished difference Result 545 states and 922 transitions. [2018-07-23 13:37:32,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:32,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-07-23 13:37:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:32,754 INFO L225 Difference]: With dead ends: 545 [2018-07-23 13:37:32,754 INFO L226 Difference]: Without dead ends: 543 [2018-07-23 13:37:32,755 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-23 13:37:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 473. [2018-07-23 13:37:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-23 13:37:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 820 transitions. [2018-07-23 13:37:33,023 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 820 transitions. Word has length 14 [2018-07-23 13:37:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:33,023 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 820 transitions. [2018-07-23 13:37:33,024 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 820 transitions. [2018-07-23 13:37:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:37:33,024 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:33,024 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:33,025 INFO L414 AbstractCegarLoop]: === Iteration 44 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-07-23 13:37:33,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:33,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,039 INFO L185 omatonBuilderFactory]: Interpolants [48291#true, 48292#false, 48293#(= product_end0 product_next), 48294#(and (= product_end0 product_next) (<= (+ product_begin0 1) product_end0)), 48295#(and (= product_end0 product_begin1) (<= (+ product_begin0 1) product_end0)), 48296#(<= (+ product_begin0 2) product_begin1), 48297#(<= (+ product_working0 2) product_begin1), 48298#(<= (+ product_working0 2) product_working1)] [2018-07-23 13:37:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:33,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:33,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:33,040 INFO L87 Difference]: Start difference. First operand 473 states and 820 transitions. Second operand 8 states. [2018-07-23 13:37:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:33,440 INFO L93 Difference]: Finished difference Result 535 states and 908 transitions. [2018-07-23 13:37:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:33,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:37:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:33,444 INFO L225 Difference]: With dead ends: 535 [2018-07-23 13:37:33,444 INFO L226 Difference]: Without dead ends: 533 [2018-07-23 13:37:33,444 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:37:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-07-23 13:37:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 469. [2018-07-23 13:37:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-23 13:37:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 814 transitions. [2018-07-23 13:37:33,712 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 814 transitions. Word has length 14 [2018-07-23 13:37:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:33,712 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 814 transitions. [2018-07-23 13:37:33,712 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 814 transitions. [2018-07-23 13:37:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:33,713 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:33,713 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:33,713 INFO L414 AbstractCegarLoop]: === Iteration 45 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1810259450, now seen corresponding path program 1 times [2018-07-23 13:37:33,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:33,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:33,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,735 INFO L185 omatonBuilderFactory]: Interpolants [50320#(and (<= (+ product_begin0 product_workload) product_end0) (= product_end1 product_next)), 50321#(and (<= (+ product_begin0 product_workload) (+ product_end0 1)) (= product_end1 product_next)), 50322#(and (= product_end1 product_next) (<= product_workload 1)), 50323#(<= product_workload 1), 50324#(<= product_end1 (+ product_begin1 1)), 50325#(<= product_end1 product_begin1), 50317#true, 50318#false, 50319#(<= (+ product_begin0 product_workload) product_end0)] [2018-07-23 13:37:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:33,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:37:33,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:37:33,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:37:33,736 INFO L87 Difference]: Start difference. First operand 469 states and 814 transitions. Second operand 9 states. [2018-07-23 13:37:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:34,338 INFO L93 Difference]: Finished difference Result 1268 states and 2153 transitions. [2018-07-23 13:37:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:34,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-23 13:37:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:34,343 INFO L225 Difference]: With dead ends: 1268 [2018-07-23 13:37:34,343 INFO L226 Difference]: Without dead ends: 764 [2018-07-23 13:37:34,344 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-07-23 13:37:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 651. [2018-07-23 13:37:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-23 13:37:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1121 transitions. [2018-07-23 13:37:34,724 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1121 transitions. Word has length 15 [2018-07-23 13:37:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:34,725 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1121 transitions. [2018-07-23 13:37:34,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:37:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1121 transitions. [2018-07-23 13:37:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:34,726 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:34,726 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:34,726 INFO L414 AbstractCegarLoop]: === Iteration 46 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash 765271427, now seen corresponding path program 1 times [2018-07-23 13:37:34,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:34,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:34,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:34,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:34,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:34,744 INFO L185 omatonBuilderFactory]: Interpolants [54194#true, 54195#false, 54196#(<= (+ product_begin0 product_workload) product_end0), 54197#(and (<= (+ product_begin0 product_workload) product_end0) (= product_end1 product_next)), 54198#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1)), 54199#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1 1)), 54200#(<= product_end1 (+ product_begin1 1)), 54201#(<= product_end1 product_begin1)] [2018-07-23 13:37:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:34,744 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:37:34,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:37:34,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:37:34,745 INFO L87 Difference]: Start difference. First operand 651 states and 1121 transitions. Second operand 8 states. [2018-07-23 13:37:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:35,379 INFO L93 Difference]: Finished difference Result 1561 states and 2653 transitions. [2018-07-23 13:37:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:35,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-07-23 13:37:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:35,384 INFO L225 Difference]: With dead ends: 1561 [2018-07-23 13:37:35,384 INFO L226 Difference]: Without dead ends: 911 [2018-07-23 13:37:35,385 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:37:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-07-23 13:37:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 651. [2018-07-23 13:37:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-23 13:37:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1114 transitions. [2018-07-23 13:37:35,671 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1114 transitions. Word has length 15 [2018-07-23 13:37:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:35,671 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1114 transitions. [2018-07-23 13:37:35,671 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:37:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1114 transitions. [2018-07-23 13:37:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:35,672 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:35,672 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:35,673 INFO L414 AbstractCegarLoop]: === Iteration 47 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1161913671, now seen corresponding path program 1 times [2018-07-23 13:37:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,698 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:35,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:35,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,699 INFO L185 omatonBuilderFactory]: Interpolants [58642#true, 58643#false, 58644#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 58645#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 58646#(and (= product_end0 product_next) (<= (+ product_begin0 3) (+ product_workload product_end0))), 58647#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 58648#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 58649#(not (= product_working0 product_next)), 58650#(not (= product_working0 product_begin1)), 58651#(not (= product_working0 product_working1))] [2018-07-23 13:37:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:35,700 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:35,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:35,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:35,700 INFO L87 Difference]: Start difference. First operand 651 states and 1114 transitions. Second operand 10 states. [2018-07-23 13:37:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:36,286 INFO L93 Difference]: Finished difference Result 756 states and 1259 transitions. [2018-07-23 13:37:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:36,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:36,290 INFO L225 Difference]: With dead ends: 756 [2018-07-23 13:37:36,290 INFO L226 Difference]: Without dead ends: 754 [2018-07-23 13:37:36,291 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:37:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-07-23 13:37:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 687. [2018-07-23 13:37:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-07-23 13:37:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1172 transitions. [2018-07-23 13:37:36,557 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1172 transitions. Word has length 15 [2018-07-23 13:37:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:36,558 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1172 transitions. [2018-07-23 13:37:36,558 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1172 transitions. [2018-07-23 13:37:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:36,559 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:36,559 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:36,559 INFO L414 AbstractCegarLoop]: === Iteration 48 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-07-23 13:37:36,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:36,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:36,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,578 INFO L185 omatonBuilderFactory]: Interpolants [61558#true, 61559#false, 61560#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 61561#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 61562#(and (= product_end0 product_next) (<= (+ product_begin0 3) (+ product_workload product_end0))), 61563#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 61564#(<= (+ product_begin0 3) product_next), 61565#(<= (+ product_begin0 3) product_begin1), 61566#(not (= product_working0 product_begin1)), 61567#(not (= product_working0 product_working1))] [2018-07-23 13:37:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:36,578 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:36,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:36,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:36,579 INFO L87 Difference]: Start difference. First operand 687 states and 1172 transitions. Second operand 10 states. [2018-07-23 13:37:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:37,176 INFO L93 Difference]: Finished difference Result 826 states and 1381 transitions. [2018-07-23 13:37:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:37,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:37,181 INFO L225 Difference]: With dead ends: 826 [2018-07-23 13:37:37,181 INFO L226 Difference]: Without dead ends: 824 [2018-07-23 13:37:37,182 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-07-23 13:37:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 720. [2018-07-23 13:37:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-07-23 13:37:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1226 transitions. [2018-07-23 13:37:37,609 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1226 transitions. Word has length 15 [2018-07-23 13:37:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:37,609 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1226 transitions. [2018-07-23 13:37:37,609 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1226 transitions. [2018-07-23 13:37:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:37,610 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:37,611 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:37,611 INFO L414 AbstractCegarLoop]: === Iteration 49 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times [2018-07-23 13:37:37,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:37,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:37,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,632 INFO L185 omatonBuilderFactory]: Interpolants [64688#(<= (+ product_begin0 3) product_next), 64689#(<= (+ product_begin0 3) product_begin1), 64690#(<= (+ product_begin0 3) product_working1), 64691#(not (= product_working0 product_working1)), 64682#true, 64683#false, 64684#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 64685#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 64686#(<= (+ product_begin0 3) (+ product_workload product_next)), 64687#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next))] [2018-07-23 13:37:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:37,632 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:37,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:37,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:37,633 INFO L87 Difference]: Start difference. First operand 720 states and 1226 transitions. Second operand 10 states. [2018-07-23 13:37:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:38,254 INFO L93 Difference]: Finished difference Result 843 states and 1413 transitions. [2018-07-23 13:37:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:38,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:38,259 INFO L225 Difference]: With dead ends: 843 [2018-07-23 13:37:38,260 INFO L226 Difference]: Without dead ends: 841 [2018-07-23 13:37:38,261 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-07-23 13:37:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 770. [2018-07-23 13:37:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-07-23 13:37:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1300 transitions. [2018-07-23 13:37:38,688 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1300 transitions. Word has length 15 [2018-07-23 13:37:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:38,689 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1300 transitions. [2018-07-23 13:37:38,689 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1300 transitions. [2018-07-23 13:37:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:38,690 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:38,690 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:38,690 INFO L414 AbstractCegarLoop]: === Iteration 50 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-07-23 13:37:38,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:38,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:38,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,704 INFO L185 omatonBuilderFactory]: Interpolants [67953#(<= (+ product_begin1 2) product_next), 67952#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 67955#(<= (+ product_begin1 2) product_working0), 67954#(<= (+ product_begin1 2) product_begin0), 67957#(not (= product_working1 product_working0)), 67956#(<= (+ product_begin1 1) product_working0), 67949#false, 67948#true, 67951#(<= (+ product_begin1 2) (+ product_workload product_next)), 67950#(<= 1 product_workload)] [2018-07-23 13:37:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:38,704 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:38,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:38,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:38,705 INFO L87 Difference]: Start difference. First operand 770 states and 1300 transitions. Second operand 10 states. [2018-07-23 13:37:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:39,418 INFO L93 Difference]: Finished difference Result 960 states and 1623 transitions. [2018-07-23 13:37:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:39,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:39,423 INFO L225 Difference]: With dead ends: 960 [2018-07-23 13:37:39,423 INFO L226 Difference]: Without dead ends: 958 [2018-07-23 13:37:39,424 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2018-07-23 13:37:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 837. [2018-07-23 13:37:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-07-23 13:37:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1422 transitions. [2018-07-23 13:37:39,848 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1422 transitions. Word has length 15 [2018-07-23 13:37:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1422 transitions. [2018-07-23 13:37:39,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1422 transitions. [2018-07-23 13:37:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:39,849 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:39,849 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:39,849 INFO L414 AbstractCegarLoop]: === Iteration 51 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times [2018-07-23 13:37:39,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:39,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:39,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:39,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:39,867 INFO L185 omatonBuilderFactory]: Interpolants [71575#false, 71574#true, 71577#(<= (+ product_begin1 2) (+ product_workload product_next)), 71576#(<= 1 product_workload), 71579#(<= (+ product_begin1 2) product_next), 71578#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 71581#(<= (+ product_begin1 1) product_begin0), 71580#(<= (+ product_begin1 2) product_begin0), 71583#(not (= product_working1 product_working0)), 71582#(<= (+ product_begin1 1) product_working0)] [2018-07-23 13:37:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:39,868 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:39,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:39,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:39,868 INFO L87 Difference]: Start difference. First operand 837 states and 1422 transitions. Second operand 10 states. [2018-07-23 13:37:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:40,780 INFO L93 Difference]: Finished difference Result 1027 states and 1720 transitions. [2018-07-23 13:37:40,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:37:40,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:40,786 INFO L225 Difference]: With dead ends: 1027 [2018-07-23 13:37:40,786 INFO L226 Difference]: Without dead ends: 1025 [2018-07-23 13:37:40,787 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:37:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-07-23 13:37:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 849. [2018-07-23 13:37:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-07-23 13:37:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1445 transitions. [2018-07-23 13:37:41,306 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1445 transitions. Word has length 15 [2018-07-23 13:37:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:41,307 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1445 transitions. [2018-07-23 13:37:41,307 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1445 transitions. [2018-07-23 13:37:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:41,308 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:41,308 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:37:41,308 INFO L414 AbstractCegarLoop]: === Iteration 52 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-07-23 13:37:41,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:41,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:41,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,326 INFO L185 omatonBuilderFactory]: Interpolants [75379#false, 75378#true, 75381#(<= (+ product_begin1 2) (+ product_workload product_next)), 75380#(<= 1 product_workload), 75383#(<= (+ product_begin1 2) product_next), 75382#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 75385#(<= (+ product_begin1 1) product_begin0), 75384#(<= (+ product_begin1 2) product_begin0), 75387#(not (= product_working1 product_working0)), 75386#(not (= product_working1 product_begin0))] [2018-07-23 13:37:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:41,326 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:41,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:41,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:41,327 INFO L87 Difference]: Start difference. First operand 849 states and 1445 transitions. Second operand 10 states. [2018-07-23 13:37:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:42,125 INFO L93 Difference]: Finished difference Result 1032 states and 1733 transitions. [2018-07-23 13:37:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:37:42,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:42,130 INFO L225 Difference]: With dead ends: 1032 [2018-07-23 13:37:42,131 INFO L226 Difference]: Without dead ends: 1030 [2018-07-23 13:37:42,131 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:37:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-07-23 13:37:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 869. [2018-07-23 13:37:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-07-23 13:37:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1477 transitions. [2018-07-23 13:37:42,613 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1477 transitions. Word has length 15 [2018-07-23 13:37:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:42,613 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1477 transitions. [2018-07-23 13:37:42,613 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1477 transitions. [2018-07-23 13:37:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:42,615 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:42,615 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:42,615 INFO L414 AbstractCegarLoop]: === Iteration 53 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times [2018-07-23 13:37:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,627 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:42,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:42,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,628 INFO L185 omatonBuilderFactory]: Interpolants [79233#(<= (+ product_begin1 2) (+ product_workload product_next)), 79232#(<= 1 product_workload), 79235#(<= (+ product_begin1 2) product_next), 79234#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 79237#(<= (+ product_begin1 1) product_begin0), 79236#(<= (+ product_begin1 1) product_next), 79239#(not (= product_working1 product_working0)), 79238#(<= (+ product_begin1 1) product_working0), 79231#false, 79230#true] [2018-07-23 13:37:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:42,629 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:42,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:42,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:42,629 INFO L87 Difference]: Start difference. First operand 869 states and 1477 transitions. Second operand 10 states. [2018-07-23 13:37:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:43,243 INFO L93 Difference]: Finished difference Result 945 states and 1593 transitions. [2018-07-23 13:37:43,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:43,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:43,247 INFO L225 Difference]: With dead ends: 945 [2018-07-23 13:37:43,247 INFO L226 Difference]: Without dead ends: 943 [2018-07-23 13:37:43,248 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-07-23 13:37:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 869. [2018-07-23 13:37:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-07-23 13:37:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1474 transitions. [2018-07-23 13:37:43,604 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1474 transitions. Word has length 15 [2018-07-23 13:37:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:43,604 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1474 transitions. [2018-07-23 13:37:43,604 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1474 transitions. [2018-07-23 13:37:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:43,605 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:43,606 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:43,606 INFO L414 AbstractCegarLoop]: === Iteration 54 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times [2018-07-23 13:37:43,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:43,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:43,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,619 INFO L185 omatonBuilderFactory]: Interpolants [82883#false, 82882#true, 82885#(<= (+ product_begin1 2) (+ product_workload product_next)), 82884#(<= 1 product_workload), 82887#(<= (+ product_begin1 2) product_next), 82886#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 82889#(<= (+ product_begin1 1) product_begin0), 82888#(<= (+ product_begin1 1) product_next), 82891#(not (= product_working1 product_working0)), 82890#(not (= product_working1 product_begin0))] [2018-07-23 13:37:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:43,619 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:43,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:43,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:43,620 INFO L87 Difference]: Start difference. First operand 869 states and 1474 transitions. Second operand 10 states. [2018-07-23 13:37:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:44,293 INFO L93 Difference]: Finished difference Result 978 states and 1648 transitions. [2018-07-23 13:37:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:44,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:44,298 INFO L225 Difference]: With dead ends: 978 [2018-07-23 13:37:44,298 INFO L226 Difference]: Without dead ends: 976 [2018-07-23 13:37:44,299 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:37:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-07-23 13:37:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 871. [2018-07-23 13:37:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-07-23 13:37:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1477 transitions. [2018-07-23 13:37:44,644 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1477 transitions. Word has length 15 [2018-07-23 13:37:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:44,644 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1477 transitions. [2018-07-23 13:37:44,644 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1477 transitions. [2018-07-23 13:37:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:44,645 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:44,645 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:44,645 INFO L414 AbstractCegarLoop]: === Iteration 55 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times [2018-07-23 13:37:44,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:44,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:44,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,655 INFO L185 omatonBuilderFactory]: Interpolants [86609#(<= (+ product_begin1 2) product_next), 86608#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 86611#(not (= product_working1 product_next)), 86610#(<= (+ product_begin1 1) product_next), 86613#(not (= product_working1 product_working0)), 86612#(not (= product_working1 product_begin0)), 86605#false, 86604#true, 86607#(<= (+ product_begin1 2) (+ product_workload product_next)), 86606#(<= 1 product_workload)] [2018-07-23 13:37:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:44,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:44,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:44,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:44,656 INFO L87 Difference]: Start difference. First operand 871 states and 1477 transitions. Second operand 10 states. [2018-07-23 13:37:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:45,174 INFO L93 Difference]: Finished difference Result 1018 states and 1716 transitions. [2018-07-23 13:37:45,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:37:45,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:45,179 INFO L225 Difference]: With dead ends: 1018 [2018-07-23 13:37:45,179 INFO L226 Difference]: Without dead ends: 1016 [2018-07-23 13:37:45,180 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:37:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-07-23 13:37:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 931. [2018-07-23 13:37:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-07-23 13:37:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1584 transitions. [2018-07-23 13:37:45,529 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1584 transitions. Word has length 15 [2018-07-23 13:37:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:45,529 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1584 transitions. [2018-07-23 13:37:45,529 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1584 transitions. [2018-07-23 13:37:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:45,530 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:45,531 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:45,531 INFO L414 AbstractCegarLoop]: === Iteration 56 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times [2018-07-23 13:37:45,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:45,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:45,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,543 INFO L185 omatonBuilderFactory]: Interpolants [90545#(<= (+ product_begin1 2) (+ product_workload product_next)), 90544#(<= 1 product_workload), 90547#(and (<= (+ product_begin1 1) product_end0) (= product_end0 product_next)), 90546#(<= (+ product_begin1 1) (+ product_workload product_next)), 90549#(<= (+ product_begin1 1) product_begin0), 90548#(<= (+ product_begin1 1) product_next), 90551#(not (= product_working1 product_working0)), 90550#(<= (+ product_begin1 1) product_working0), 90543#false, 90542#true] [2018-07-23 13:37:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:45,544 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:45,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:45,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:45,544 INFO L87 Difference]: Start difference. First operand 931 states and 1584 transitions. Second operand 10 states. [2018-07-23 13:37:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:46,122 INFO L93 Difference]: Finished difference Result 1157 states and 1937 transitions. [2018-07-23 13:37:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:37:46,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:46,127 INFO L225 Difference]: With dead ends: 1157 [2018-07-23 13:37:46,127 INFO L226 Difference]: Without dead ends: 1155 [2018-07-23 13:37:46,128 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:37:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-07-23 13:37:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 976. [2018-07-23 13:37:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-07-23 13:37:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1662 transitions. [2018-07-23 13:37:46,497 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1662 transitions. Word has length 15 [2018-07-23 13:37:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:46,500 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1662 transitions. [2018-07-23 13:37:46,500 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1662 transitions. [2018-07-23 13:37:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:46,501 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:46,501 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:46,502 INFO L414 AbstractCegarLoop]: === Iteration 57 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:46,502 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times [2018-07-23 13:37:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:46,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:46,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,521 INFO L185 omatonBuilderFactory]: Interpolants [94849#(not (= product_working1 product_working0)), 94848#(not (= product_working1 product_begin0)), 94841#false, 94840#true, 94843#(<= (+ product_begin1 2) (+ product_workload product_next)), 94842#(<= 1 product_workload), 94845#(and (<= (+ product_begin1 1) product_end0) (= product_end0 product_next)), 94844#(<= (+ product_begin1 1) (+ product_workload product_next)), 94847#(<= (+ product_begin1 1) product_begin0), 94846#(<= (+ product_begin1 1) product_next)] [2018-07-23 13:37:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:46,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:46,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:46,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:46,522 INFO L87 Difference]: Start difference. First operand 976 states and 1662 transitions. Second operand 10 states. [2018-07-23 13:37:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:47,288 INFO L93 Difference]: Finished difference Result 1198 states and 2004 transitions. [2018-07-23 13:37:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:37:47,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:47,297 INFO L225 Difference]: With dead ends: 1198 [2018-07-23 13:37:47,297 INFO L226 Difference]: Without dead ends: 1196 [2018-07-23 13:37:47,302 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:37:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-07-23 13:37:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 998. [2018-07-23 13:37:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-07-23 13:37:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1695 transitions. [2018-07-23 13:37:47,692 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1695 transitions. Word has length 15 [2018-07-23 13:37:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:47,692 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1695 transitions. [2018-07-23 13:37:47,692 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:47,692 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1695 transitions. [2018-07-23 13:37:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:37:47,693 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:47,693 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:47,694 INFO L414 AbstractCegarLoop]: === Iteration 58 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times [2018-07-23 13:37:47,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:47,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:37:47,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,705 INFO L185 omatonBuilderFactory]: Interpolants [99267#false, 99266#true, 99269#(<= (+ product_begin1 2) (+ product_workload product_next)), 99268#(<= 1 product_workload), 99271#(and (<= (+ product_begin1 1) product_end0) (= product_end0 product_next)), 99270#(<= (+ product_begin1 1) (+ product_workload product_next)), 99273#(not (= product_working1 product_next)), 99272#(<= (+ product_begin1 1) product_next), 99275#(not (= product_working1 product_working0)), 99274#(not (= product_working1 product_begin0))] [2018-07-23 13:37:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:47,705 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:47,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:47,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:47,706 INFO L87 Difference]: Start difference. First operand 998 states and 1695 transitions. Second operand 10 states. [2018-07-23 13:37:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:48,275 INFO L93 Difference]: Finished difference Result 1161 states and 1935 transitions. [2018-07-23 13:37:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:37:48,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 13:37:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:48,279 INFO L225 Difference]: With dead ends: 1161 [2018-07-23 13:37:48,279 INFO L226 Difference]: Without dead ends: 1159 [2018-07-23 13:37:48,280 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:37:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-07-23 13:37:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1022. [2018-07-23 13:37:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-07-23 13:37:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1728 transitions. [2018-07-23 13:37:48,670 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1728 transitions. Word has length 15 [2018-07-23 13:37:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:48,670 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1728 transitions. [2018-07-23 13:37:48,670 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1728 transitions. [2018-07-23 13:37:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:48,672 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:48,672 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:48,672 INFO L414 AbstractCegarLoop]: === Iteration 59 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:48,672 INFO L82 PathProgramCache]: Analyzing trace with hash 415120859, now seen corresponding path program 1 times [2018-07-23 13:37:48,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:48,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:48,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,690 INFO L185 omatonBuilderFactory]: Interpolants [103681#(not (= product_working0 product_next)), 103680#(and (<= (+ product_working0 5) (+ product_workload product_end1)) (= product_next product_end1)), 103683#(not (= product_working0 product_working1)), 103682#(not (= product_working0 product_begin1)), 103675#false, 103674#true, 103677#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 103676#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 103679#(and (<= (+ product_begin0 5) (+ product_workload product_end1)) (= product_next product_end1)), 103678#(and (<= (+ product_begin0 5) (+ (* 2 product_workload) product_end0)) (= product_end0 product_next))] [2018-07-23 13:37:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:48,690 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:37:48,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:37:48,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:37:48,690 INFO L87 Difference]: Start difference. First operand 1022 states and 1728 transitions. Second operand 10 states. [2018-07-23 13:37:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:49,254 INFO L93 Difference]: Finished difference Result 1173 states and 1946 transitions. [2018-07-23 13:37:49,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:37:49,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-07-23 13:37:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:49,257 INFO L225 Difference]: With dead ends: 1173 [2018-07-23 13:37:49,257 INFO L226 Difference]: Without dead ends: 1171 [2018-07-23 13:37:49,258 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-07-23 13:37:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1065. [2018-07-23 13:37:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2018-07-23 13:37:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1806 transitions. [2018-07-23 13:37:49,679 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1806 transitions. Word has length 16 [2018-07-23 13:37:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:49,679 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1806 transitions. [2018-07-23 13:37:49,679 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:37:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1806 transitions. [2018-07-23 13:37:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:49,680 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:49,680 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:49,680 INFO L414 AbstractCegarLoop]: === Iteration 60 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1829543949, now seen corresponding path program 1 times [2018-07-23 13:37:49,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:49,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:49,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:49,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:49,692 INFO L185 omatonBuilderFactory]: Interpolants [108192#(<= product_end1 product_begin1), 108187#false, 108186#true, 108189#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1)), 108188#(<= product_end1 (+ product_workload product_begin1)), 108191#(<= product_end1 (+ product_begin1 1)), 108190#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1 1))] [2018-07-23 13:37:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:49,693 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:49,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:49,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:49,693 INFO L87 Difference]: Start difference. First operand 1065 states and 1806 transitions. Second operand 7 states. [2018-07-23 13:37:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:50,409 INFO L93 Difference]: Finished difference Result 2706 states and 4565 transitions. [2018-07-23 13:37:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:37:50,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 13:37:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:50,412 INFO L225 Difference]: With dead ends: 2706 [2018-07-23 13:37:50,413 INFO L226 Difference]: Without dead ends: 1625 [2018-07-23 13:37:50,415 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-07-23 13:37:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1258. [2018-07-23 13:37:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states. [2018-07-23 13:37:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 2139 transitions. [2018-07-23 13:37:50,902 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 2139 transitions. Word has length 16 [2018-07-23 13:37:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:50,902 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 2139 transitions. [2018-07-23 13:37:50,902 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2139 transitions. [2018-07-23 13:37:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:50,903 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:50,903 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:50,903 INFO L414 AbstractCegarLoop]: === Iteration 61 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1269790439, now seen corresponding path program 1 times [2018-07-23 13:37:50,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:50,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:50,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:50,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:50,911 INFO L185 omatonBuilderFactory]: Interpolants [116135#true, 116137#(<= product_end1 (+ product_workload product_begin1)), 116136#false, 116139#(<= (+ product_begin0 product_end1 1) (+ product_end0 product_begin1)), 116138#(<= (+ product_begin0 product_end1) (+ product_end0 product_begin1)), 116141#(<= (+ product_begin0 1) product_end0), 116140#(<= (+ product_begin0 2) product_end0)] [2018-07-23 13:37:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:50,911 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:50,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:50,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:50,912 INFO L87 Difference]: Start difference. First operand 1258 states and 2139 transitions. Second operand 7 states. [2018-07-23 13:37:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:51,690 INFO L93 Difference]: Finished difference Result 3012 states and 5088 transitions. [2018-07-23 13:37:51,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:37:51,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 13:37:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:51,693 INFO L225 Difference]: With dead ends: 3012 [2018-07-23 13:37:51,693 INFO L226 Difference]: Without dead ends: 1713 [2018-07-23 13:37:51,696 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:37:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2018-07-23 13:37:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1521. [2018-07-23 13:37:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-07-23 13:37:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2545 transitions. [2018-07-23 13:37:52,388 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2545 transitions. Word has length 16 [2018-07-23 13:37:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:52,389 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2545 transitions. [2018-07-23 13:37:52,389 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2545 transitions. [2018-07-23 13:37:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:37:52,390 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:52,390 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:52,391 INFO L414 AbstractCegarLoop]: === Iteration 62 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash 323600233, now seen corresponding path program 2 times [2018-07-23 13:37:52,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:52,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:52,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:37:52,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:52,400 INFO L185 omatonBuilderFactory]: Interpolants [125223#false, 125222#true, 125225#(<= (+ product_end1 1) (+ product_workload product_begin1)), 125224#(<= product_end1 (+ product_workload product_begin1)), 125227#(<= (+ product_begin0 2) product_end0), 125226#(<= 2 product_workload), 125228#(<= (+ product_begin0 1) product_end0)] [2018-07-23 13:37:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:52,400 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:37:52,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:37:52,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:37:52,401 INFO L87 Difference]: Start difference. First operand 1521 states and 2545 transitions. Second operand 7 states. [2018-07-23 13:37:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:53,310 INFO L93 Difference]: Finished difference Result 3615 states and 5961 transitions. [2018-07-23 13:37:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:37:53,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-23 13:37:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:53,314 INFO L225 Difference]: With dead ends: 3615 [2018-07-23 13:37:53,314 INFO L226 Difference]: Without dead ends: 2069 [2018-07-23 13:37:53,317 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:37:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-07-23 13:37:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1724. [2018-07-23 13:37:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-07-23 13:37:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2809 transitions. [2018-07-23 13:37:54,060 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2809 transitions. Word has length 16 [2018-07-23 13:37:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2809 transitions. [2018-07-23 13:37:54,061 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:37:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2809 transitions. [2018-07-23 13:37:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:37:54,062 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:54,062 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:54,062 INFO L414 AbstractCegarLoop]: === Iteration 63 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1273855967, now seen corresponding path program 2 times [2018-07-23 13:37:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,078 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:54,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:37:54,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,079 INFO L185 omatonBuilderFactory]: Interpolants [135923#true, 135926#(and (= product_next product_end0) (<= (+ product_begin0 4) (+ (* 3 product_workload) product_end0))), 135927#(and (<= (+ product_begin0 4) (+ (* 2 product_workload) product_end1)) (= product_next product_end1)), 135924#false, 135925#(<= 1 product_workload), 135930#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 135931#(not (= product_working0 product_next)), 135928#(and (<= (+ product_working0 4) (+ (* 2 product_workload) product_end1)) (= product_next product_end1)), 135929#(<= (+ product_working0 4) (+ product_workload product_next)), 135932#(not (= product_working0 product_begin1)), 135933#(not (= product_working0 product_working1))] [2018-07-23 13:37:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:54,079 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:37:54,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:37:54,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:37:54,080 INFO L87 Difference]: Start difference. First operand 1724 states and 2809 transitions. Second operand 11 states. [2018-07-23 13:37:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:55,151 INFO L93 Difference]: Finished difference Result 1829 states and 2955 transitions. [2018-07-23 13:37:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:37:55,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-23 13:37:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:55,155 INFO L225 Difference]: With dead ends: 1829 [2018-07-23 13:37:55,155 INFO L226 Difference]: Without dead ends: 1820 [2018-07-23 13:37:55,156 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:37:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2018-07-23 13:37:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1714. [2018-07-23 13:37:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-07-23 13:37:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2793 transitions. [2018-07-23 13:37:55,946 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2793 transitions. Word has length 17 [2018-07-23 13:37:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:55,947 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2793 transitions. [2018-07-23 13:37:55,947 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:37:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2793 transitions. [2018-07-23 13:37:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:55,948 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:55,948 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:37:55,948 INFO L414 AbstractCegarLoop]: === Iteration 64 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times [2018-07-23 13:37:55,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:55,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:55,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:55,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:55,977 INFO L185 omatonBuilderFactory]: Interpolants [143074#(= product_end0 product_next), 143075#(and (= product_end0 product_begin1) (= product_end1 product_next)), 143072#true, 143073#false, 143078#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 143079#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 3) product_begin1))), 143076#(and (or (not (= product_working0 product_end1)) (<= product_working0 product_begin0)) (= product_end0 product_begin1) (or (= product_working0 product_end1) (= product_end1 product_next))), 143077#(and (= product_end0 product_begin1) (or (<= (+ product_working0 1) product_begin0) (not (= product_working0 product_end1))) (or (= product_working0 product_end1) (= product_end1 product_next))), 143082#(not (= product_working0 product_begin1)), 143083#(not (= product_working0 product_working1)), 143080#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 143081#(not (= product_working0 product_next))] [2018-07-23 13:37:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:55,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:55,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:55,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:55,978 INFO L87 Difference]: Start difference. First operand 1714 states and 2793 transitions. Second operand 12 states. [2018-07-23 13:37:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:56,788 INFO L93 Difference]: Finished difference Result 1784 states and 2895 transitions. [2018-07-23 13:37:56,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:56,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:37:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:56,791 INFO L225 Difference]: With dead ends: 1784 [2018-07-23 13:37:56,791 INFO L226 Difference]: Without dead ends: 1783 [2018-07-23 13:37:56,792 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:37:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-07-23 13:37:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1719. [2018-07-23 13:37:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2018-07-23 13:37:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2802 transitions. [2018-07-23 13:37:57,685 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2802 transitions. Word has length 18 [2018-07-23 13:37:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:57,686 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2802 transitions. [2018-07-23 13:37:57,686 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2802 transitions. [2018-07-23 13:37:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:57,687 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:57,688 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:37:57,688 INFO L414 AbstractCegarLoop]: === Iteration 65 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times [2018-07-23 13:37:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:57,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:57,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,715 INFO L185 omatonBuilderFactory]: Interpolants [150114#true, 150115#false, 150118#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 150119#(and (or (not (= product_working0 product_end1)) (<= (+ product_working0 1) product_end0)) (= product_end0 product_begin1) (or (= product_working0 product_end1) (= product_end1 product_next))), 150116#(= product_end0 product_next), 150117#(and (= product_end0 product_begin1) (= product_end1 product_next)), 150122#(and (not (= product_working0 product_end1)) (= product_end1 product_next)), 150123#(not (= product_working0 product_next)), 150120#(and (or (<= (+ product_working0 1) product_begin1) (not (= product_working0 product_end1))) (or (= product_working0 product_end1) (= product_end1 product_next))), 150121#(and (or (= product_working0 product_end1) (= product_end1 product_next)) (or (not (= product_working0 product_end1)) (<= (+ product_working0 2) product_begin1))), 150124#(not (= product_working0 product_begin1)), 150125#(not (= product_working0 product_working1))] [2018-07-23 13:37:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:57,715 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:57,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:57,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:57,715 INFO L87 Difference]: Start difference. First operand 1719 states and 2802 transitions. Second operand 12 states. [2018-07-23 13:37:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:37:58,678 INFO L93 Difference]: Finished difference Result 1783 states and 2889 transitions. [2018-07-23 13:37:58,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:37:58,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:37:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:37:58,680 INFO L225 Difference]: With dead ends: 1783 [2018-07-23 13:37:58,680 INFO L226 Difference]: Without dead ends: 1781 [2018-07-23 13:37:58,680 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:37:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-07-23 13:37:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1723. [2018-07-23 13:37:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-23 13:37:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-23 13:37:59,491 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 18 [2018-07-23 13:37:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:37:59,492 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-23 13:37:59,492 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:37:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-23 13:37:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:37:59,493 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:37:59,493 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:37:59,493 INFO L414 AbstractCegarLoop]: === Iteration 66 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:37:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1629794958, now seen corresponding path program 2 times [2018-07-23 13:37:59,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:37:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:37:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:59,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:37:59,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:37:59,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:37:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:37:59,519 INFO L185 omatonBuilderFactory]: Interpolants [157170#(not (= product_working0 product_begin1)), 157171#(not (= product_working0 product_working1)), 157168#(and (= product_end1 product_next) (not (= product_end1 product_working0))), 157169#(not (= product_working0 product_next)), 157162#(= product_end0 product_next), 157163#(and (= product_end0 product_begin1) (= product_end1 product_next)), 157160#true, 157161#false, 157166#(and (or (<= (+ product_end0 product_working0 2) (+ product_begin0 product_end1)) (not (= product_end1 product_working0))) (or (= product_end1 product_working0) (= product_end1 product_next))), 157167#(and (or (<= (+ product_end0 product_working0 3) (+ product_begin0 product_end1)) (not (= product_end1 product_working0))) (or (= product_end1 product_working0) (= product_end1 product_next))), 157164#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 157165#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next))] [2018-07-23 13:37:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:37:59,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:37:59,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:37:59,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:37:59,520 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 12 states. [2018-07-23 13:38:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:00,590 INFO L93 Difference]: Finished difference Result 2036 states and 3314 transitions. [2018-07-23 13:38:00,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:38:00,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:38:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:00,593 INFO L225 Difference]: With dead ends: 2036 [2018-07-23 13:38:00,593 INFO L226 Difference]: Without dead ends: 2035 [2018-07-23 13:38:00,594 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2018-07-23 13:38:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1858. [2018-07-23 13:38:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-07-23 13:38:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3040 transitions. [2018-07-23 13:38:01,349 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3040 transitions. Word has length 18 [2018-07-23 13:38:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:01,349 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 3040 transitions. [2018-07-23 13:38:01,349 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3040 transitions. [2018-07-23 13:38:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:01,350 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:01,350 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:01,351 INFO L414 AbstractCegarLoop]: === Iteration 67 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash -446449989, now seen corresponding path program 1 times [2018-07-23 13:38:01,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:01,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:01,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,404 INFO L185 omatonBuilderFactory]: Interpolants [164994#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 164995#(and (= product_end1 product_next) (not (= product_end1 product_working0))), 164992#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 164993#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 164998#(not (= product_working0 product_working1)), 164996#(not (= product_working0 product_next)), 164997#(not (= product_working0 product_begin1)), 164990#(= product_end0 product_next), 164991#(and (= product_end0 product_begin1) (= product_end1 product_next)), 164988#true, 164989#false] [2018-07-23 13:38:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:01,404 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:01,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:01,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:01,404 INFO L87 Difference]: Start difference. First operand 1858 states and 3040 transitions. Second operand 11 states. [2018-07-23 13:38:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:02,369 INFO L93 Difference]: Finished difference Result 2046 states and 3338 transitions. [2018-07-23 13:38:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:38:02,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:02,371 INFO L225 Difference]: With dead ends: 2046 [2018-07-23 13:38:02,371 INFO L226 Difference]: Without dead ends: 2044 [2018-07-23 13:38:02,372 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:38:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-07-23 13:38:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1922. [2018-07-23 13:38:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-07-23 13:38:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 3155 transitions. [2018-07-23 13:38:03,149 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 3155 transitions. Word has length 18 [2018-07-23 13:38:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:03,149 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 3155 transitions. [2018-07-23 13:38:03,149 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 3155 transitions. [2018-07-23 13:38:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:03,150 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:03,150 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:03,150 INFO L414 AbstractCegarLoop]: === Iteration 68 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-07-23 13:38:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:03,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:03,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,163 INFO L185 omatonBuilderFactory]: Interpolants [172976#(<= (+ product_begin0 3) product_working1), 172977#(not (= product_working0 product_working1)), 172967#true, 172970#(and (= product_end0 product_begin1) (= product_end1 product_next)), 172971#(and (<= (+ product_begin0 1) product_begin1) (= product_end1 product_next)), 172968#false, 172969#(= product_end0 product_next), 172974#(<= (+ product_begin0 3) product_next), 172975#(<= (+ product_begin0 3) product_begin1), 172972#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 172973#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next))] [2018-07-23 13:38:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:03,163 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:03,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:03,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:03,164 INFO L87 Difference]: Start difference. First operand 1922 states and 3155 transitions. Second operand 11 states. [2018-07-23 13:38:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:04,232 INFO L93 Difference]: Finished difference Result 2251 states and 3688 transitions. [2018-07-23 13:38:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:38:04,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:04,234 INFO L225 Difference]: With dead ends: 2251 [2018-07-23 13:38:04,234 INFO L226 Difference]: Without dead ends: 2249 [2018-07-23 13:38:04,235 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:38:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2018-07-23 13:38:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2029. [2018-07-23 13:38:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-23 13:38:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3346 transitions. [2018-07-23 13:38:05,159 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3346 transitions. Word has length 18 [2018-07-23 13:38:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:05,159 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3346 transitions. [2018-07-23 13:38:05,160 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3346 transitions. [2018-07-23 13:38:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:05,161 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:05,161 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:05,161 INFO L414 AbstractCegarLoop]: === Iteration 69 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:05,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310343, now seen corresponding path program 3 times [2018-07-23 13:38:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:05,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:05,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:05,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:05,177 INFO L185 omatonBuilderFactory]: Interpolants [181574#(= product_end0 product_next), 181575#(and (= product_end0 product_begin1) (= product_end1 product_next)), 181572#true, 181573#false, 181578#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 181579#(and (<= (+ product_working0 3) product_begin1) (= product_end1 product_next)), 181576#(and (= product_end0 product_begin1) (<= product_working0 product_begin0) (= product_end1 product_next)), 181577#(and (<= (+ product_working0 1) product_begin0) (= product_end0 product_begin1) (= product_end1 product_next)), 181582#(<= (+ product_working0 4) product_begin1), 181583#(<= (+ product_working0 5) product_begin1), 181580#(and (<= (+ product_working0 4) product_end1) (= product_end1 product_next)), 181581#(<= (+ product_working0 4) product_next), 181584#(<= (+ product_working0 5) product_working1)] [2018-07-23 13:38:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:05,177 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:05,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:05,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:05,178 INFO L87 Difference]: Start difference. First operand 2029 states and 3346 transitions. Second operand 13 states. [2018-07-23 13:38:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:06,112 INFO L93 Difference]: Finished difference Result 2101 states and 3451 transitions. [2018-07-23 13:38:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:38:06,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 13:38:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:06,115 INFO L225 Difference]: With dead ends: 2101 [2018-07-23 13:38:06,115 INFO L226 Difference]: Without dead ends: 2100 [2018-07-23 13:38:06,115 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:38:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-07-23 13:38:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2029. [2018-07-23 13:38:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-23 13:38:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3343 transitions. [2018-07-23 13:38:06,929 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3343 transitions. Word has length 18 [2018-07-23 13:38:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:06,929 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3343 transitions. [2018-07-23 13:38:06,929 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3343 transitions. [2018-07-23 13:38:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:06,930 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:06,930 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:06,930 INFO L414 AbstractCegarLoop]: === Iteration 70 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1235464429, now seen corresponding path program 2 times [2018-07-23 13:38:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:06,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:06,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,947 INFO L185 omatonBuilderFactory]: Interpolants [189862#false, 189863#(= product_end0 product_next), 189861#true, 189866#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 189867#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 189864#(and (= product_begin1 product_end0) (= product_end1 product_next)), 189865#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 189870#(not (= product_working0 product_begin1)), 189871#(not (= product_working0 product_working1)), 189868#(and (= product_end1 product_next) (not (= product_end1 product_working0))), 189869#(not (= product_working0 product_next))] [2018-07-23 13:38:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:06,947 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:06,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:06,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:06,947 INFO L87 Difference]: Start difference. First operand 2029 states and 3343 transitions. Second operand 11 states. [2018-07-23 13:38:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:08,080 INFO L93 Difference]: Finished difference Result 2256 states and 3702 transitions. [2018-07-23 13:38:08,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:38:08,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:08,082 INFO L225 Difference]: With dead ends: 2256 [2018-07-23 13:38:08,082 INFO L226 Difference]: Without dead ends: 2254 [2018-07-23 13:38:08,082 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2018-07-23 13:38:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2040. [2018-07-23 13:38:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-07-23 13:38:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3369 transitions. [2018-07-23 13:38:08,908 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3369 transitions. Word has length 18 [2018-07-23 13:38:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:08,908 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 3369 transitions. [2018-07-23 13:38:08,908 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3369 transitions. [2018-07-23 13:38:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:08,910 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:08,910 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:38:08,910 INFO L414 AbstractCegarLoop]: === Iteration 71 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash -111984382, now seen corresponding path program 4 times [2018-07-23 13:38:08,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:08,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:08,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:08,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:08,926 INFO L185 omatonBuilderFactory]: Interpolants [198499#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 198498#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 198497#(and (= product_begin1 product_end0) (= product_end1 product_next)), 198496#(= product_end0 product_next), 198503#(or (<= (+ product_end0 3) product_begin0) (not (= product_working0 product_begin1))), 198502#(or (<= (+ product_end0 2) product_begin0) (not (= product_working0 product_begin1))), 198501#(<= (+ product_end0 2) product_begin1), 198500#(<= (+ product_end0 2) product_next), 198505#(not (= product_working0 product_working1)), 198504#(not (= product_working0 product_begin1)), 198495#false, 198494#true] [2018-07-23 13:38:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:38:08,927 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:08,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:08,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:08,927 INFO L87 Difference]: Start difference. First operand 2040 states and 3369 transitions. Second operand 12 states. [2018-07-23 13:38:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:10,049 INFO L93 Difference]: Finished difference Result 2243 states and 3672 transitions. [2018-07-23 13:38:10,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:38:10,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 13:38:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:10,053 INFO L225 Difference]: With dead ends: 2243 [2018-07-23 13:38:10,053 INFO L226 Difference]: Without dead ends: 2242 [2018-07-23 13:38:10,054 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:38:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2018-07-23 13:38:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2029. [2018-07-23 13:38:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2018-07-23 13:38:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3348 transitions. [2018-07-23 13:38:10,891 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3348 transitions. Word has length 18 [2018-07-23 13:38:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:10,891 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3348 transitions. [2018-07-23 13:38:10,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3348 transitions. [2018-07-23 13:38:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:10,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:10,892 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:10,892 INFO L414 AbstractCegarLoop]: === Iteration 72 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash -111983100, now seen corresponding path program 1 times [2018-07-23 13:38:10,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:10,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:10,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,902 INFO L185 omatonBuilderFactory]: Interpolants [207091#(<= (+ product_begin0 3) product_next), 207090#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 207089#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 207088#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 207094#(not (= product_working0 product_working1)), 207093#(not (= product_working0 product_begin1)), 207092#(<= (+ product_begin0 3) product_begin1), 207087#(and (= product_begin1 product_end0) (= product_end1 product_next)), 207086#(= product_end0 product_next), 207085#false, 207084#true] [2018-07-23 13:38:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:10,902 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:10,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:10,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:10,903 INFO L87 Difference]: Start difference. First operand 2029 states and 3348 transitions. Second operand 11 states. [2018-07-23 13:38:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:12,106 INFO L93 Difference]: Finished difference Result 2267 states and 3717 transitions. [2018-07-23 13:38:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:38:12,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:12,108 INFO L225 Difference]: With dead ends: 2267 [2018-07-23 13:38:12,108 INFO L226 Difference]: Without dead ends: 2265 [2018-07-23 13:38:12,109 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:38:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2018-07-23 13:38:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2063. [2018-07-23 13:38:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-07-23 13:38:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3413 transitions. [2018-07-23 13:38:12,963 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3413 transitions. Word has length 18 [2018-07-23 13:38:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:12,963 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 3413 transitions. [2018-07-23 13:38:12,963 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3413 transitions. [2018-07-23 13:38:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:12,965 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:12,965 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:12,965 INFO L414 AbstractCegarLoop]: === Iteration 73 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash -103396213, now seen corresponding path program 2 times [2018-07-23 13:38:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:12,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:12,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,980 INFO L185 omatonBuilderFactory]: Interpolants [215795#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 215794#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 215793#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 215792#(and (= product_begin1 product_end0) (= product_end1 product_next)), 215799#(not (= product_working0 product_working1)), 215798#(<= (+ product_begin0 3) product_working1), 215797#(<= (+ product_begin0 3) product_begin1), 215796#(<= (+ product_begin0 3) product_next), 215791#(= product_end0 product_next), 215790#false, 215789#true] [2018-07-23 13:38:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:12,981 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:12,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:12,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:12,981 INFO L87 Difference]: Start difference. First operand 2063 states and 3413 transitions. Second operand 11 states. [2018-07-23 13:38:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:14,072 INFO L93 Difference]: Finished difference Result 2234 states and 3657 transitions. [2018-07-23 13:38:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:38:14,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:14,076 INFO L225 Difference]: With dead ends: 2234 [2018-07-23 13:38:14,076 INFO L226 Difference]: Without dead ends: 2232 [2018-07-23 13:38:14,077 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:38:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2018-07-23 13:38:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2062. [2018-07-23 13:38:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-07-23 13:38:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3410 transitions. [2018-07-23 13:38:14,962 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3410 transitions. Word has length 18 [2018-07-23 13:38:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:14,962 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 3410 transitions. [2018-07-23 13:38:14,962 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3410 transitions. [2018-07-23 13:38:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:14,963 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:14,963 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:14,964 INFO L414 AbstractCegarLoop]: === Iteration 74 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash -103395925, now seen corresponding path program 5 times [2018-07-23 13:38:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:14,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:14,977 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:14,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:14,977 INFO L185 omatonBuilderFactory]: Interpolants [224427#(and (= product_begin1 product_end0) (= product_end1 product_next)), 224426#(= product_end0 product_next), 224425#false, 224424#true, 224431#(and (<= (+ product_end0 product_working0 3) (+ product_begin0 product_end1)) (= product_end1 product_next)), 224430#(and (<= (+ product_end0 product_working0 2) (+ product_begin0 product_end1)) (= product_end1 product_next)), 224429#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 224428#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 224435#(<= (+ product_working0 5) product_begin1), 224434#(<= (+ product_working0 4) product_begin1), 224433#(<= (+ product_working0 4) product_next), 224432#(and (<= (+ product_working0 4) product_end1) (= product_end1 product_next)), 224436#(<= (+ product_working0 5) product_working1)] [2018-07-23 13:38:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:14,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:14,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:14,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:14,978 INFO L87 Difference]: Start difference. First operand 2062 states and 3410 transitions. Second operand 13 states. [2018-07-23 13:38:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:16,071 INFO L93 Difference]: Finished difference Result 2220 states and 3648 transitions. [2018-07-23 13:38:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:38:16,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 13:38:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:16,074 INFO L225 Difference]: With dead ends: 2220 [2018-07-23 13:38:16,074 INFO L226 Difference]: Without dead ends: 2219 [2018-07-23 13:38:16,074 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:38:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2018-07-23 13:38:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2062. [2018-07-23 13:38:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-07-23 13:38:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3406 transitions. [2018-07-23 13:38:16,935 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3406 transitions. Word has length 18 [2018-07-23 13:38:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:16,936 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 3406 transitions. [2018-07-23 13:38:16,936 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3406 transitions. [2018-07-23 13:38:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:16,937 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:16,938 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:16,938 INFO L414 AbstractCegarLoop]: === Iteration 75 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-07-23 13:38:16,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:16,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:16,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,951 INFO L185 omatonBuilderFactory]: Interpolants [233027#(<= (+ product_end0 2) product_next), 233026#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 233025#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 233024#(and (= product_begin1 product_end0) (= product_end1 product_next)), 233031#(not (= product_working0 product_working1)), 233030#(not (= product_working0 product_begin1)), 233029#(<= (+ product_begin0 3) product_begin1), 233028#(<= (+ product_end0 2) product_begin1), 233023#(= product_end0 product_next), 233022#false, 233021#true] [2018-07-23 13:38:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:16,952 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:16,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:16,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:16,952 INFO L87 Difference]: Start difference. First operand 2062 states and 3406 transitions. Second operand 11 states. [2018-07-23 13:38:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:18,154 INFO L93 Difference]: Finished difference Result 2348 states and 3848 transitions. [2018-07-23 13:38:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:38:18,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:18,156 INFO L225 Difference]: With dead ends: 2348 [2018-07-23 13:38:18,157 INFO L226 Difference]: Without dead ends: 2346 [2018-07-23 13:38:18,157 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:38:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2018-07-23 13:38:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2069. [2018-07-23 13:38:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2018-07-23 13:38:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3421 transitions. [2018-07-23 13:38:19,111 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3421 transitions. Word has length 18 [2018-07-23 13:38:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:19,111 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3421 transitions. [2018-07-23 13:38:19,111 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3421 transitions. [2018-07-23 13:38:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:19,112 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:19,112 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:19,113 INFO L414 AbstractCegarLoop]: === Iteration 76 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 3 times [2018-07-23 13:38:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:19,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:19,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:19,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:19,123 INFO L185 omatonBuilderFactory]: Interpolants [241907#false, 241906#true, 241911#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 241910#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 241909#(and (= product_begin1 product_end0) (= product_end1 product_next)), 241908#(= product_end0 product_next), 241915#(<= (+ product_begin0 3) product_working1), 241914#(<= (+ product_begin0 3) product_begin1), 241913#(<= (+ product_end0 2) product_begin1), 241912#(<= (+ product_end0 2) product_next), 241916#(not (= product_working0 product_working1))] [2018-07-23 13:38:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:19,124 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:19,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:19,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:19,124 INFO L87 Difference]: Start difference. First operand 2069 states and 3421 transitions. Second operand 11 states. [2018-07-23 13:38:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:20,316 INFO L93 Difference]: Finished difference Result 2308 states and 3773 transitions. [2018-07-23 13:38:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:38:20,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:20,319 INFO L225 Difference]: With dead ends: 2308 [2018-07-23 13:38:20,319 INFO L226 Difference]: Without dead ends: 2306 [2018-07-23 13:38:20,320 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:38:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2018-07-23 13:38:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2060. [2018-07-23 13:38:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states. [2018-07-23 13:38:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3397 transitions. [2018-07-23 13:38:21,191 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3397 transitions. Word has length 18 [2018-07-23 13:38:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 3397 transitions. [2018-07-23 13:38:21,192 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3397 transitions. [2018-07-23 13:38:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:21,193 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:21,193 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:21,193 INFO L414 AbstractCegarLoop]: === Iteration 77 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170099, now seen corresponding path program 6 times [2018-07-23 13:38:21,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:21,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:21,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:21,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:21,205 INFO L185 omatonBuilderFactory]: Interpolants [250691#true, 250695#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 250694#(and (= product_begin1 product_end0) (= product_end1 product_next)), 250693#(= product_end0 product_next), 250692#false, 250699#(<= (+ product_end0 product_working0 2) (+ product_begin0 product_begin1)), 250698#(<= (+ product_end0 2) product_begin1), 250697#(<= (+ product_end0 2) product_next), 250696#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 250703#(<= (+ product_working0 5) product_working1), 250702#(<= (+ product_working0 5) product_begin1), 250701#(<= (+ product_working0 4) product_begin1), 250700#(<= (+ product_end0 product_working0 3) (+ product_begin0 product_begin1))] [2018-07-23 13:38:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:21,205 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:21,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:21,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:21,206 INFO L87 Difference]: Start difference. First operand 2060 states and 3397 transitions. Second operand 13 states. [2018-07-23 13:38:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:22,451 INFO L93 Difference]: Finished difference Result 2308 states and 3783 transitions. [2018-07-23 13:38:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:22,451 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 13:38:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:22,453 INFO L225 Difference]: With dead ends: 2308 [2018-07-23 13:38:22,453 INFO L226 Difference]: Without dead ends: 2307 [2018-07-23 13:38:22,454 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:38:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2018-07-23 13:38:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2057. [2018-07-23 13:38:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-07-23 13:38:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3387 transitions. [2018-07-23 13:38:23,377 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3387 transitions. Word has length 18 [2018-07-23 13:38:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:23,377 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 3387 transitions. [2018-07-23 13:38:23,377 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3387 transitions. [2018-07-23 13:38:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:23,378 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:23,378 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:23,379 INFO L414 AbstractCegarLoop]: === Iteration 78 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1198893179, now seen corresponding path program 4 times [2018-07-23 13:38:23,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:23,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:23,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:23,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:23,392 INFO L185 omatonBuilderFactory]: Interpolants [259463#(and (= product_begin1 product_end0) (= product_end1 product_next)), 259462#(= product_end0 product_next), 259461#false, 259460#true, 259467#(<= (+ product_end0 2) product_begin1), 259466#(<= (+ product_end0 2) product_next), 259465#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 259464#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 259470#(not (= product_working0 product_working1)), 259469#(<= (+ product_begin0 3) product_working1), 259468#(<= (+ product_end0 2) product_working1)] [2018-07-23 13:38:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:23,393 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:23,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:23,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:23,393 INFO L87 Difference]: Start difference. First operand 2057 states and 3387 transitions. Second operand 11 states. [2018-07-23 13:38:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:24,900 INFO L93 Difference]: Finished difference Result 2380 states and 3900 transitions. [2018-07-23 13:38:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:38:24,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:24,903 INFO L225 Difference]: With dead ends: 2380 [2018-07-23 13:38:24,903 INFO L226 Difference]: Without dead ends: 2378 [2018-07-23 13:38:24,904 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:38:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2018-07-23 13:38:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2049. [2018-07-23 13:38:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2018-07-23 13:38:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3368 transitions. [2018-07-23 13:38:25,789 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3368 transitions. Word has length 18 [2018-07-23 13:38:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:25,790 INFO L471 AbstractCegarLoop]: Abstraction has 2049 states and 3368 transitions. [2018-07-23 13:38:25,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3368 transitions. [2018-07-23 13:38:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:25,791 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:25,791 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:25,791 INFO L414 AbstractCegarLoop]: === Iteration 79 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1428793719, now seen corresponding path program 1 times [2018-07-23 13:38:25,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:25,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:25,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,804 INFO L185 omatonBuilderFactory]: Interpolants [268372#(<= (+ product_working0 4) product_begin1), 268373#(<= (+ product_working0 4) product_working1), 268368#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 268369#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 268370#(<= (+ product_working0 3) product_next), 268371#(<= (+ product_working0 3) product_begin1), 268364#false, 268365#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 268366#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 268367#(and (= product_end0 product_next) (<= (+ product_begin0 3) (+ product_workload product_end0))), 268363#true] [2018-07-23 13:38:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:25,804 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:25,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:25,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:25,805 INFO L87 Difference]: Start difference. First operand 2049 states and 3368 transitions. Second operand 11 states. [2018-07-23 13:38:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:26,864 INFO L93 Difference]: Finished difference Result 2143 states and 3512 transitions. [2018-07-23 13:38:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:38:26,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:26,867 INFO L225 Difference]: With dead ends: 2143 [2018-07-23 13:38:26,867 INFO L226 Difference]: Without dead ends: 2141 [2018-07-23 13:38:26,867 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:38:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2018-07-23 13:38:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2055. [2018-07-23 13:38:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-07-23 13:38:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3378 transitions. [2018-07-23 13:38:27,836 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3378 transitions. Word has length 18 [2018-07-23 13:38:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:27,837 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3378 transitions. [2018-07-23 13:38:27,837 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3378 transitions. [2018-07-23 13:38:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:38:27,838 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:27,838 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:27,838 INFO L414 AbstractCegarLoop]: === Iteration 80 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 383805696, now seen corresponding path program 1 times [2018-07-23 13:38:27,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:27,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:27,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:38:27,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:27,855 INFO L185 omatonBuilderFactory]: Interpolants [276788#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 276789#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 276790#(and (= product_end0 product_next) (<= (+ product_begin0 3) (+ product_workload product_end0))), 276791#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 276786#true, 276787#false, 276796#(<= (+ product_working0 4) product_working1), 276792#(<= (+ product_begin0 3) product_next), 276793#(<= (+ product_begin0 3) product_begin1), 276794#(<= (+ product_working0 3) product_begin1), 276795#(<= (+ product_working0 4) product_begin1)] [2018-07-23 13:38:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:27,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:38:27,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:38:27,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:38:27,855 INFO L87 Difference]: Start difference. First operand 2055 states and 3378 transitions. Second operand 11 states. [2018-07-23 13:38:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:28,960 INFO L93 Difference]: Finished difference Result 2243 states and 3674 transitions. [2018-07-23 13:38:28,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:38:28,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 13:38:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:28,963 INFO L225 Difference]: With dead ends: 2243 [2018-07-23 13:38:28,963 INFO L226 Difference]: Without dead ends: 2241 [2018-07-23 13:38:28,964 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:38:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-07-23 13:38:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072. [2018-07-23 13:38:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-07-23 13:38:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3406 transitions. [2018-07-23 13:38:29,890 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3406 transitions. Word has length 18 [2018-07-23 13:38:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:29,890 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3406 transitions. [2018-07-23 13:38:29,890 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:38:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3406 transitions. [2018-07-23 13:38:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:29,892 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:29,892 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:29,892 INFO L414 AbstractCegarLoop]: === Iteration 81 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-07-23 13:38:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:29,918 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:29,918 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:29,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:29,918 INFO L185 omatonBuilderFactory]: Interpolants [285445#true, 285446#false, 285447#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 285452#(and (= product_next product_end1) (<= (+ product_working0 3) (+ product_workload product_begin1))), 285453#(or (not (= product_working0 product_next)) (<= (+ product_end1 product_working0 3) (+ product_next product_begin1))), 285454#(or (<= (+ product_end1 product_working0 4) (+ product_next product_begin1)) (not (= product_working0 product_next))), 285455#(not (= product_working0 product_next)), 285448#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_begin1) (= product_next product_end1)), 285449#(and (= product_end0 product_begin1) (= product_next product_end1) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 285450#(and (= product_end0 product_begin1) (= product_next product_end1) (<= (+ product_begin0 3) (+ product_workload product_end0))), 285451#(and (= product_end0 product_begin1) (= product_next product_end1) (<= (+ product_working0 3) (+ product_workload product_end0))), 285456#(not (= product_working0 product_begin1)), 285457#(not (= product_working0 product_working1))] [2018-07-23 13:38:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:29,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:29,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:29,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:29,919 INFO L87 Difference]: Start difference. First operand 2072 states and 3406 transitions. Second operand 13 states. [2018-07-23 13:38:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:31,084 INFO L93 Difference]: Finished difference Result 2153 states and 3525 transitions. [2018-07-23 13:38:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:38:31,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-23 13:38:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:31,087 INFO L225 Difference]: With dead ends: 2153 [2018-07-23 13:38:31,087 INFO L226 Difference]: Without dead ends: 2152 [2018-07-23 13:38:31,088 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:38:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-07-23 13:38:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2082. [2018-07-23 13:38:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-07-23 13:38:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3423 transitions. [2018-07-23 13:38:32,065 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3423 transitions. Word has length 19 [2018-07-23 13:38:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:32,065 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 3423 transitions. [2018-07-23 13:38:32,065 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3423 transitions. [2018-07-23 13:38:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:32,067 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:32,067 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:32,067 INFO L414 AbstractCegarLoop]: === Iteration 82 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1639758835, now seen corresponding path program 1 times [2018-07-23 13:38:32,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:32,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:32,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:32,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:32,090 INFO L185 omatonBuilderFactory]: Interpolants [293966#true, 293967#false, 293972#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_working0 3) (+ product_workload product_end0))), 293973#(and (= product_end1 product_next) (<= (+ product_working0 3) (+ product_workload product_begin1))), 293974#(and (<= (+ product_working0 4) (+ product_workload product_begin1)) (= product_end1 product_next)), 293975#(and (<= (+ product_working0 5) (+ product_workload product_end1)) (= product_end1 product_next)), 293968#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 293969#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_begin1) (= product_end1 product_next)), 293970#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 293971#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 3) (+ product_workload product_end0))), 293976#(not (= product_working0 product_next)), 293977#(not (= product_working0 product_begin1)), 293978#(not (= product_working0 product_working1))] [2018-07-23 13:38:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:32,090 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:32,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:32,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:32,090 INFO L87 Difference]: Start difference. First operand 2082 states and 3423 transitions. Second operand 13 states. [2018-07-23 13:38:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:33,271 INFO L93 Difference]: Finished difference Result 2189 states and 3589 transitions. [2018-07-23 13:38:33,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:38:33,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-23 13:38:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:33,274 INFO L225 Difference]: With dead ends: 2189 [2018-07-23 13:38:33,274 INFO L226 Difference]: Without dead ends: 2187 [2018-07-23 13:38:33,275 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:38:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-07-23 13:38:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2100. [2018-07-23 13:38:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-07-23 13:38:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3458 transitions. [2018-07-23 13:38:34,218 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3458 transitions. Word has length 19 [2018-07-23 13:38:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:34,218 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 3458 transitions. [2018-07-23 13:38:34,218 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3458 transitions. [2018-07-23 13:38:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:34,219 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:34,219 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:34,219 INFO L414 AbstractCegarLoop]: === Iteration 83 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2095454951, now seen corresponding path program 2 times [2018-07-23 13:38:34,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:34,241 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:34,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,241 INFO L185 omatonBuilderFactory]: Interpolants [302612#(not (= product_working0 product_next)), 302613#(not (= product_working0 product_begin1)), 302614#(not (= product_working0 product_working1)), 302608#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 3) (+ product_workload product_end0))), 302609#(and (= product_end1 product_next) (<= (+ product_begin0 4) (+ product_workload product_begin1))), 302610#(and (<= (+ product_begin0 5) (+ product_workload product_end1)) (= product_end1 product_next)), 302611#(and (<= (+ product_working0 5) (+ product_workload product_end1)) (= product_end1 product_next)), 302604#false, 302605#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 302606#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_begin1) (= product_end1 product_next)), 302607#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 302603#true] [2018-07-23 13:38:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:34,241 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:34,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:34,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:34,242 INFO L87 Difference]: Start difference. First operand 2100 states and 3458 transitions. Second operand 12 states. [2018-07-23 13:38:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:35,460 INFO L93 Difference]: Finished difference Result 2277 states and 3736 transitions. [2018-07-23 13:38:35,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:38:35,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:38:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:35,463 INFO L225 Difference]: With dead ends: 2277 [2018-07-23 13:38:35,463 INFO L226 Difference]: Without dead ends: 2275 [2018-07-23 13:38:35,463 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:38:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2018-07-23 13:38:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2170. [2018-07-23 13:38:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-07-23 13:38:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3573 transitions. [2018-07-23 13:38:36,561 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3573 transitions. Word has length 19 [2018-07-23 13:38:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:36,561 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3573 transitions. [2018-07-23 13:38:36,561 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3573 transitions. [2018-07-23 13:38:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:36,562 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:36,562 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:36,562 INFO L414 AbstractCegarLoop]: === Iteration 84 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1599772939, now seen corresponding path program 3 times [2018-07-23 13:38:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:36,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:36,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:36,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:36,583 INFO L185 omatonBuilderFactory]: Interpolants [311543#true, 311552#(not (= product_working0 product_next)), 311553#(not (= product_working0 product_begin1)), 311554#(not (= product_working0 product_working1)), 311548#(and (<= (+ (* 2 product_end0) 2) (+ product_begin0 product_workload product_end1)) (= product_end1 product_next)), 311549#(and (<= (+ (* 2 product_end0) 3) (+ product_begin0 product_workload product_end1)) (= product_end1 product_next)), 311550#(and (<= (+ product_begin0 5) (+ product_workload product_end1)) (= product_end1 product_next)), 311551#(and (<= (+ product_working0 5) (+ product_workload product_end1)) (= product_end1 product_next)), 311544#false, 311545#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 311546#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_begin1 product_end0) (= product_end1 product_next)), 311547#(and (<= (+ (* 2 product_end0) 1) (+ product_begin0 product_workload product_begin1)) (= product_end1 product_next))] [2018-07-23 13:38:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:36,583 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:36,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:36,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:36,583 INFO L87 Difference]: Start difference. First operand 2170 states and 3573 transitions. Second operand 12 states. [2018-07-23 13:38:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:38,013 INFO L93 Difference]: Finished difference Result 2400 states and 3933 transitions. [2018-07-23 13:38:38,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:38:38,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:38:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:38,016 INFO L225 Difference]: With dead ends: 2400 [2018-07-23 13:38:38,016 INFO L226 Difference]: Without dead ends: 2398 [2018-07-23 13:38:38,017 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:38:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2018-07-23 13:38:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2146. [2018-07-23 13:38:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2018-07-23 13:38:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3536 transitions. [2018-07-23 13:38:39,019 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3536 transitions. Word has length 19 [2018-07-23 13:38:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:39,020 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3536 transitions. [2018-07-23 13:38:39,020 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3536 transitions. [2018-07-23 13:38:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:39,021 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:39,021 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:39,021 INFO L414 AbstractCegarLoop]: === Iteration 85 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1654744567, now seen corresponding path program 1 times [2018-07-23 13:38:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:38:39,030 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:39,030 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:38:39,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:39,030 INFO L185 omatonBuilderFactory]: Interpolants [320704#(and (<= (+ product_end0 2) product_end1) (= product_end0 product_begin1)), 320705#(<= (+ product_begin1 2) product_end1), 320706#(<= (+ product_begin1 1) product_end1), 320700#false, 320701#(and (<= product_end0 (+ product_begin0 product_workload)) (= product_end0 product_next)), 320702#(and (= product_end0 product_next) (<= (+ product_end0 1) (+ product_begin0 product_workload))), 320703#(and (<= 2 product_workload) (= product_end0 product_next)), 320699#true] [2018-07-23 13:38:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:38:39,030 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:38:39,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:38:39,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:38:39,031 INFO L87 Difference]: Start difference. First operand 2146 states and 3536 transitions. Second operand 8 states. [2018-07-23 13:38:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:40,341 INFO L93 Difference]: Finished difference Result 4383 states and 7138 transitions. [2018-07-23 13:38:40,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:38:40,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-07-23 13:38:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:40,344 INFO L225 Difference]: With dead ends: 4383 [2018-07-23 13:38:40,344 INFO L226 Difference]: Without dead ends: 2069 [2018-07-23 13:38:40,346 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:38:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2018-07-23 13:38:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1775. [2018-07-23 13:38:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-07-23 13:38:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2940 transitions. [2018-07-23 13:38:41,230 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2940 transitions. Word has length 19 [2018-07-23 13:38:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:41,231 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2940 transitions. [2018-07-23 13:38:41,231 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:38:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2940 transitions. [2018-07-23 13:38:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:41,232 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:41,232 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:41,232 INFO L414 AbstractCegarLoop]: === Iteration 86 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-07-23 13:38:41,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:41,248 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:41,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,248 INFO L185 omatonBuilderFactory]: Interpolants [333045#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 333044#false, 333047#(and (<= (+ (* 2 product_end1) 1) (+ product_begin0 product_workload product_begin1)) (= product_end0 product_next)), 333046#(and (<= (* 2 product_end1) (+ product_begin0 product_workload product_begin1)) (= product_end0 product_next)), 333043#true, 333053#(<= (+ product_working1 5) product_next), 333052#(<= (+ product_working1 5) (+ product_workload product_next)), 333055#(<= (+ product_working1 5) product_working0), 333054#(<= (+ product_working1 5) product_begin0), 333049#(<= (+ (* 2 product_end1) 2) (+ product_workload product_next product_begin1)), 333048#(and (<= (+ (* 2 product_end1) 2) (+ product_workload product_end0 product_begin1)) (= product_end0 product_next)), 333051#(<= (+ product_begin1 5) (+ product_workload product_next)), 333050#(<= (+ (* 2 product_end1) 3) (+ product_workload product_next product_begin1))] [2018-07-23 13:38:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:41,248 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:41,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:41,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:41,249 INFO L87 Difference]: Start difference. First operand 1775 states and 2940 transitions. Second operand 13 states. [2018-07-23 13:38:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:42,694 INFO L93 Difference]: Finished difference Result 2136 states and 3539 transitions. [2018-07-23 13:38:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:38:42,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-23 13:38:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:42,697 INFO L225 Difference]: With dead ends: 2136 [2018-07-23 13:38:42,697 INFO L226 Difference]: Without dead ends: 2134 [2018-07-23 13:38:42,698 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:38:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-07-23 13:38:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1982. [2018-07-23 13:38:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-07-23 13:38:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3302 transitions. [2018-07-23 13:38:43,708 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3302 transitions. Word has length 19 [2018-07-23 13:38:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:43,709 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 3302 transitions. [2018-07-23 13:38:43,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3302 transitions. [2018-07-23 13:38:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:43,710 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:43,710 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:43,710 INFO L414 AbstractCegarLoop]: === Iteration 87 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-07-23 13:38:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:43,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:43,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:43,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:43,726 INFO L185 omatonBuilderFactory]: Interpolants [341327#false, 341326#true, 341333#(and (<= (+ product_begin1 5) (+ product_workload product_end0)) (= product_end0 product_next)), 341332#(and (<= (+ product_begin1 4) (+ product_begin0 product_workload)) (= product_end0 product_next)), 341335#(<= (+ product_working1 5) (+ product_workload product_next)), 341334#(<= (+ product_begin1 5) (+ product_workload product_next)), 341329#(and (<= (* 2 product_end1) (+ product_begin0 product_workload product_begin1)) (= product_end0 product_next)), 341328#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 341331#(and (= product_end0 product_next) (<= (+ product_begin1 3) (+ product_begin0 product_workload))), 341330#(and (<= (+ (* 2 product_end1) 1) (+ product_begin0 product_workload product_begin1)) (= product_end0 product_next)), 341337#(<= (+ product_working1 5) product_begin0), 341336#(<= (+ product_working1 5) product_next), 341338#(<= (+ product_working1 5) product_working0)] [2018-07-23 13:38:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:43,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:43,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:43,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:43,727 INFO L87 Difference]: Start difference. First operand 1982 states and 3302 transitions. Second operand 13 states. [2018-07-23 13:38:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:46,005 INFO L93 Difference]: Finished difference Result 2923 states and 4923 transitions. [2018-07-23 13:38:46,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:38:46,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-23 13:38:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:46,008 INFO L225 Difference]: With dead ends: 2923 [2018-07-23 13:38:46,008 INFO L226 Difference]: Without dead ends: 2921 [2018-07-23 13:38:46,008 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:38:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-07-23 13:38:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2165. [2018-07-23 13:38:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-07-23 13:38:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3628 transitions. [2018-07-23 13:38:47,089 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3628 transitions. Word has length 19 [2018-07-23 13:38:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 2165 states and 3628 transitions. [2018-07-23 13:38:47,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3628 transitions. [2018-07-23 13:38:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:47,091 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:47,091 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:47,091 INFO L414 AbstractCegarLoop]: === Iteration 88 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:47,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1180644619, now seen corresponding path program 1 times [2018-07-23 13:38:47,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:47,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:47,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,109 INFO L185 omatonBuilderFactory]: Interpolants [351575#true, 351585#(not (= product_working1 product_begin0)), 351584#(not (= product_working1 product_next)), 351586#(not (= product_working1 product_working0)), 351581#(and (= product_next product_end0) (<= (+ product_working1 3) (+ product_begin0 product_workload))), 351580#(and (= product_next product_end0) (<= (+ product_begin1 3) (+ product_begin0 product_workload))), 351583#(or (not (= product_working1 product_next)) (<= (+ product_working1 product_end0 4) (+ product_begin0 product_next))), 351582#(or (not (= product_working1 product_next)) (<= (+ product_working1 product_end0 3) (+ product_begin0 product_next))), 351577#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 351576#false, 351579#(and (= product_next product_end0) (<= (+ (* 2 product_end1) 1) (+ product_begin0 product_workload product_begin1))), 351578#(and (= product_next product_end0) (<= (* 2 product_end1) (+ product_begin0 product_workload product_begin1)))] [2018-07-23 13:38:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:47,109 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:47,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:47,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:47,110 INFO L87 Difference]: Start difference. First operand 2165 states and 3628 transitions. Second operand 12 states. [2018-07-23 13:38:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:48,755 INFO L93 Difference]: Finished difference Result 2392 states and 3991 transitions. [2018-07-23 13:38:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:38:48,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:38:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:48,757 INFO L225 Difference]: With dead ends: 2392 [2018-07-23 13:38:48,757 INFO L226 Difference]: Without dead ends: 2391 [2018-07-23 13:38:48,758 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:38:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-07-23 13:38:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2238. [2018-07-23 13:38:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2018-07-23 13:38:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3754 transitions. [2018-07-23 13:38:49,915 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3754 transitions. Word has length 19 [2018-07-23 13:38:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:49,915 INFO L471 AbstractCegarLoop]: Abstraction has 2238 states and 3754 transitions. [2018-07-23 13:38:49,915 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3754 transitions. [2018-07-23 13:38:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:49,917 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:49,917 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:49,917 INFO L414 AbstractCegarLoop]: === Iteration 89 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1537034535, now seen corresponding path program 1 times [2018-07-23 13:38:49,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:49,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:49,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:49,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:49,934 INFO L185 omatonBuilderFactory]: Interpolants [360901#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 360900#false, 360903#(and (<= (+ (* 2 product_end1) 1) (+ product_begin0 product_workload product_begin1)) (= product_end0 product_next)), 360902#(and (<= (* 2 product_end1) (+ product_begin0 product_workload product_begin1)) (= product_end0 product_next)), 360899#true, 360909#(not (= product_working1 product_begin0)), 360908#(not (= product_working1 product_next)), 360910#(not (= product_working1 product_working0)), 360905#(and (<= (+ product_working1 3) (+ product_begin0 product_workload)) (= product_end0 product_next)), 360904#(and (= product_end0 product_next) (<= (+ product_begin1 3) (+ product_begin0 product_workload))), 360907#(and (<= (+ product_working1 5) (+ product_workload product_end0)) (= product_end0 product_next)), 360906#(and (<= (+ product_working1 4) (+ product_begin0 product_workload)) (= product_end0 product_next))] [2018-07-23 13:38:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:49,934 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:49,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:49,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:49,935 INFO L87 Difference]: Start difference. First operand 2238 states and 3754 transitions. Second operand 12 states. [2018-07-23 13:38:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:51,606 INFO L93 Difference]: Finished difference Result 2500 states and 4176 transitions. [2018-07-23 13:38:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:38:51,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:38:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:51,609 INFO L225 Difference]: With dead ends: 2500 [2018-07-23 13:38:51,609 INFO L226 Difference]: Without dead ends: 2498 [2018-07-23 13:38:51,609 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:38:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2018-07-23 13:38:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2319. [2018-07-23 13:38:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2018-07-23 13:38:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3903 transitions. [2018-07-23 13:38:52,838 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3903 transitions. Word has length 19 [2018-07-23 13:38:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:52,838 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3903 transitions. [2018-07-23 13:38:52,838 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3903 transitions. [2018-07-23 13:38:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:52,840 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:52,840 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:52,840 INFO L414 AbstractCegarLoop]: === Iteration 90 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:52,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1313246452, now seen corresponding path program 2 times [2018-07-23 13:38:52,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:52,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:52,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:38:52,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:52,852 INFO L185 omatonBuilderFactory]: Interpolants [370629#(and (<= (+ product_begin1 4) (+ product_begin0 product_workload)) (= product_end0 product_next)), 370628#(and (= product_end0 product_next) (<= (+ product_begin1 3) (+ product_begin0 product_workload))), 370631#(<= (+ product_begin1 5) (+ product_workload product_next)), 370630#(and (<= (+ product_begin1 5) (+ product_workload product_end0)) (= product_end0 product_next)), 370625#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 370624#false, 370627#(<= (+ product_begin1 3) (+ product_workload product_next)), 370626#(<= (+ (* 2 product_end1) 1) (+ product_workload product_next product_begin1)), 370633#(<= (+ product_working1 5) product_next), 370632#(<= (+ product_working1 5) (+ product_workload product_next)), 370635#(<= (+ product_working1 5) product_working0), 370634#(<= (+ product_working1 5) product_begin0), 370623#true] [2018-07-23 13:38:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:52,852 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:38:52,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:38:52,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:38:52,853 INFO L87 Difference]: Start difference. First operand 2319 states and 3903 transitions. Second operand 13 states. [2018-07-23 13:38:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:54,969 INFO L93 Difference]: Finished difference Result 3166 states and 5350 transitions. [2018-07-23 13:38:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:38:54,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-23 13:38:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:54,972 INFO L225 Difference]: With dead ends: 3166 [2018-07-23 13:38:54,972 INFO L226 Difference]: Without dead ends: 3164 [2018-07-23 13:38:54,972 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:38:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2018-07-23 13:38:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2660. [2018-07-23 13:38:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-07-23 13:38:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4506 transitions. [2018-07-23 13:38:56,413 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4506 transitions. Word has length 19 [2018-07-23 13:38:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 2660 states and 4506 transitions. [2018-07-23 13:38:56,413 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:38:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4506 transitions. [2018-07-23 13:38:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:56,415 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:56,415 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:56,415 INFO L414 AbstractCegarLoop]: === Iteration 91 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1262707917, now seen corresponding path program 1 times [2018-07-23 13:38:56,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:56,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:56,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:56,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:56,431 INFO L185 omatonBuilderFactory]: Interpolants [382341#(not (= product_working1 product_working0)), 382340#(not (= product_working1 product_begin0)), 382337#(or (not (= product_working1 product_next)) (<= (+ product_working1 product_end0 3) (+ product_begin0 product_next))), 382336#(and (= product_next product_end0) (<= (+ product_working1 3) (+ product_begin0 product_workload))), 382339#(not (= product_working1 product_next)), 382338#(or (not (= product_working1 product_next)) (<= (+ product_working1 product_end0 4) (+ product_begin0 product_next))), 382333#(<= (+ (* 2 product_end1) 1) (+ product_workload product_next product_begin1)), 382332#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 382335#(and (= product_next product_end0) (<= (+ product_begin1 3) (+ product_begin0 product_workload))), 382334#(<= (+ product_begin1 3) (+ product_workload product_next)), 382331#false, 382330#true] [2018-07-23 13:38:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:56,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:56,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:56,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:56,432 INFO L87 Difference]: Start difference. First operand 2660 states and 4506 transitions. Second operand 12 states. [2018-07-23 13:38:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:38:58,246 INFO L93 Difference]: Finished difference Result 2926 states and 4919 transitions. [2018-07-23 13:38:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:38:58,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:38:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:38:58,249 INFO L225 Difference]: With dead ends: 2926 [2018-07-23 13:38:58,250 INFO L226 Difference]: Without dead ends: 2925 [2018-07-23 13:38:58,250 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:38:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2018-07-23 13:38:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2743. [2018-07-23 13:38:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2018-07-23 13:38:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4635 transitions. [2018-07-23 13:38:59,863 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4635 transitions. Word has length 19 [2018-07-23 13:38:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:38:59,863 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 4635 transitions. [2018-07-23 13:38:59,863 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:38:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4635 transitions. [2018-07-23 13:38:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:38:59,864 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:38:59,864 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:38:59,865 INFO L414 AbstractCegarLoop]: === Iteration 92 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:38:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1454971237, now seen corresponding path program 1 times [2018-07-23 13:38:59,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:38:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:38:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:59,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:38:59,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:38:59,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:38:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:59,878 INFO L185 omatonBuilderFactory]: Interpolants [393718#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 393719#(<= (+ (* 2 product_end1) 1) (+ product_workload product_next product_begin1)), 393716#true, 393717#false, 393726#(not (= product_working1 product_begin0)), 393727#(not (= product_working1 product_working0)), 393724#(and (<= (+ product_working1 5) (+ product_workload product_end0)) (= product_end0 product_next)), 393725#(not (= product_working1 product_next)), 393722#(and (<= (+ product_working1 3) (+ product_begin0 product_workload)) (= product_end0 product_next)), 393723#(and (<= (+ product_working1 4) (+ product_begin0 product_workload)) (= product_end0 product_next)), 393720#(<= (+ product_begin1 3) (+ product_workload product_next)), 393721#(and (= product_end0 product_next) (<= (+ product_begin1 3) (+ product_begin0 product_workload)))] [2018-07-23 13:38:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:38:59,878 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:38:59,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:38:59,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:38:59,879 INFO L87 Difference]: Start difference. First operand 2743 states and 4635 transitions. Second operand 12 states. [2018-07-23 13:39:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:02,047 INFO L93 Difference]: Finished difference Result 3133 states and 5275 transitions. [2018-07-23 13:39:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:39:02,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:39:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:02,051 INFO L225 Difference]: With dead ends: 3133 [2018-07-23 13:39:02,052 INFO L226 Difference]: Without dead ends: 3131 [2018-07-23 13:39:02,052 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:39:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-07-23 13:39:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2801. [2018-07-23 13:39:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2018-07-23 13:39:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4743 transitions. [2018-07-23 13:39:03,680 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4743 transitions. Word has length 19 [2018-07-23 13:39:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 4743 transitions. [2018-07-23 13:39:03,680 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4743 transitions. [2018-07-23 13:39:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:39:03,681 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:03,681 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:03,681 INFO L414 AbstractCegarLoop]: === Iteration 93 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1425507486, now seen corresponding path program 1 times [2018-07-23 13:39:03,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:03,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:03,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:03,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:03,695 INFO L185 omatonBuilderFactory]: Interpolants [405652#(not (= product_working1 product_begin0)), 405653#(not (= product_working1 product_working0)), 405650#(or (not (= product_working1 product_next)) (<= (+ product_working1 product_end0 4) (+ product_begin0 product_next))), 405651#(not (= product_working1 product_next)), 405648#(and (= product_next product_end0) (<= (+ product_working1 3) (+ product_begin0 product_workload))), 405649#(or (not (= product_working1 product_next)) (<= (+ product_working1 product_end0 3) (+ product_begin0 product_next))), 405646#(<= (+ product_begin1 3) (+ product_workload product_next)), 405647#(<= (+ product_working1 3) (+ product_workload product_next)), 405644#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 405645#(<= (+ (* 2 product_end1) 1) (+ product_workload product_next product_begin1)), 405642#true, 405643#false] [2018-07-23 13:39:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:03,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:03,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:03,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:03,696 INFO L87 Difference]: Start difference. First operand 2801 states and 4743 transitions. Second operand 12 states. [2018-07-23 13:39:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:05,549 INFO L93 Difference]: Finished difference Result 2901 states and 4876 transitions. [2018-07-23 13:39:05,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:39:05,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-23 13:39:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:05,553 INFO L225 Difference]: With dead ends: 2901 [2018-07-23 13:39:05,553 INFO L226 Difference]: Without dead ends: 2899 [2018-07-23 13:39:05,554 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:39:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2018-07-23 13:39:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2806. [2018-07-23 13:39:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2018-07-23 13:39:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4747 transitions. [2018-07-23 13:39:07,180 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4747 transitions. Word has length 19 [2018-07-23 13:39:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:07,180 INFO L471 AbstractCegarLoop]: Abstraction has 2806 states and 4747 transitions. [2018-07-23 13:39:07,180 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4747 transitions. [2018-07-23 13:39:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:39:07,181 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:07,181 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:07,181 INFO L414 AbstractCegarLoop]: === Iteration 94 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1340518044, now seen corresponding path program 3 times [2018-07-23 13:39:07,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:07,197 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:07,197 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:39:07,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:07,198 INFO L185 omatonBuilderFactory]: Interpolants [417124#(not (= product_working1 product_working0)), 417122#(not (= product_working1 product_next)), 417123#(not (= product_working1 product_begin0)), 417120#(and (or (not (= product_working1 product_end0)) (<= (+ product_working1 4) product_begin0)) (or (= product_working1 product_end0) (= product_end0 product_next))), 417121#(and (not (= product_working1 product_end0)) (= product_end0 product_next)), 417118#(<= (+ product_working1 3) product_next), 417119#(and (or (= product_working1 product_end0) (= product_end0 product_next)) (or (not (= product_working1 product_end0)) (<= (+ product_working1 3) product_begin0))), 417116#(<= (+ product_begin1 3) (+ product_workload product_next)), 417117#(<= (+ product_working1 3) (+ product_workload product_next)), 417114#(<= (* 2 product_end1) (+ product_workload product_next product_begin1)), 417115#(<= (+ (* 2 product_end1) 1) (+ product_workload product_next product_begin1)), 417112#true, 417113#false] [2018-07-23 13:39:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:07,198 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:39:07,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:39:07,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:39:07,198 INFO L87 Difference]: Start difference. First operand 2806 states and 4747 transitions. Second operand 13 states. [2018-07-23 13:39:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:09,042 INFO L93 Difference]: Finished difference Result 2882 states and 4840 transitions. [2018-07-23 13:39:09,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:39:09,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-07-23 13:39:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:09,045 INFO L225 Difference]: With dead ends: 2882 [2018-07-23 13:39:09,045 INFO L226 Difference]: Without dead ends: 2881 [2018-07-23 13:39:09,046 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:39:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2018-07-23 13:39:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2808. [2018-07-23 13:39:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2018-07-23 13:39:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4749 transitions. [2018-07-23 13:39:10,668 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4749 transitions. Word has length 19 [2018-07-23 13:39:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 4749 transitions. [2018-07-23 13:39:10,668 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:39:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4749 transitions. [2018-07-23 13:39:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:10,669 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:10,670 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:10,670 INFO L414 AbstractCegarLoop]: === Iteration 95 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 2 times [2018-07-23 13:39:10,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:10,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:10,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:39:10,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:10,684 INFO L185 omatonBuilderFactory]: Interpolants [428550#(and (<= (+ product_working0 2) product_begin1) (= product_end1 product_next)), 428551#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 428548#(and (<= (+ product_working0 1) product_end0) (= product_end0 product_begin1) (= product_end1 product_next)), 428549#(and (<= (+ product_working0 1) product_begin1) (= product_end1 product_next)), 428546#(and (= product_end0 product_begin1) (= product_end1 product_next)), 428547#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 428544#false, 428545#(= product_end0 product_next), 428554#(<= (+ product_working0 4) product_begin1), 428555#(<= (+ product_working0 4) product_working1), 428552#(<= (+ product_working0 3) product_next), 428553#(<= (+ product_working0 3) product_begin1), 428543#true] [2018-07-23 13:39:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:10,684 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:39:10,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:39:10,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:39:10,685 INFO L87 Difference]: Start difference. First operand 2808 states and 4749 transitions. Second operand 13 states. [2018-07-23 13:39:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:12,560 INFO L93 Difference]: Finished difference Result 2926 states and 4924 transitions. [2018-07-23 13:39:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:39:12,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-23 13:39:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:12,564 INFO L225 Difference]: With dead ends: 2926 [2018-07-23 13:39:12,564 INFO L226 Difference]: Without dead ends: 2924 [2018-07-23 13:39:12,564 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:39:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2018-07-23 13:39:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2802. [2018-07-23 13:39:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-07-23 13:39:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4737 transitions. [2018-07-23 13:39:14,266 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4737 transitions. Word has length 21 [2018-07-23 13:39:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:14,266 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4737 transitions. [2018-07-23 13:39:14,266 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:39:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4737 transitions. [2018-07-23 13:39:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:14,268 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:14,268 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:14,268 INFO L414 AbstractCegarLoop]: === Iteration 96 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1322152835, now seen corresponding path program 1 times [2018-07-23 13:39:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:14,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:14,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,280 INFO L185 omatonBuilderFactory]: Interpolants [440038#true, 440039#false, 440048#(<= (+ product_working0 4) product_begin1), 440049#(<= (+ product_working0 4) product_working1), 440046#(<= (+ product_working0 3) product_next), 440047#(<= (+ product_working0 3) product_begin1), 440044#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 440045#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 440042#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 440043#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 440040#(= product_end0 product_next), 440041#(and (= product_end0 product_begin1) (= product_end1 product_next))] [2018-07-23 13:39:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:14,280 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:14,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:14,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:14,281 INFO L87 Difference]: Start difference. First operand 2802 states and 4737 transitions. Second operand 12 states. [2018-07-23 13:39:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:16,168 INFO L93 Difference]: Finished difference Result 2956 states and 4972 transitions. [2018-07-23 13:39:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:39:16,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:16,172 INFO L225 Difference]: With dead ends: 2956 [2018-07-23 13:39:16,172 INFO L226 Difference]: Without dead ends: 2954 [2018-07-23 13:39:16,173 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:39:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-07-23 13:39:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2817. [2018-07-23 13:39:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2018-07-23 13:39:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4761 transitions. [2018-07-23 13:39:17,878 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4761 transitions. Word has length 21 [2018-07-23 13:39:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:17,878 INFO L471 AbstractCegarLoop]: Abstraction has 2817 states and 4761 transitions. [2018-07-23 13:39:17,878 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4761 transitions. [2018-07-23 13:39:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:17,879 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:17,879 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:17,879 INFO L414 AbstractCegarLoop]: === Iteration 97 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 277164812, now seen corresponding path program 1 times [2018-07-23 13:39:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:17,891 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:17,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:17,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:17,891 INFO L185 omatonBuilderFactory]: Interpolants [451622#(<= (+ product_begin0 3) product_begin1), 451623#(<= (+ product_working0 3) product_begin1), 451620#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 451621#(<= (+ product_begin0 3) product_next), 451618#(and (= product_end0 product_begin1) (= product_end1 product_next) (<= (+ product_begin0 1) product_end0)), 451619#(and (= product_end1 product_next) (<= (+ product_begin0 2) product_begin1)), 451616#(= product_end0 product_next), 451617#(and (= product_end0 product_begin1) (= product_end1 product_next)), 451614#true, 451615#false, 451624#(<= (+ product_working0 4) product_begin1), 451625#(<= (+ product_working0 4) product_working1)] [2018-07-23 13:39:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:17,892 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:17,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:17,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:17,892 INFO L87 Difference]: Start difference. First operand 2817 states and 4761 transitions. Second operand 12 states. [2018-07-23 13:39:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:20,126 INFO L93 Difference]: Finished difference Result 3140 states and 5289 transitions. [2018-07-23 13:39:20,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:39:20,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:20,130 INFO L225 Difference]: With dead ends: 3140 [2018-07-23 13:39:20,130 INFO L226 Difference]: Without dead ends: 3138 [2018-07-23 13:39:20,131 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:39:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-07-23 13:39:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2900. [2018-07-23 13:39:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2018-07-23 13:39:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4905 transitions. [2018-07-23 13:39:21,966 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4905 transitions. Word has length 21 [2018-07-23 13:39:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:21,966 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4905 transitions. [2018-07-23 13:39:21,966 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4905 transitions. [2018-07-23 13:39:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:21,967 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:21,967 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:21,967 INFO L414 AbstractCegarLoop]: === Iteration 98 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2146104337, now seen corresponding path program 2 times [2018-07-23 13:39:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:21,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:21,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:21,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:21,979 INFO L185 omatonBuilderFactory]: Interpolants [463747#(<= (+ product_working0 4) product_working1), 463746#(<= (+ product_working0 4) product_begin1), 463745#(<= (+ product_working0 3) product_begin1), 463744#(<= (+ product_working0 3) product_next), 463743#(and (= product_end1 product_next) (<= (+ product_working0 3) product_end1)), 463742#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 463741#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 463740#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 463739#(and (= product_begin1 product_end0) (= product_end1 product_next)), 463738#(= product_end0 product_next), 463737#false, 463736#true] [2018-07-23 13:39:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:21,979 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:21,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:21,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:21,980 INFO L87 Difference]: Start difference. First operand 2900 states and 4905 transitions. Second operand 12 states. [2018-07-23 13:39:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:24,208 INFO L93 Difference]: Finished difference Result 3107 states and 5227 transitions. [2018-07-23 13:39:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:39:24,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:24,211 INFO L225 Difference]: With dead ends: 3107 [2018-07-23 13:39:24,211 INFO L226 Difference]: Without dead ends: 3105 [2018-07-23 13:39:24,211 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:39:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2018-07-23 13:39:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2911. [2018-07-23 13:39:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-07-23 13:39:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4924 transitions. [2018-07-23 13:39:25,947 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4924 transitions. Word has length 21 [2018-07-23 13:39:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:25,947 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 4924 transitions. [2018-07-23 13:39:25,947 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4924 transitions. [2018-07-23 13:39:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:25,948 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:25,949 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:25,949 INFO L414 AbstractCegarLoop]: === Iteration 99 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1101116314, now seen corresponding path program 2 times [2018-07-23 13:39:25,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:25,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:25,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:25,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:25,960 INFO L185 omatonBuilderFactory]: Interpolants [475827#(<= (+ product_working0 4) product_working1), 475826#(<= (+ product_working0 4) product_begin1), 475825#(<= (+ product_working0 3) product_begin1), 475824#(<= (+ product_begin0 3) product_begin1), 475823#(<= (+ product_begin0 3) product_next), 475822#(and (<= (+ product_begin0 3) product_end1) (= product_end1 product_next)), 475821#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 475820#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 475819#(and (= product_begin1 product_end0) (= product_end1 product_next)), 475818#(= product_end0 product_next), 475817#false, 475816#true] [2018-07-23 13:39:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:25,960 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:25,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:25,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:25,961 INFO L87 Difference]: Start difference. First operand 2911 states and 4924 transitions. Second operand 12 states. [2018-07-23 13:39:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:28,078 INFO L93 Difference]: Finished difference Result 3164 states and 5332 transitions. [2018-07-23 13:39:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:39:28,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:28,081 INFO L225 Difference]: With dead ends: 3164 [2018-07-23 13:39:28,081 INFO L226 Difference]: Without dead ends: 3162 [2018-07-23 13:39:28,081 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:39:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2018-07-23 13:39:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2915. [2018-07-23 13:39:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-07-23 13:39:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4930 transitions. [2018-07-23 13:39:29,812 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4930 transitions. Word has length 21 [2018-07-23 13:39:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:29,812 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4930 transitions. [2018-07-23 13:39:29,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4930 transitions. [2018-07-23 13:39:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:29,814 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:29,814 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:29,814 INFO L414 AbstractCegarLoop]: === Iteration 100 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash -825971080, now seen corresponding path program 3 times [2018-07-23 13:39:29,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:29,828 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:29,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:29,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:29,828 INFO L185 omatonBuilderFactory]: Interpolants [488039#(<= (+ product_end0 2) product_begin1), 488038#(<= (+ product_end0 2) product_next), 488037#(and (<= (+ product_end0 2) product_end1) (= product_end1 product_next)), 488036#(and (<= (+ product_end0 1) product_begin1) (= product_end1 product_next)), 488035#(and (= product_begin1 product_end0) (= product_end1 product_next)), 488034#(= product_end0 product_next), 488033#false, 488032#true, 488043#(<= (+ product_working0 4) product_working1), 488042#(<= (+ product_working0 4) product_begin1), 488041#(<= (+ product_working0 3) product_begin1), 488040#(<= (+ product_begin0 3) product_begin1)] [2018-07-23 13:39:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:29,829 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:29,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:29,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:29,829 INFO L87 Difference]: Start difference. First operand 2915 states and 4930 transitions. Second operand 12 states. [2018-07-23 13:39:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:32,048 INFO L93 Difference]: Finished difference Result 3286 states and 5534 transitions. [2018-07-23 13:39:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:39:32,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:32,051 INFO L225 Difference]: With dead ends: 3286 [2018-07-23 13:39:32,051 INFO L226 Difference]: Without dead ends: 3284 [2018-07-23 13:39:32,052 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:39:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2018-07-23 13:39:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2815. [2018-07-23 13:39:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2018-07-23 13:39:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4765 transitions. [2018-07-23 13:39:33,736 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4765 transitions. Word has length 21 [2018-07-23 13:39:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:33,736 INFO L471 AbstractCegarLoop]: Abstraction has 2815 states and 4765 transitions. [2018-07-23 13:39:33,736 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4765 transitions. [2018-07-23 13:39:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:33,738 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:33,738 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:39:33,738 INFO L414 AbstractCegarLoop]: === Iteration 101 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 3 times [2018-07-23 13:39:33,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:33,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:33,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,753 INFO L185 omatonBuilderFactory]: Interpolants [500295#(<= (+ product_begin1 4) product_begin0), 500294#(<= (+ product_begin1 4) product_next), 500293#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 500292#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 500291#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 500290#(<= (+ product_workload product_begin1) product_next), 500289#false, 500288#true, 500299#(not (= product_working1 product_working0)), 500298#(<= (+ product_begin1 2) product_working0), 500297#(<= (+ product_begin1 3) product_working0), 500296#(<= (+ product_begin1 4) product_working0)] [2018-07-23 13:39:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:33,753 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:33,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:33,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:33,754 INFO L87 Difference]: Start difference. First operand 2815 states and 4765 transitions. Second operand 12 states. [2018-07-23 13:39:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:36,371 INFO L93 Difference]: Finished difference Result 3830 states and 6471 transitions. [2018-07-23 13:39:36,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:39:36,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:36,375 INFO L225 Difference]: With dead ends: 3830 [2018-07-23 13:39:36,375 INFO L226 Difference]: Without dead ends: 3828 [2018-07-23 13:39:36,376 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:39:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2018-07-23 13:39:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3225. [2018-07-23 13:39:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states. [2018-07-23 13:39:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5464 transitions. [2018-07-23 13:39:38,277 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5464 transitions. Word has length 21 [2018-07-23 13:39:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 3225 states and 5464 transitions. [2018-07-23 13:39:38,277 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5464 transitions. [2018-07-23 13:39:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:38,278 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:38,278 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:39:38,278 INFO L414 AbstractCegarLoop]: === Iteration 102 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -790589419, now seen corresponding path program 4 times [2018-07-23 13:39:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:38,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:38,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,291 INFO L185 omatonBuilderFactory]: Interpolants [514455#(not (= product_working1 product_working0)), 514454#(<= (+ product_begin1 2) product_working0), 514453#(<= (+ product_begin1 3) product_working0), 514452#(<= (+ product_begin1 3) product_begin0), 514451#(<= (+ product_begin1 4) product_begin0), 514450#(<= (+ product_begin1 4) product_next), 514449#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 514448#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 514447#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 514446#(<= (+ product_workload product_begin1) product_next), 514445#false, 514444#true] [2018-07-23 13:39:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:38,291 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:38,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:38,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:38,291 INFO L87 Difference]: Start difference. First operand 3225 states and 5464 transitions. Second operand 12 states. [2018-07-23 13:39:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:41,068 INFO L93 Difference]: Finished difference Result 3932 states and 6616 transitions. [2018-07-23 13:39:41,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:39:41,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:41,072 INFO L225 Difference]: With dead ends: 3932 [2018-07-23 13:39:41,072 INFO L226 Difference]: Without dead ends: 3930 [2018-07-23 13:39:41,073 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:39:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-07-23 13:39:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3379. [2018-07-23 13:39:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3379 states. [2018-07-23 13:39:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5726 transitions. [2018-07-23 13:39:43,059 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5726 transitions. Word has length 21 [2018-07-23 13:39:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:43,059 INFO L471 AbstractCegarLoop]: Abstraction has 3379 states and 5726 transitions. [2018-07-23 13:39:43,059 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5726 transitions. [2018-07-23 13:39:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:43,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:43,060 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:39:43,060 INFO L414 AbstractCegarLoop]: === Iteration 103 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1656473859, now seen corresponding path program 1 times [2018-07-23 13:39:43,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:43,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:43,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:43,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:43,078 INFO L185 omatonBuilderFactory]: Interpolants [529128#(<= (+ product_working1 4) product_begin0), 529129#(<= (+ product_working1 4) product_working0), 529118#true, 529119#false, 529120#(<= (+ product_workload product_begin1) product_next), 529121#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 529122#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 529123#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 529124#(<= (+ product_begin1 4) product_next), 529125#(<= (+ product_begin1 4) product_begin0), 529126#(<= (+ product_begin1 3) product_begin0), 529127#(<= (+ product_working1 3) product_begin0)] [2018-07-23 13:39:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:43,078 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:43,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:43,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:43,079 INFO L87 Difference]: Start difference. First operand 3379 states and 5726 transitions. Second operand 12 states. [2018-07-23 13:39:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:46,292 INFO L93 Difference]: Finished difference Result 4115 states and 6953 transitions. [2018-07-23 13:39:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:39:46,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:46,295 INFO L225 Difference]: With dead ends: 4115 [2018-07-23 13:39:46,295 INFO L226 Difference]: Without dead ends: 4113 [2018-07-23 13:39:46,295 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:39:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2018-07-23 13:39:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3490. [2018-07-23 13:39:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2018-07-23 13:39:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5892 transitions. [2018-07-23 13:39:48,374 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5892 transitions. Word has length 21 [2018-07-23 13:39:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:48,374 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5892 transitions. [2018-07-23 13:39:48,374 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5892 transitions. [2018-07-23 13:39:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:48,376 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:48,376 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:39:48,376 INFO L414 AbstractCegarLoop]: === Iteration 104 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1656474147, now seen corresponding path program 5 times [2018-07-23 13:39:48,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:48,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:48,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:48,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:48,394 INFO L185 omatonBuilderFactory]: Interpolants [544396#true, 544397#false, 544398#(<= (+ product_workload product_begin1) product_next), 544399#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 544400#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 544401#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 544402#(<= (+ product_begin1 4) product_next), 544403#(<= (+ product_begin1 4) product_begin0), 544404#(<= (+ product_begin1 3) product_begin0), 544405#(<= (+ product_begin1 2) product_begin0), 544406#(<= (+ product_begin1 2) product_working0), 544407#(not (= product_working1 product_working0))] [2018-07-23 13:39:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:48,394 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:48,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:48,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:48,394 INFO L87 Difference]: Start difference. First operand 3490 states and 5892 transitions. Second operand 12 states. [2018-07-23 13:39:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:51,560 INFO L93 Difference]: Finished difference Result 4077 states and 6809 transitions. [2018-07-23 13:39:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:39:51,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:39:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:51,564 INFO L225 Difference]: With dead ends: 4077 [2018-07-23 13:39:51,564 INFO L226 Difference]: Without dead ends: 4075 [2018-07-23 13:39:51,564 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:39:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-07-23 13:39:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3523. [2018-07-23 13:39:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2018-07-23 13:39:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5952 transitions. [2018-07-23 13:39:53,673 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5952 transitions. Word has length 21 [2018-07-23 13:39:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:53,673 INFO L471 AbstractCegarLoop]: Abstraction has 3523 states and 5952 transitions. [2018-07-23 13:39:53,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:39:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5952 transitions. [2018-07-23 13:39:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:53,675 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:53,675 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:39:53,675 INFO L414 AbstractCegarLoop]: === Iteration 105 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1665062316, now seen corresponding path program 2 times [2018-07-23 13:39:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:53,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:53,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:53,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:53,690 INFO L185 omatonBuilderFactory]: Interpolants [559672#(<= (+ product_begin1 3) product_begin0), 559673#(<= (+ product_begin1 2) product_begin0), 559674#(<= (+ product_begin1 1) product_begin0), 559675#(not (= product_working1 product_begin0)), 559676#(not (= product_working1 product_working0)), 559664#true, 559665#false, 559666#(<= 1 product_workload), 559667#(<= (+ product_begin1 1) product_next), 559668#(and (<= (+ product_begin1 1) product_begin0) (= product_end0 product_next)), 559669#(and (<= (+ product_begin1 2) product_begin0) (= product_end0 product_next)), 559670#(and (<= (+ product_begin1 3) product_end0) (= product_end0 product_next)), 559671#(<= (+ product_begin1 3) product_next)] [2018-07-23 13:39:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:53,691 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:39:53,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:39:53,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:39:53,691 INFO L87 Difference]: Start difference. First operand 3523 states and 5952 transitions. Second operand 13 states. [2018-07-23 13:39:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:39:57,166 INFO L93 Difference]: Finished difference Result 4708 states and 7968 transitions. [2018-07-23 13:39:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:39:57,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-23 13:39:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:39:57,170 INFO L225 Difference]: With dead ends: 4708 [2018-07-23 13:39:57,171 INFO L226 Difference]: Without dead ends: 4706 [2018-07-23 13:39:57,171 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:39:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2018-07-23 13:39:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3926. [2018-07-23 13:39:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states. [2018-07-23 13:39:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 6652 transitions. [2018-07-23 13:39:59,510 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 6652 transitions. Word has length 21 [2018-07-23 13:39:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:39:59,510 INFO L471 AbstractCegarLoop]: Abstraction has 3926 states and 6652 transitions. [2018-07-23 13:39:59,510 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:39:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 6652 transitions. [2018-07-23 13:39:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:39:59,511 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:39:59,511 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:39:59,511 INFO L414 AbstractCegarLoop]: === Iteration 106 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:39:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1944645353, now seen corresponding path program 1 times [2018-07-23 13:39:59,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:39:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:39:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:59,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:39:59,524 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:39:59,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:39:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:59,524 INFO L185 omatonBuilderFactory]: Interpolants [577000#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 577001#(<= (+ product_begin1 4) product_next), 577002#(<= (+ product_begin1 3) product_next), 577003#(<= (+ product_begin1 3) product_begin0), 577004#(<= (+ product_begin1 3) product_working0), 577005#(<= (+ product_begin1 2) product_working0), 577006#(not (= product_working1 product_working0)), 576995#true, 576996#false, 576997#(<= (+ product_workload product_begin1) product_next), 576998#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 576999#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next))] [2018-07-23 13:39:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:39:59,524 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:39:59,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:39:59,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:39:59,525 INFO L87 Difference]: Start difference. First operand 3926 states and 6652 transitions. Second operand 12 states. [2018-07-23 13:40:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:02,869 INFO L93 Difference]: Finished difference Result 4890 states and 8270 transitions. [2018-07-23 13:40:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:02,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:02,874 INFO L225 Difference]: With dead ends: 4890 [2018-07-23 13:40:02,875 INFO L226 Difference]: Without dead ends: 4888 [2018-07-23 13:40:02,876 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:40:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2018-07-23 13:40:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4312. [2018-07-23 13:40:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4312 states. [2018-07-23 13:40:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 7318 transitions. [2018-07-23 13:40:05,445 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 7318 transitions. Word has length 21 [2018-07-23 13:40:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:05,445 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 7318 transitions. [2018-07-23 13:40:05,445 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 7318 transitions. [2018-07-23 13:40:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:05,447 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:05,447 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:05,447 INFO L414 AbstractCegarLoop]: === Iteration 107 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash 502417925, now seen corresponding path program 1 times [2018-07-23 13:40:05,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:05,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:05,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:05,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:05,460 INFO L185 omatonBuilderFactory]: Interpolants [595449#(<= (+ product_workload product_begin1) product_next), 595448#false, 595451#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 595450#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 595453#(<= (+ product_begin1 4) product_next), 595452#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 595455#(<= (+ product_begin1 3) product_begin0), 595454#(<= (+ product_begin1 3) product_next), 595457#(<= (+ product_working1 4) product_begin0), 595456#(<= (+ product_working1 3) product_begin0), 595458#(<= (+ product_working1 4) product_working0), 595447#true] [2018-07-23 13:40:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:05,460 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:05,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:05,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:05,461 INFO L87 Difference]: Start difference. First operand 4312 states and 7318 transitions. Second operand 12 states. [2018-07-23 13:40:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:08,971 INFO L93 Difference]: Finished difference Result 5047 states and 8540 transitions. [2018-07-23 13:40:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:40:08,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:08,977 INFO L225 Difference]: With dead ends: 5047 [2018-07-23 13:40:08,977 INFO L226 Difference]: Without dead ends: 5045 [2018-07-23 13:40:08,978 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:40:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2018-07-23 13:40:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4470. [2018-07-23 13:40:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2018-07-23 13:40:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 7567 transitions. [2018-07-23 13:40:11,631 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 7567 transitions. Word has length 21 [2018-07-23 13:40:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:11,631 INFO L471 AbstractCegarLoop]: Abstraction has 4470 states and 7567 transitions. [2018-07-23 13:40:11,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 7567 transitions. [2018-07-23 13:40:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:11,633 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:11,633 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:11,633 INFO L414 AbstractCegarLoop]: === Iteration 108 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 502418213, now seen corresponding path program 2 times [2018-07-23 13:40:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:11,648 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:11,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:11,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:11,648 INFO L185 omatonBuilderFactory]: Interpolants [614537#(<= (+ product_begin1 3) product_begin0), 614536#(<= (+ product_begin1 3) product_next), 614539#(<= (+ product_begin1 2) product_working0), 614538#(<= (+ product_begin1 2) product_begin0), 614540#(not (= product_working1 product_working0)), 614529#true, 614531#(<= (+ product_workload product_begin1) product_next), 614530#false, 614533#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 614532#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 614535#(<= (+ product_begin1 4) product_next), 614534#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next))] [2018-07-23 13:40:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:11,649 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:11,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:11,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:11,649 INFO L87 Difference]: Start difference. First operand 4470 states and 7567 transitions. Second operand 12 states. [2018-07-23 13:40:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:15,408 INFO L93 Difference]: Finished difference Result 5152 states and 8677 transitions. [2018-07-23 13:40:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:40:15,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:15,413 INFO L225 Difference]: With dead ends: 5152 [2018-07-23 13:40:15,413 INFO L226 Difference]: Without dead ends: 5150 [2018-07-23 13:40:15,414 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:40:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2018-07-23 13:40:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 4477. [2018-07-23 13:40:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4477 states. [2018-07-23 13:40:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7584 transitions. [2018-07-23 13:40:18,113 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7584 transitions. Word has length 21 [2018-07-23 13:40:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:18,113 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 7584 transitions. [2018-07-23 13:40:18,113 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7584 transitions. [2018-07-23 13:40:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:18,115 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:18,115 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:18,115 INFO L414 AbstractCegarLoop]: === Iteration 109 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash 511006382, now seen corresponding path program 2 times [2018-07-23 13:40:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:18,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:18,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:18,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:18,128 INFO L185 omatonBuilderFactory]: Interpolants [633857#(not (= product_working1 product_working0)), 633856#(not (= product_working1 product_begin0)), 633849#(and (<= (+ product_begin1 1) product_begin0) (= product_end0 product_next)), 633848#(<= (+ product_begin1 1) product_next), 633851#(and (<= (+ product_begin1 3) product_end0) (= product_end0 product_next)), 633850#(and (<= (+ product_begin1 2) product_begin0) (= product_end0 product_next)), 633853#(<= (+ product_begin1 2) product_next), 633852#(<= (+ product_begin1 3) product_next), 633855#(<= (+ product_begin1 1) product_begin0), 633854#(<= (+ product_begin1 2) product_begin0), 633845#true, 633847#(<= 1 product_workload), 633846#false] [2018-07-23 13:40:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:18,129 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:40:18,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:40:18,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:40:18,129 INFO L87 Difference]: Start difference. First operand 4477 states and 7584 transitions. Second operand 13 states. [2018-07-23 13:40:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:21,985 INFO L93 Difference]: Finished difference Result 5562 states and 9455 transitions. [2018-07-23 13:40:21,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:40:21,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-07-23 13:40:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:21,992 INFO L225 Difference]: With dead ends: 5562 [2018-07-23 13:40:21,992 INFO L226 Difference]: Without dead ends: 5560 [2018-07-23 13:40:21,993 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:40:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2018-07-23 13:40:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 4895. [2018-07-23 13:40:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2018-07-23 13:40:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 8338 transitions. [2018-07-23 13:40:24,995 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 8338 transitions. Word has length 21 [2018-07-23 13:40:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:24,995 INFO L471 AbstractCegarLoop]: Abstraction has 4895 states and 8338 transitions. [2018-07-23 13:40:24,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:40:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 8338 transitions. [2018-07-23 13:40:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:24,996 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:24,997 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:24,997 INFO L414 AbstractCegarLoop]: === Iteration 110 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744866, now seen corresponding path program 1 times [2018-07-23 13:40:24,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:25,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:25,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:25,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:25,011 INFO L185 omatonBuilderFactory]: Interpolants [654809#(and (<= (+ product_end1 2) product_end0) (= product_end0 product_next)), 654808#(and (<= (+ product_end1 1) product_begin0) (= product_end0 product_next)), 654811#(<= (+ product_begin1 3) product_next), 654810#(<= (+ product_end1 2) product_next), 654813#(<= (+ product_working1 3) product_begin0), 654812#(<= (+ product_working1 3) product_next), 654815#(<= (+ product_working1 4) product_working0), 654814#(<= (+ product_working1 4) product_begin0), 654805#false, 654804#true, 654807#(and (<= product_end1 product_begin0) (= product_end0 product_next)), 654806#(<= product_end1 product_next)] [2018-07-23 13:40:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:25,011 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:25,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:25,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:25,012 INFO L87 Difference]: Start difference. First operand 4895 states and 8338 transitions. Second operand 12 states. [2018-07-23 13:40:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:29,089 INFO L93 Difference]: Finished difference Result 5795 states and 9885 transitions. [2018-07-23 13:40:29,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:40:29,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:29,095 INFO L225 Difference]: With dead ends: 5795 [2018-07-23 13:40:29,095 INFO L226 Difference]: Without dead ends: 5793 [2018-07-23 13:40:29,096 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:40:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2018-07-23 13:40:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5351. [2018-07-23 13:40:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2018-07-23 13:40:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 9168 transitions. [2018-07-23 13:40:32,532 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 9168 transitions. Word has length 21 [2018-07-23 13:40:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:32,533 INFO L471 AbstractCegarLoop]: Abstraction has 5351 states and 9168 transitions. [2018-07-23 13:40:32,533 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 9168 transitions. [2018-07-23 13:40:32,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:32,534 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:32,534 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:40:32,534 INFO L414 AbstractCegarLoop]: === Iteration 111 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:32,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1195981155, now seen corresponding path program 3 times [2018-07-23 13:40:32,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:32,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:32,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:32,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:32,550 INFO L185 omatonBuilderFactory]: Interpolants [677146#(<= (+ product_begin1 4) product_next), 677147#(<= (+ product_begin1 3) product_next), 677144#(and (<= (+ product_end0 product_begin1 2) (* 2 product_begin0)) (= product_end0 product_next)), 677145#(and (<= (+ product_begin1 4) product_end0) (= product_end0 product_next)), 677150#(<= (+ product_begin1 2) product_working0), 677151#(not (= product_working1 product_working0)), 677148#(<= (+ product_begin1 2) product_next), 677149#(<= (+ product_begin1 2) product_begin0), 677142#(<= (+ product_workload product_begin1) product_next), 677143#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 677140#true, 677141#false] [2018-07-23 13:40:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:32,551 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:32,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:32,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:32,551 INFO L87 Difference]: Start difference. First operand 5351 states and 9168 transitions. Second operand 12 states. [2018-07-23 13:40:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:36,873 INFO L93 Difference]: Finished difference Result 6216 states and 10633 transitions. [2018-07-23 13:40:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:40:36,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:36,880 INFO L225 Difference]: With dead ends: 6216 [2018-07-23 13:40:36,881 INFO L226 Difference]: Without dead ends: 6214 [2018-07-23 13:40:36,882 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:40:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2018-07-23 13:40:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5792. [2018-07-23 13:40:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5792 states. [2018-07-23 13:40:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 9945 transitions. [2018-07-23 13:40:40,580 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 9945 transitions. Word has length 21 [2018-07-23 13:40:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:40,580 INFO L471 AbstractCegarLoop]: Abstraction has 5792 states and 9945 transitions. [2018-07-23 13:40:40,580 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 9945 transitions. [2018-07-23 13:40:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:40,582 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:40,582 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:40:40,582 INFO L414 AbstractCegarLoop]: === Iteration 112 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1244712345, now seen corresponding path program 1 times [2018-07-23 13:40:40,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:40,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:40,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:40:40,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:40,604 INFO L185 omatonBuilderFactory]: Interpolants [701210#(and (<= (+ product_begin1 1) product_begin0) (= product_end0 product_next)), 701211#(and (<= (+ product_begin1 2) product_begin0) (= product_end0 product_next)), 701208#(<= 1 product_workload), 701209#(<= (+ product_begin1 1) product_next), 701214#(<= (+ product_begin1 2) product_next), 701215#(not (= product_working1 product_next)), 701212#(and (<= (+ product_begin1 3) product_end0) (= product_end0 product_next)), 701213#(<= (+ product_begin1 3) product_next), 701216#(not (= product_working1 product_begin0)), 701217#(not (= product_working1 product_working0)), 701206#true, 701207#false] [2018-07-23 13:40:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 13:40:40,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:40,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:40,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:40,604 INFO L87 Difference]: Start difference. First operand 5792 states and 9945 transitions. Second operand 12 states. [2018-07-23 13:40:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:45,749 INFO L93 Difference]: Finished difference Result 6775 states and 11608 transitions. [2018-07-23 13:40:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:40:45,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:45,757 INFO L225 Difference]: With dead ends: 6775 [2018-07-23 13:40:45,757 INFO L226 Difference]: Without dead ends: 6773 [2018-07-23 13:40:45,759 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:40:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2018-07-23 13:40:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5546. [2018-07-23 13:40:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2018-07-23 13:40:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 9498 transitions. [2018-07-23 13:40:49,545 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 9498 transitions. Word has length 21 [2018-07-23 13:40:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:40:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 5546 states and 9498 transitions. [2018-07-23 13:40:49,546 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:40:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 9498 transitions. [2018-07-23 13:40:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:40:49,547 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:40:49,547 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:40:49,548 INFO L414 AbstractCegarLoop]: === Iteration 113 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:40:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 6 times [2018-07-23 13:40:49,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:40:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:40:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:49,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:40:49,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:40:49,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:40:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:49,565 INFO L185 omatonBuilderFactory]: Interpolants [725929#(not (= product_working1 product_working0)), 725928#(<= (+ product_begin1 2) product_working0), 725919#false, 725918#true, 725923#(and (<= (+ product_end0 product_begin1 1) (* 2 product_begin0)) (= product_end0 product_next)), 725922#(and (<= (+ product_end0 product_begin1) (+ (* 2 product_begin0) 1)) (= product_end0 product_next)), 725921#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 725920#(<= (+ product_workload product_begin1) product_next), 725927#(<= (+ product_begin1 3) product_working0), 725926#(<= (+ product_begin1 3) product_begin0), 725925#(<= (+ product_begin1 3) product_next), 725924#(and (<= (+ product_begin1 3) product_end0) (= product_end0 product_next))] [2018-07-23 13:40:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:40:49,566 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:40:49,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:40:49,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:40:49,566 INFO L87 Difference]: Start difference. First operand 5546 states and 9498 transitions. Second operand 12 states. [2018-07-23 13:40:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:40:56,268 INFO L93 Difference]: Finished difference Result 7993 states and 13790 transitions. [2018-07-23 13:40:56,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:40:56,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:40:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:40:56,277 INFO L225 Difference]: With dead ends: 7993 [2018-07-23 13:40:56,277 INFO L226 Difference]: Without dead ends: 7991 [2018-07-23 13:40:56,279 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:40:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states. [2018-07-23 13:41:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 6894. [2018-07-23 13:41:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2018-07-23 13:41:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11875 transitions. [2018-07-23 13:41:00,957 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11875 transitions. Word has length 21 [2018-07-23 13:41:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:00,957 INFO L471 AbstractCegarLoop]: Abstraction has 6894 states and 11875 transitions. [2018-07-23 13:41:00,957 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:41:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11875 transitions. [2018-07-23 13:41:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:41:00,959 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:00,959 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:41:00,959 INFO L414 AbstractCegarLoop]: === Iteration 114 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:41:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 3 times [2018-07-23 13:41:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:00,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:00,972 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:41:00,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:00,972 INFO L185 omatonBuilderFactory]: Interpolants [755739#false, 755738#true, 755743#(and (<= (+ product_end0 product_begin1 1) (* 2 product_begin0)) (= product_end0 product_next)), 755742#(and (<= (+ product_end0 product_begin1) (+ (* 2 product_begin0) 1)) (= product_end0 product_next)), 755741#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 755740#(<= (+ product_workload product_begin1) product_next), 755747#(<= (+ product_working1 3) product_begin0), 755746#(<= (+ product_begin1 3) product_begin0), 755745#(<= (+ product_begin1 3) product_next), 755744#(and (<= (+ product_begin1 3) product_end0) (= product_end0 product_next)), 755749#(<= (+ product_working1 4) product_working0), 755748#(<= (+ product_working1 4) product_begin0)] [2018-07-23 13:41:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:00,973 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:00,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:00,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:00,973 INFO L87 Difference]: Start difference. First operand 6894 states and 11875 transitions. Second operand 12 states. [2018-07-23 13:41:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:08,146 INFO L93 Difference]: Finished difference Result 8437 states and 14562 transitions. [2018-07-23 13:41:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:41:08,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:41:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:08,156 INFO L225 Difference]: With dead ends: 8437 [2018-07-23 13:41:08,156 INFO L226 Difference]: Without dead ends: 8435 [2018-07-23 13:41:08,158 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:41:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2018-07-23 13:41:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 7260. [2018-07-23 13:41:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2018-07-23 13:41:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 12485 transitions. [2018-07-23 13:41:13,178 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 12485 transitions. Word has length 21 [2018-07-23 13:41:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:13,178 INFO L471 AbstractCegarLoop]: Abstraction has 7260 states and 12485 transitions. [2018-07-23 13:41:13,178 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:41:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 12485 transitions. [2018-07-23 13:41:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:41:13,180 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:13,180 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 13:41:13,180 INFO L414 AbstractCegarLoop]: === Iteration 115 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:41:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 274158605, now seen corresponding path program 7 times [2018-07-23 13:41:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:13,192 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:13,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:41:13,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:13,192 INFO L185 omatonBuilderFactory]: Interpolants [787180#(<= (+ product_workload product_begin1) product_next), 787181#(and (<= (+ product_end0 product_begin1) (* 2 product_begin0)) (= product_end0 product_next)), 787182#(and (<= (+ product_end0 product_begin1) (+ (* 2 product_begin0) 1)) (= product_end0 product_next)), 787183#(and (<= (+ product_end0 product_begin1 1) (* 2 product_begin0)) (= product_end0 product_next)), 787178#true, 787179#false, 787188#(<= (+ product_begin1 2) product_working0), 787189#(not (= product_working1 product_working0)), 787184#(and (<= (+ product_begin1 3) product_end0) (= product_end0 product_next)), 787185#(<= (+ product_begin1 3) product_next), 787186#(<= (+ product_begin1 3) product_begin0), 787187#(<= (+ product_begin1 2) product_begin0)] [2018-07-23 13:41:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:13,193 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:13,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:13,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:13,193 INFO L87 Difference]: Start difference. First operand 7260 states and 12485 transitions. Second operand 12 states. [2018-07-23 13:41:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:20,295 INFO L93 Difference]: Finished difference Result 8575 states and 14718 transitions. [2018-07-23 13:41:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:41:20,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 13:41:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:20,304 INFO L225 Difference]: With dead ends: 8575 [2018-07-23 13:41:20,304 INFO L226 Difference]: Without dead ends: 8573 [2018-07-23 13:41:20,306 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:41:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2018-07-23 13:41:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 7185. [2018-07-23 13:41:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states. [2018-07-23 13:41:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 12367 transitions. [2018-07-23 13:41:25,200 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 12367 transitions. Word has length 21 [2018-07-23 13:41:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:25,200 INFO L471 AbstractCegarLoop]: Abstraction has 7185 states and 12367 transitions. [2018-07-23 13:41:25,200 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:41:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 12367 transitions. [2018-07-23 13:41:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:41:25,202 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:25,202 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:41:25,202 INFO L414 AbstractCegarLoop]: === Iteration 116 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 13:41:25,202 INFO L82 PathProgramCache]: Analyzing trace with hash 282746774, now seen corresponding path program 4 times [2018-07-23 13:41:25,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:25,216 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:25,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:41:25,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:25,217 INFO L185 omatonBuilderFactory]: Interpolants [818760#(<= (+ product_begin1 2) product_begin0), 818761#(<= (+ product_begin1 1) product_begin0), 818762#(not (= product_working1 product_begin0)), 818763#(not (= product_working1 product_working0)), 818756#(and (<= (+ product_begin1 1) product_begin0) (= product_end0 product_next)), 818757#(and (<= product_begin1 product_begin0) (= product_end0 product_next)), 818758#(and (<= (+ product_begin1 2) product_end0) (= product_end0 product_next)), 818759#(<= (+ product_begin1 2) product_next), 818752#true, 818753#false, 818754#(<= 1 product_workload), 818755#(<= (+ product_begin1 1) product_next)] [2018-07-23 13:41:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:25,217 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:25,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:25,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:25,218 INFO L87 Difference]: Start difference. First operand 7185 states and 12367 transitions. Second operand 12 states. Received shutdown request... [2018-07-23 13:41:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:41:27,834 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:41:27,843 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:41:27,844 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:41:27 BoogieIcfgContainer [2018-07-23 13:41:27,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:41:27,846 INFO L168 Benchmark]: Toolchain (without parser) took 253062.54 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 276.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:27,847 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:27,848 INFO L168 Benchmark]: Boogie Preprocessor took 52.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:41:27,848 INFO L168 Benchmark]: RCFGBuilder took 294.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:41:27,850 INFO L168 Benchmark]: TraceAbstraction took 252710.94 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 266.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-23 13:41:27,854 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 294.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252710.94 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 266.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (2380 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (2380 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (2380 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (7185states) and interpolant automaton (currently 25 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (2380 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 252.6s OverallTime, 116 OverallIterations, 4 TraceHistogramMax, 146.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4227 SDtfs, 10864 SDslu, 9224 SDs, 0 SdLazy, 61307 SolverSat, 5404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2552 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12288 ImplicationChecksByTransitivity, 4.2s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7260occurred in iteration=114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 133/1161 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 103.3s AutomataMinimizationTime, 115 MinimizatonAttempts, 23605 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1771 NumberOfCodeBlocks, 1771 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 1655 ConstructedInterpolants, 0 QuantifiedInterpolants, 170266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 7 PerfectInterpolantSequences, 133/1161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-41-27-871.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-41-27-871.csv Completed graceful shutdown