java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:34:58,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:34:58,723 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:34:58,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:34:58,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:34:58,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:34:58,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:34:58,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:34:58,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:34:58,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:34:58,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:34:58,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:34:58,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:34:58,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:34:58,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:34:58,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:34:58,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:34:58,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:34:58,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:34:58,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:34:58,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:34:58,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:34:58,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:34:58,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:34:58,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:34:58,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:34:58,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:34:58,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:34:58,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:34:58,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:34:58,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:34:58,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:34:58,767 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:34:58,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:34:58,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:34:58,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:34:58,769 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:34:58,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:34:58,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:34:58,786 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:34:58,786 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:34:58,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:34:58,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:34:58,787 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:34:58,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:34:58,787 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:34:58,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:34:58,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:34:58,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:34:58,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:34:58,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:34:58,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:34:58,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:34:58,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:34:58,789 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:34:58,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:34:58,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:34:58,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:34:58,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:34:58,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:34:58,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:34:58,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:34:58,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:34:58,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:34:58,791 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:34:58,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:34:58,791 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:34:58,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:34:58,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:34:58,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:34:58,866 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:34:58,866 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:34:58,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-10-02 11:34:58,868 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-10-02 11:34:58,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:34:58,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:34:58,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:34:58,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:34:58,962 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:34:58,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:58,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,003 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:34:59,003 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:34:59,004 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:34:59,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:34:59,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:34:59,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:34:59,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:34:59,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... [2018-10-02 11:34:59,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:34:59,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:34:59,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:34:59,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:34:59,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:34:59,115 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 11:34:59,115 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 11:34:59,116 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 11:35:00,154 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:35:00,154 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:00 BoogieIcfgContainer [2018-10-02 11:35:00,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:35:00,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:35:00,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:35:00,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:35:00,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:34:58" (1/2) ... [2018-10-02 11:35:00,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c3a00c and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:00, skipping insertion in model container [2018-10-02 11:35:00,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:00" (2/2) ... [2018-10-02 11:35:00,162 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-10-02 11:35:00,172 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:35:00,181 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-02 11:35:00,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:35:00,228 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:35:00,228 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:35:00,228 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:35:00,228 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:35:00,229 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:35:00,229 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:35:00,229 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:35:00,229 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:35:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-02 11:35:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:00,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:00,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:00,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:00,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-02 11:35:00,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:00,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:00,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:00,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:00,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:00,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:00,582 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-02 11:35:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:02,528 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-02 11:35:02,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:02,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 11:35:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:02,548 INFO L225 Difference]: With dead ends: 163 [2018-10-02 11:35:02,549 INFO L226 Difference]: Without dead ends: 158 [2018-10-02 11:35:02,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-02 11:35:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-02 11:35:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-02 11:35:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-02 11:35:02,610 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-02 11:35:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:02,610 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-02 11:35:02,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-02 11:35:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:02,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:02,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:02,613 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:02,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-02 11:35:02,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:02,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:02,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:35:02,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:35:02,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:35:02,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:02,732 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-02 11:35:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:03,598 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-02 11:35:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:35:03,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 11:35:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:03,602 INFO L225 Difference]: With dead ends: 188 [2018-10-02 11:35:03,602 INFO L226 Difference]: Without dead ends: 183 [2018-10-02 11:35:03,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-02 11:35:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-02 11:35:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-02 11:35:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-02 11:35:03,642 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-02 11:35:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:03,643 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-02 11:35:03,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:35:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-02 11:35:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:35:03,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:03,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:03,647 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:03,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-02 11:35:03,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:03,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:03,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:03,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:03,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:03,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:03,759 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-02 11:35:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:05,402 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-10-02 11:35:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:35:05,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-02 11:35:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:05,407 INFO L225 Difference]: With dead ends: 361 [2018-10-02 11:35:05,407 INFO L226 Difference]: Without dead ends: 349 [2018-10-02 11:35:05,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-02 11:35:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-10-02 11:35:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-02 11:35:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-10-02 11:35:05,448 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-10-02 11:35:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:05,448 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-10-02 11:35:05,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-10-02 11:35:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:35:05,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:05,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:05,451 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:05,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-02 11:35:05,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:05,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:05,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:05,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:05,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:05,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:05,560 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-10-02 11:35:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:06,794 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-10-02 11:35:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:35:06,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-02 11:35:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:06,800 INFO L225 Difference]: With dead ends: 307 [2018-10-02 11:35:06,801 INFO L226 Difference]: Without dead ends: 302 [2018-10-02 11:35:06,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-02 11:35:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-10-02 11:35:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-02 11:35:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-02 11:35:06,841 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-02 11:35:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:06,841 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-02 11:35:06,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-02 11:35:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:06,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:06,844 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:06,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:06,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-02 11:35:06,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:06,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:06,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:06,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:06,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:06,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:06,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:06,968 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-10-02 11:35:07,594 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-02 11:35:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:11,895 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-10-02 11:35:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:35:11,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:11,902 INFO L225 Difference]: With dead ends: 741 [2018-10-02 11:35:11,903 INFO L226 Difference]: Without dead ends: 733 [2018-10-02 11:35:11,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:35:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-02 11:35:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-10-02 11:35:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-02 11:35:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-10-02 11:35:11,957 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-10-02 11:35:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:11,958 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-10-02 11:35:11,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-10-02 11:35:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:11,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:11,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:11,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:11,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-02 11:35:11,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:12,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:12,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:12,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:12,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:12,172 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-10-02 11:35:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:16,890 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-10-02 11:35:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:35:16,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:16,899 INFO L225 Difference]: With dead ends: 797 [2018-10-02 11:35:16,899 INFO L226 Difference]: Without dead ends: 789 [2018-10-02 11:35:16,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:35:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-02 11:35:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-10-02 11:35:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-02 11:35:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-10-02 11:35:16,982 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-10-02 11:35:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:16,982 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-10-02 11:35:16,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-10-02 11:35:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:16,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:16,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:16,985 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:16,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-02 11:35:16,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:16,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:16,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:16,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:17,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:17,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:17,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:17,182 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-10-02 11:35:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:19,079 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-10-02 11:35:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:19,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:19,085 INFO L225 Difference]: With dead ends: 684 [2018-10-02 11:35:19,085 INFO L226 Difference]: Without dead ends: 676 [2018-10-02 11:35:19,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:35:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-02 11:35:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-10-02 11:35:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-02 11:35:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-10-02 11:35:19,142 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-10-02 11:35:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:19,142 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-10-02 11:35:19,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-10-02 11:35:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:19,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:19,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:19,144 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:19,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-02 11:35:19,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:19,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:19,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:19,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:19,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:19,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:19,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:19,240 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-10-02 11:35:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:20,610 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-10-02 11:35:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:35:20,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:20,614 INFO L225 Difference]: With dead ends: 605 [2018-10-02 11:35:20,614 INFO L226 Difference]: Without dead ends: 597 [2018-10-02 11:35:20,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-02 11:35:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-10-02 11:35:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-02 11:35:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-10-02 11:35:20,686 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-10-02 11:35:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:20,687 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-10-02 11:35:20,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-10-02 11:35:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:20,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:20,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:20,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:20,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-10-02 11:35:20,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:20,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:20,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:20,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:20,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:20,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:20,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:20,902 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-10-02 11:35:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:23,297 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-10-02 11:35:23,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:23,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:23,304 INFO L225 Difference]: With dead ends: 935 [2018-10-02 11:35:23,304 INFO L226 Difference]: Without dead ends: 927 [2018-10-02 11:35:23,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:35:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-02 11:35:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-10-02 11:35:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-02 11:35:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-10-02 11:35:23,392 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-10-02 11:35:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:23,393 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-10-02 11:35:23,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-10-02 11:35:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:23,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:23,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:23,394 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:23,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:23,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-10-02 11:35:23,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:23,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:23,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:23,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:23,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:23,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:23,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:23,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:23,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:23,481 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-10-02 11:35:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:25,528 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-10-02 11:35:25,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:25,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:25,535 INFO L225 Difference]: With dead ends: 923 [2018-10-02 11:35:25,536 INFO L226 Difference]: Without dead ends: 915 [2018-10-02 11:35:25,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:35:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-02 11:35:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-10-02 11:35:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-02 11:35:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-10-02 11:35:25,625 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-10-02 11:35:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:25,625 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-10-02 11:35:25,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-10-02 11:35:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:25,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:25,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:25,627 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:25,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-10-02 11:35:25,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:25,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:25,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:25,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:25,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:25,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:25,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:25,708 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-10-02 11:35:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:27,481 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-10-02 11:35:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:35:27,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:27,486 INFO L225 Difference]: With dead ends: 837 [2018-10-02 11:35:27,487 INFO L226 Difference]: Without dead ends: 829 [2018-10-02 11:35:27,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-02 11:35:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-10-02 11:35:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-02 11:35:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-10-02 11:35:27,594 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-10-02 11:35:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:27,594 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-10-02 11:35:27,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-10-02 11:35:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:27,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:27,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:27,596 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:27,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-10-02 11:35:27,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:27,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:27,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:27,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:27,895 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-10-02 11:35:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:30,114 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-10-02 11:35:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:35:30,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:30,120 INFO L225 Difference]: With dead ends: 996 [2018-10-02 11:35:30,121 INFO L226 Difference]: Without dead ends: 988 [2018-10-02 11:35:30,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:35:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-02 11:35:30,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-10-02 11:35:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-02 11:35:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-02 11:35:30,246 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-02 11:35:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:30,248 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-02 11:35:30,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-02 11:35:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:30,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:30,249 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:30,250 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:30,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-10-02 11:35:30,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:30,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:30,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:30,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:30,867 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-02 11:35:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:32,936 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-10-02 11:35:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:35:32,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:32,943 INFO L225 Difference]: With dead ends: 913 [2018-10-02 11:35:32,943 INFO L226 Difference]: Without dead ends: 905 [2018-10-02 11:35:32,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:35:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-10-02 11:35:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-10-02 11:35:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-02 11:35:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-10-02 11:35:33,038 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-10-02 11:35:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:33,039 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-10-02 11:35:33,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-10-02 11:35:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:33,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:33,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:33,040 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:33,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-10-02 11:35:33,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:33,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:33,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-10-02 11:35:33,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:33,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:33,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:33,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:33,139 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-10-02 11:35:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:34,801 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-10-02 11:35:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:34,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 11:35:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:34,806 INFO L225 Difference]: With dead ends: 886 [2018-10-02 11:35:34,806 INFO L226 Difference]: Without dead ends: 878 [2018-10-02 11:35:34,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:35:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-10-02 11:35:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-10-02 11:35:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-02 11:35:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-10-02 11:35:34,911 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-10-02 11:35:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:34,911 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-10-02 11:35:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-10-02 11:35:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:34,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:34,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:34,912 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:34,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-02 11:35:34,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:34,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:35,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:35,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:35,010 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-10-02 11:35:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:36,959 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-10-02 11:35:36,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:36,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:36,963 INFO L225 Difference]: With dead ends: 801 [2018-10-02 11:35:36,963 INFO L226 Difference]: Without dead ends: 793 [2018-10-02 11:35:36,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:35:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-10-02 11:35:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-10-02 11:35:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-02 11:35:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-10-02 11:35:37,101 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-10-02 11:35:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:37,102 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-10-02 11:35:37,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-10-02 11:35:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:37,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:37,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:37,103 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:37,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-10-02 11:35:37,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:37,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:37,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:37,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:37,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:37,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:37,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:37,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:37,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:37,192 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-10-02 11:35:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:39,677 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-10-02 11:35:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:35:39,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:39,683 INFO L225 Difference]: With dead ends: 962 [2018-10-02 11:35:39,683 INFO L226 Difference]: Without dead ends: 954 [2018-10-02 11:35:39,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:35:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-02 11:35:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-10-02 11:35:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-02 11:35:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-10-02 11:35:39,843 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-10-02 11:35:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:39,843 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-10-02 11:35:39,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-10-02 11:35:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:39,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:39,844 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:39,845 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:39,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-02 11:35:39,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:39,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:39,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:39,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:39,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:39,956 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-10-02 11:35:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:42,405 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-10-02 11:35:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:35:42,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:42,411 INFO L225 Difference]: With dead ends: 1000 [2018-10-02 11:35:42,412 INFO L226 Difference]: Without dead ends: 992 [2018-10-02 11:35:42,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:35:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-02 11:35:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-10-02 11:35:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-02 11:35:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-10-02 11:35:42,580 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-10-02 11:35:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:42,581 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-10-02 11:35:42,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-10-02 11:35:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:42,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:42,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:42,583 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:42,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-10-02 11:35:42,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:42,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:42,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:42,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:42,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:42,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:42,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:42,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:42,738 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-10-02 11:35:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:45,555 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-10-02 11:35:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:35:45,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:45,561 INFO L225 Difference]: With dead ends: 1065 [2018-10-02 11:35:45,561 INFO L226 Difference]: Without dead ends: 1057 [2018-10-02 11:35:45,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-02 11:35:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-10-02 11:35:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-02 11:35:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-10-02 11:35:45,761 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-10-02 11:35:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:45,761 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-10-02 11:35:45,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-10-02 11:35:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:45,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:45,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:45,763 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-10-02 11:35:45,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:45,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:45,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:45,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:45,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:45,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:45,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:45,857 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-10-02 11:35:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:49,132 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-10-02 11:35:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:35:49,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:49,139 INFO L225 Difference]: With dead ends: 1227 [2018-10-02 11:35:49,139 INFO L226 Difference]: Without dead ends: 1219 [2018-10-02 11:35:49,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:35:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-02 11:35:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-10-02 11:35:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-02 11:35:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-10-02 11:35:49,342 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-10-02 11:35:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:49,342 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-10-02 11:35:49,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-10-02 11:35:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:49,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:49,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:49,343 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:49,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-02 11:35:49,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:49,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:49,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:49,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:49,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:49,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:49,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:49,434 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-10-02 11:35:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:52,246 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-10-02 11:35:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:35:52,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:52,252 INFO L225 Difference]: With dead ends: 1076 [2018-10-02 11:35:52,252 INFO L226 Difference]: Without dead ends: 1068 [2018-10-02 11:35:52,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-02 11:35:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-10-02 11:35:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-02 11:35:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-10-02 11:35:52,477 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-10-02 11:35:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:52,478 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-10-02 11:35:52,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-10-02 11:35:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:52,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:52,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:52,479 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:52,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-10-02 11:35:52,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:52,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:52,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:52,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:52,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-10-02 11:35:52,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:52,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:52,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:52,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:52,580 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-10-02 11:35:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:55,284 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-10-02 11:35:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:55,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:55,290 INFO L225 Difference]: With dead ends: 1111 [2018-10-02 11:35:55,290 INFO L226 Difference]: Without dead ends: 1103 [2018-10-02 11:35:55,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-10-02 11:35:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-10-02 11:35:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-02 11:35:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-10-02 11:35:55,597 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-10-02 11:35:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:55,598 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-10-02 11:35:55,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-10-02 11:35:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:55,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:55,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:55,599 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:55,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-10-02 11:35:55,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,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-10-02 11:35:55,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:55,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:55,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:55,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:55,705 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-10-02 11:35:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:59,241 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-10-02 11:35:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:35:59,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:35:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:59,249 INFO L225 Difference]: With dead ends: 1304 [2018-10-02 11:35:59,250 INFO L226 Difference]: Without dead ends: 1296 [2018-10-02 11:35:59,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-02 11:35:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-10-02 11:35:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-02 11:35:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-10-02 11:35:59,591 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-10-02 11:35:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:59,591 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-10-02 11:35:59,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-10-02 11:35:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:59,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:59,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:59,593 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:59,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-10-02 11:35:59,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:59,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:59,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:59,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:59,669 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-10-02 11:36:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:03,576 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-10-02 11:36:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:36:03,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:36:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:03,584 INFO L225 Difference]: With dead ends: 1370 [2018-10-02 11:36:03,584 INFO L226 Difference]: Without dead ends: 1362 [2018-10-02 11:36:03,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:36:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-10-02 11:36:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-10-02 11:36:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-02 11:36:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-10-02 11:36:03,898 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-10-02 11:36:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:03,899 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-10-02 11:36:03,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:36:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-10-02 11:36:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:36:03,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:03,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:03,900 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:03,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-02 11:36:03,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:03,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:36:03,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:36:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:36:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:36:03,985 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-10-02 11:36:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:06,832 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-10-02 11:36:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:36:06,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 11:36:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:06,837 INFO L225 Difference]: With dead ends: 1298 [2018-10-02 11:36:06,837 INFO L226 Difference]: Without dead ends: 1290 [2018-10-02 11:36:06,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:36:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-02 11:36:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-10-02 11:36:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-02 11:36:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-02 11:36:07,254 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-02 11:36:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:07,254 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-02 11:36:07,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:36:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-02 11:36:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:07,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:07,255 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:07,255 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:07,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-10-02 11:36:07,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:07,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:07,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:07,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:07,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:36:07,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:36:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:36:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:36:07,432 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-02 11:36:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:08,315 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-10-02 11:36:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:36:08,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-02 11:36:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:08,317 INFO L225 Difference]: With dead ends: 1242 [2018-10-02 11:36:08,318 INFO L226 Difference]: Without dead ends: 673 [2018-10-02 11:36:08,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-02 11:36:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-10-02 11:36:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-02 11:36:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-10-02 11:36:08,765 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-10-02 11:36:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:08,765 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-10-02 11:36:08,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:36:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-10-02 11:36:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:08,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:08,766 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:08,766 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:08,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-10-02 11:36:08,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:08,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:08,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:08,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:08,845 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:08,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:08,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:10,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:10,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-02 11:36:10,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:10,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:10,374 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-10-02 11:36:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:14,567 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-10-02 11:36:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:36:14,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-02 11:36:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:14,570 INFO L225 Difference]: With dead ends: 854 [2018-10-02 11:36:14,571 INFO L226 Difference]: Without dead ends: 849 [2018-10-02 11:36:14,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-02 11:36:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-10-02 11:36:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-02 11:36:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-10-02 11:36:15,609 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-10-02 11:36:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:15,610 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-10-02 11:36:15,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:36:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-10-02 11:36:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:15,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:15,611 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:15,611 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:15,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-10-02 11:36:15,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:15,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:15,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:36:15,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:36:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:36:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:36:15,817 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-10-02 11:36:16,237 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-02 11:36:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:17,936 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-10-02 11:36:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:36:17,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-02 11:36:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:17,939 INFO L225 Difference]: With dead ends: 1308 [2018-10-02 11:36:17,939 INFO L226 Difference]: Without dead ends: 709 [2018-10-02 11:36:17,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-02 11:36:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-10-02 11:36:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-02 11:36:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-02 11:36:18,686 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-02 11:36:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:18,686 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-02 11:36:18,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:36:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-02 11:36:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:18,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:18,687 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:18,687 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:18,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-10-02 11:36:18,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:18,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:18,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:18,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:18,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:19,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:19,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:19,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:19,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:19,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:36:19,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:36:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:36:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:19,657 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-10-02 11:36:27,309 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-02 11:36:32,638 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-02 11:36:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:36,075 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-10-02 11:36:36,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-02 11:36:36,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:36:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:36,079 INFO L225 Difference]: With dead ends: 2011 [2018-10-02 11:36:36,079 INFO L226 Difference]: Without dead ends: 2003 [2018-10-02 11:36:36,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-10-02 11:36:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-10-02 11:36:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-10-02 11:36:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-10-02 11:36:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-10-02 11:36:37,259 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-10-02 11:36:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:37,259 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-10-02 11:36:37,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:36:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-10-02 11:36:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:37,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:37,260 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:37,261 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:37,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:37,261 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-10-02 11:36:37,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:37,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:37,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:37,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:37,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:37,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:37,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:37,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:37,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:37,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:36:37,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:36:37,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:36:37,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:37,539 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-10-02 11:36:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:50,621 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-10-02 11:36:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-02 11:36:50,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:36:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:50,628 INFO L225 Difference]: With dead ends: 2797 [2018-10-02 11:36:50,628 INFO L226 Difference]: Without dead ends: 2789 [2018-10-02 11:36:50,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-10-02 11:36:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-10-02 11:36:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-10-02 11:36:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-10-02 11:36:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-10-02 11:36:51,879 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-10-02 11:36:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:51,879 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-10-02 11:36:51,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:36:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-10-02 11:36:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:51,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:51,880 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:51,881 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:51,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:51,881 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-10-02 11:36:51,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:51,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:51,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:51,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:51,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:52,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:52,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:52,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:52,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:52,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:52,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:36:52,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:36:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:36:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:52,457 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-10-02 11:37:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:04,221 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-10-02 11:37:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-02 11:37:04,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:37:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:04,228 INFO L225 Difference]: With dead ends: 2492 [2018-10-02 11:37:04,228 INFO L226 Difference]: Without dead ends: 2484 [2018-10-02 11:37:04,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-10-02 11:37:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-10-02 11:37:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-10-02 11:37:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-10-02 11:37:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-10-02 11:37:05,657 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-10-02 11:37:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:05,657 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-10-02 11:37:05,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-10-02 11:37:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:05,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:05,658 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:05,659 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:05,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-10-02 11:37:05,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:05,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:05,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:05,749 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:05,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:05,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:37:05,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-02 11:37:05,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:05,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:05,938 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-10-02 11:37:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:22,829 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-10-02 11:37:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-02 11:37:22,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:37:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:22,838 INFO L225 Difference]: With dead ends: 3178 [2018-10-02 11:37:22,839 INFO L226 Difference]: Without dead ends: 3170 [2018-10-02 11:37:22,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-10-02 11:37:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-10-02 11:37:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-10-02 11:37:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-10-02 11:37:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-10-02 11:37:24,398 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-10-02 11:37:24,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:24,398 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-10-02 11:37:24,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-10-02 11:37:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:24,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:24,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:24,400 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:24,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:24,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-10-02 11:37:24,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:24,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:24,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:24,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:24,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:24,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:24,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:24,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:37:24,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-02 11:37:24,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:24,707 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-10-02 11:37:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:38,285 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-10-02 11:37:38,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-02 11:37:38,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:37:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:38,289 INFO L225 Difference]: With dead ends: 2638 [2018-10-02 11:37:38,289 INFO L226 Difference]: Without dead ends: 2630 [2018-10-02 11:37:38,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-10-02 11:37:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-02 11:37:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-10-02 11:37:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-10-02 11:37:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-10-02 11:37:39,879 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-10-02 11:37:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:39,879 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-10-02 11:37:39,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-10-02 11:37:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:39,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:39,880 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:39,881 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:39,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:39,881 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-10-02 11:37:39,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:39,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:39,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:39,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:39,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:39,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:40,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:40,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:37:40,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:40,182 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-10-02 11:37:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:54,011 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-10-02 11:37:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-02 11:37:54,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:37:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:54,015 INFO L225 Difference]: With dead ends: 2854 [2018-10-02 11:37:54,015 INFO L226 Difference]: Without dead ends: 2846 [2018-10-02 11:37:54,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-10-02 11:37:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-10-02 11:37:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-10-02 11:37:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-10-02 11:37:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-10-02 11:37:55,715 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-10-02 11:37:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:55,715 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-10-02 11:37:55,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-10-02 11:37:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:37:55,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:55,716 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:55,717 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:55,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-10-02 11:37:55,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:55,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:55,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:55,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:55,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:55,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:55,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:55,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:56,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:56,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:37:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:56,211 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-10-02 11:38:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:11,686 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-10-02 11:38:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-02 11:38:11,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:38:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:11,690 INFO L225 Difference]: With dead ends: 3363 [2018-10-02 11:38:11,690 INFO L226 Difference]: Without dead ends: 3355 [2018-10-02 11:38:11,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-10-02 11:38:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-10-02 11:38:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-10-02 11:38:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-10-02 11:38:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-10-02 11:38:13,412 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-10-02 11:38:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:13,412 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-10-02 11:38:13,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-10-02 11:38:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:13,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:13,413 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:13,414 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:13,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-10-02 11:38:13,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:13,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:13,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:13,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:13,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:13,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:13,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:13,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:13,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:13,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-10-02 11:38:13,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:38:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:38:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:38:13,687 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-10-02 11:38:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:30,407 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-10-02 11:38:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-02 11:38:30,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-10-02 11:38:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:30,411 INFO L225 Difference]: With dead ends: 2910 [2018-10-02 11:38:30,411 INFO L226 Difference]: Without dead ends: 2902 [2018-10-02 11:38:30,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-10-02 11:38:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-10-02 11:38:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-10-02 11:38:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-02 11:38:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-10-02 11:38:31,983 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-10-02 11:38:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:31,983 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-10-02 11:38:31,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:38:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-10-02 11:38:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:31,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:31,984 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:31,984 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:31,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-10-02 11:38:31,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:31,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:31,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:31,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:31,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:32,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:32,151 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:32,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:32,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:32,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:32,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 11:38:32,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:32,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:32,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:32,372 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-10-02 11:38:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:46,210 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-10-02 11:38:46,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-02 11:38:46,210 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:38:46,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:46,213 INFO L225 Difference]: With dead ends: 2474 [2018-10-02 11:38:46,213 INFO L226 Difference]: Without dead ends: 2466 [2018-10-02 11:38:46,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-10-02 11:38:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-10-02 11:38:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-10-02 11:38:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-02 11:38:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-10-02 11:38:47,610 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-10-02 11:38:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:47,610 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-10-02 11:38:47,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-10-02 11:38:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:47,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:47,611 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:47,611 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:47,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:47,611 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-10-02 11:38:47,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:47,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:47,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:47,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:47,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:47,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:47,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:47,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:47,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:47,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:47,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:38:47,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:38:47,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:38:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:38:47,746 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-10-02 11:38:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:51,294 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-10-02 11:38:51,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:38:51,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:38:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:51,297 INFO L225 Difference]: With dead ends: 1522 [2018-10-02 11:38:51,297 INFO L226 Difference]: Without dead ends: 1514 [2018-10-02 11:38:51,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:38:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-10-02 11:38:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-10-02 11:38:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-02 11:38:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-10-02 11:38:53,114 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-10-02 11:38:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:53,114 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-10-02 11:38:53,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:38:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-10-02 11:38:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:53,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:53,117 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:53,117 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:53,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-10-02 11:38:53,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:53,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:53,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:53,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:53,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:53,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:53,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:53,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:53,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:38:53,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:38:53,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:38:53,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:38:53,363 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-10-02 11:38:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:57,369 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-10-02 11:38:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:38:57,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:38:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:57,372 INFO L225 Difference]: With dead ends: 1661 [2018-10-02 11:38:57,372 INFO L226 Difference]: Without dead ends: 1653 [2018-10-02 11:38:57,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:38:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-10-02 11:38:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-10-02 11:38:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-10-02 11:38:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-10-02 11:38:58,832 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-10-02 11:38:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:58,832 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-10-02 11:38:58,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:38:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-10-02 11:38:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:38:58,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:58,833 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:58,833 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:58,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-10-02 11:38:58,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:58,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:58,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:58,900 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:58,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:58,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:58,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:38:58,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:38:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:38:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:38:58,944 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-10-02 11:39:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:03,787 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-10-02 11:39:03,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:39:03,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:39:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:03,790 INFO L225 Difference]: With dead ends: 1772 [2018-10-02 11:39:03,790 INFO L226 Difference]: Without dead ends: 1764 [2018-10-02 11:39:03,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:39:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-02 11:39:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-10-02 11:39:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-10-02 11:39:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-10-02 11:39:05,540 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-10-02 11:39:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:05,540 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-10-02 11:39:05,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:39:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-10-02 11:39:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:39:05,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:05,541 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:05,541 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:05,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-10-02 11:39:05,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:05,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:05,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:05,626 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:05,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:05,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:05,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:05,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:39:05,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:39:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:39:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:39:05,665 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-10-02 11:39:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:09,755 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-10-02 11:39:09,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:39:09,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-02 11:39:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:09,758 INFO L225 Difference]: With dead ends: 1789 [2018-10-02 11:39:09,758 INFO L226 Difference]: Without dead ends: 1781 [2018-10-02 11:39:09,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:39:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-10-02 11:39:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-10-02 11:39:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-10-02 11:39:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-10-02 11:39:11,405 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-10-02 11:39:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:11,405 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-10-02 11:39:11,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:39:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-10-02 11:39:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:39:11,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:11,406 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:11,406 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:11,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:11,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-10-02 11:39:11,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:11,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:11,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:11,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:11,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:11,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:11,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:11,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:39:11,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:39:11,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:39:11,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:39:11,506 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. Received shutdown request... [2018-10-02 11:39:11,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:39:11,600 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:39:11,608 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:39:11,608 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:11 BoogieIcfgContainer [2018-10-02 11:39:11,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:11,609 INFO L168 Benchmark]: Toolchain (without parser) took 252652.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 41.4 MB). Peak memory consumption was 783.2 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:11,611 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-10-02 11:39:11,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.82 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-10-02 11:39:11,611 INFO L168 Benchmark]: Boogie Preprocessor took 36.29 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-10-02 11:39:11,612 INFO L168 Benchmark]: RCFGBuilder took 1111.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:11,612 INFO L168 Benchmark]: TraceAbstraction took 251452.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 9.6 MB). Peak memory consumption was 751.5 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:11,615 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.82 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 36.29 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 1111.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251452.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 9.6 MB). Peak memory consumption was 751.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 4 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 251.3s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 215.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12062 SDtfs, 40604 SDslu, 48484 SDs, 0 SdLazy, 117836 SolverSat, 8797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2023 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 1707 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51475 ImplicationChecksByTransitivity, 40.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 25.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 716 ConstructedInterpolants, 78 QuantifiedInterpolants, 46500 SizeOfPredicates, 88 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 40/83 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_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-39-11-626.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-39-11-626.csv Completed graceful shutdown