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_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:14:40,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:14:40,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:14:40,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:14:40,691 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:14:40,692 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:14:40,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:14:40,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:14:40,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:14:40,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:14:40,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:14:40,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:14:40,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:14:40,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:14:40,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:14:40,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:14:40,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:14:40,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:14:40,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:14:40,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:14:40,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:14:40,723 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:14:40,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:14:40,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:14:40,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:14:40,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:14:40,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:14:40,735 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:14:40,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:14:40,737 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:14:40,737 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:14:40,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:14:40,738 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:14:40,738 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:14:40,740 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:14:40,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:14:40,741 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-09-30 10:14:40,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:14:40,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:14:40,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:14:40,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:14:40,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:14:40,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:14:40,767 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:14:40,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:14:40,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:14:40,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:14:40,767 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:14:40,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:14:40,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:14:40,768 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:14:40,768 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:14:40,768 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:14:40,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:14:40,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:14:40,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:14:40,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:14:40,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:14:40,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:14:40,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:40,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:14:40,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:14:40,771 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:14:40,771 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:14:40,771 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:14:40,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:14:40,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:14:40,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:14:40,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:14:40,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:14:40,865 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:14:40,865 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:14:40,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-09-30 10:14:40,866 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-30 10:14:40,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:14:40,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:14:40,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:40,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:14:40,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:14:40,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,016 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:14:41,016 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:14:41,016 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:14:41,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:41,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:14:41,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:14:41,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:14:41,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/1) ... [2018-09-30 10:14:41,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:14:41,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:14:41,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:14:41,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:14:41,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (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-09-30 10:14:41,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:14:41,141 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:14:41,141 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:14:42,210 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:14:42,210 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:42 BoogieIcfgContainer [2018-09-30 10:14:42,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:14:42,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:14:42,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:14:42,215 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:14:42,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:40" (1/2) ... [2018-09-30 10:14:42,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c20785e and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:14:42, skipping insertion in model container [2018-09-30 10:14:42,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:42" (2/2) ... [2018-09-30 10:14:42,218 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-30 10:14:42,228 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:14:42,236 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-30 10:14:42,287 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:14:42,288 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:14:42,288 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:14:42,289 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:14:42,289 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:14:42,289 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:14:42,289 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:14:42,289 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:14:42,289 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:14:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-30 10:14:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:14:42,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:42,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:14:42,320 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:42,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-30 10:14:42,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:42,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:42,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:42,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:42,718 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:42,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:42,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:14:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:14:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:42,740 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-30 10:14:42,995 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-30 10:14:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:44,594 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-30 10:14:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:14:44,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:14:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:44,616 INFO L225 Difference]: With dead ends: 142 [2018-09-30 10:14:44,617 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 10:14:44,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-09-30 10:14:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 10:14:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-30 10:14:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 10:14:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-30 10:14:44,681 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-30 10:14:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:44,682 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-30 10:14:44,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:14:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-30 10:14:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:14:44,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:44,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:14:44,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:44,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-30 10:14:44,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:44,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:44,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:44,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:44,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:14:44,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:14:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:44,834 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-30 10:14:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:46,249 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-30 10:14:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:14:46,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:14:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:46,255 INFO L225 Difference]: With dead ends: 241 [2018-09-30 10:14:46,255 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 10:14:46,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 10:14:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-30 10:14:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-30 10:14:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-30 10:14:46,290 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-30 10:14:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:46,290 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-30 10:14:46,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:14:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-30 10:14:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:14:46,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:46,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:14:46,293 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:46,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-30 10:14:46,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:46,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:46,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:46,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:14:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:14:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:46,408 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-30 10:14:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:47,676 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-30 10:14:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:14:47,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:14:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:47,681 INFO L225 Difference]: With dead ends: 269 [2018-09-30 10:14:47,681 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 10:14:47,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 10:14:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-30 10:14:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 10:14:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-30 10:14:47,721 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-30 10:14:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:47,721 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-30 10:14:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:14:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-30 10:14:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:14:47,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:47,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:47,730 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:47,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-30 10:14:47,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:47,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:47,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:47,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:47,880 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:47,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:14:47,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:47,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:47,881 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-30 10:14:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:53,289 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-30 10:14:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:14:53,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:14:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:53,295 INFO L225 Difference]: With dead ends: 790 [2018-09-30 10:14:53,295 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 10:14:53,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:14:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 10:14:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-30 10:14:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-30 10:14:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-30 10:14:53,349 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-30 10:14:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:53,349 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-30 10:14:53,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:14:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-30 10:14:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:14:53,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:53,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:53,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:53,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-30 10:14:53,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:53,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:53,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:53,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:53,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:53,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:53,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:14:53,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:53,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:53,568 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-30 10:14:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:56,530 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-30 10:14:56,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:14:56,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:14:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:56,537 INFO L225 Difference]: With dead ends: 634 [2018-09-30 10:14:56,537 INFO L226 Difference]: Without dead ends: 628 [2018-09-30 10:14:56,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:14:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-30 10:14:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-30 10:14:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-30 10:14:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-30 10:14:56,595 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-30 10:14:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:56,595 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-30 10:14:56,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:14:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-30 10:14:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:14:56,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:56,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:56,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:56,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-30 10:14:56,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:56,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:56,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:56,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:14:56,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:14:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:14:56,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:14:56,744 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-30 10:14:58,299 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:00,843 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-30 10:15:00,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:00,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:00,849 INFO L225 Difference]: With dead ends: 768 [2018-09-30 10:15:00,849 INFO L226 Difference]: Without dead ends: 537 [2018-09-30 10:15:00,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-30 10:15:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-30 10:15:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-30 10:15:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-30 10:15:00,904 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-30 10:15:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:00,904 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-30 10:15:00,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-30 10:15:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:00,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:00,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:00,907 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:00,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-30 10:15:00,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:01,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:01,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:01,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:01,062 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-30 10:15:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:03,658 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-30 10:15:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:15:03,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:03,664 INFO L225 Difference]: With dead ends: 1145 [2018-09-30 10:15:03,665 INFO L226 Difference]: Without dead ends: 812 [2018-09-30 10:15:03,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:15:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-30 10:15:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-30 10:15:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-30 10:15:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-30 10:15:03,734 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-30 10:15:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:03,734 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-30 10:15:03,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-30 10:15:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:03,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:03,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:03,736 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:03,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:03,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-30 10:15:03,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:03,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:03,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:03,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:03,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:03,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:03,846 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-30 10:15:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:06,014 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-30 10:15:06,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:15:06,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:06,020 INFO L225 Difference]: With dead ends: 877 [2018-09-30 10:15:06,021 INFO L226 Difference]: Without dead ends: 871 [2018-09-30 10:15:06,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:15:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-30 10:15:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-30 10:15:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-30 10:15:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-30 10:15:06,111 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-30 10:15:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:06,111 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-30 10:15:06,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:06,111 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-30 10:15:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:06,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:06,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:06,113 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:06,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-30 10:15:06,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:06,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:06,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:06,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:06,314 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-30 10:15:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:08,354 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-30 10:15:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:08,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:08,360 INFO L225 Difference]: With dead ends: 1049 [2018-09-30 10:15:08,361 INFO L226 Difference]: Without dead ends: 818 [2018-09-30 10:15:08,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-30 10:15:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-30 10:15:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-30 10:15:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-30 10:15:08,467 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-30 10:15:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:08,467 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-30 10:15:08,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-30 10:15:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:08,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:08,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:08,469 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:08,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-30 10:15:08,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:08,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:08,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:08,618 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:08,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:08,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:08,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:08,619 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-30 10:15:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:10,284 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-30 10:15:10,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:10,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:10,291 INFO L225 Difference]: With dead ends: 733 [2018-09-30 10:15:10,291 INFO L226 Difference]: Without dead ends: 727 [2018-09-30 10:15:10,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-30 10:15:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-30 10:15:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-30 10:15:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-30 10:15:10,412 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-30 10:15:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:10,412 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-30 10:15:10,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-30 10:15:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:10,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:10,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:10,415 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:10,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-30 10:15:10,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:10,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:10,881 WARN L178 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-09-30 10:15:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:10,910 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:10,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:10,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:10,912 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-30 10:15:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:14,392 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-30 10:15:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:15:14,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:14,405 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 10:15:14,405 INFO L226 Difference]: Without dead ends: 1323 [2018-09-30 10:15:14,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:15:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-30 10:15:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-30 10:15:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-30 10:15:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-30 10:15:14,572 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-30 10:15:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:14,573 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-30 10:15:14,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-30 10:15:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:14,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:14,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:14,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:14,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-30 10:15:14,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:14,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:14,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:14,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:14,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:14,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:14,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:14,951 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-30 10:15:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:17,318 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-30 10:15:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:15:17,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:17,325 INFO L225 Difference]: With dead ends: 1268 [2018-09-30 10:15:17,325 INFO L226 Difference]: Without dead ends: 1262 [2018-09-30 10:15:17,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:15:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-30 10:15:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-30 10:15:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-30 10:15:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-30 10:15:17,472 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-30 10:15:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:17,472 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-30 10:15:17,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-30 10:15:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:17,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:17,474 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:17,475 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:17,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-30 10:15:17,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:17,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:17,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:17,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:17,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:17,577 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:17,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:17,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:17,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:17,579 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-30 10:15:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:20,165 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-30 10:15:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:15:20,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:20,173 INFO L225 Difference]: With dead ends: 1367 [2018-09-30 10:15:20,174 INFO L226 Difference]: Without dead ends: 1361 [2018-09-30 10:15:20,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:15:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-30 10:15:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-30 10:15:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-30 10:15:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-30 10:15:20,359 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-30 10:15:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:20,360 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-30 10:15:20,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-30 10:15:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:20,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:20,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:20,362 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:20,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:20,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-30 10:15:20,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:20,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:20,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:20,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:20,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:20,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:20,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:20,496 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-30 10:15:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:23,614 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-30 10:15:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:15:23,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:23,623 INFO L225 Difference]: With dead ends: 1373 [2018-09-30 10:15:23,623 INFO L226 Difference]: Without dead ends: 1367 [2018-09-30 10:15:23,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:15:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-30 10:15:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-30 10:15:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-30 10:15:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-30 10:15:23,825 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-30 10:15:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:23,825 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-30 10:15:23,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-30 10:15:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:23,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:23,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:23,828 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:23,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-30 10:15:23,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:23,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:23,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:23,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:23,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:23,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:23,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:23,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:23,979 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-30 10:15:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:26,111 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-30 10:15:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:26,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:26,121 INFO L225 Difference]: With dead ends: 1526 [2018-09-30 10:15:26,121 INFO L226 Difference]: Without dead ends: 1520 [2018-09-30 10:15:26,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-30 10:15:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-30 10:15:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 10:15:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-30 10:15:26,366 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-30 10:15:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:26,366 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-30 10:15:26,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-30 10:15:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:26,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:26,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:26,368 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:26,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-30 10:15:26,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:26,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:26,471 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:26,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:26,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:26,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:26,473 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-30 10:15:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:28,653 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-30 10:15:28,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:15:28,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:28,661 INFO L225 Difference]: With dead ends: 1548 [2018-09-30 10:15:28,661 INFO L226 Difference]: Without dead ends: 1542 [2018-09-30 10:15:28,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-30 10:15:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-30 10:15:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 10:15:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-30 10:15:28,883 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-30 10:15:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:28,884 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-30 10:15:28,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-30 10:15:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:28,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:28,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:28,885 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:28,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-30 10:15:28,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:28,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:28,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:28,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:29,045 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:29,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:29,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:29,046 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-30 10:15:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:31,360 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-30 10:15:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:31,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:31,368 INFO L225 Difference]: With dead ends: 1575 [2018-09-30 10:15:31,369 INFO L226 Difference]: Without dead ends: 1569 [2018-09-30 10:15:31,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-30 10:15:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-30 10:15:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-30 10:15:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-30 10:15:31,657 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-30 10:15:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:31,657 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-30 10:15:31,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-30 10:15:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:31,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:31,658 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:31,659 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:31,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-30 10:15:31,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:31,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:31,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:31,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:31,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:31,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:31,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:31,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:31,767 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-30 10:15:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:33,854 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-30 10:15:33,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:33,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:33,865 INFO L225 Difference]: With dead ends: 1597 [2018-09-30 10:15:33,865 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 10:15:33,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 10:15:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-30 10:15:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-30 10:15:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-30 10:15:34,134 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-30 10:15:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-30 10:15:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-30 10:15:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:34,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:34,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:34,137 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:34,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-30 10:15:34,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:34,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:34,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:34,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:34,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:34,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:34,321 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-30 10:15:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:36,450 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-30 10:15:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:15:36,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:36,460 INFO L225 Difference]: With dead ends: 1726 [2018-09-30 10:15:36,460 INFO L226 Difference]: Without dead ends: 1720 [2018-09-30 10:15:36,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-30 10:15:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-30 10:15:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-30 10:15:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-30 10:15:36,773 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-30 10:15:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:36,773 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-30 10:15:36,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-30 10:15:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:36,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:36,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:36,775 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:36,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-30 10:15:36,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:36,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:36,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:36,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:36,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:36,894 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:36,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:36,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:36,895 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-30 10:15:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:39,386 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-30 10:15:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:39,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:39,393 INFO L225 Difference]: With dead ends: 1758 [2018-09-30 10:15:39,393 INFO L226 Difference]: Without dead ends: 1752 [2018-09-30 10:15:39,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:15:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-30 10:15:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-30 10:15:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-30 10:15:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-30 10:15:39,738 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-30 10:15:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:39,738 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-30 10:15:39,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-30 10:15:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:39,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:39,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:39,740 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:39,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-30 10:15:39,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:39,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:39,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:39,828 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:39,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:39,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:39,829 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-30 10:15:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:42,656 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-30 10:15:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:15:42,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:42,661 INFO L225 Difference]: With dead ends: 1867 [2018-09-30 10:15:42,662 INFO L226 Difference]: Without dead ends: 1861 [2018-09-30 10:15:42,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-30 10:15:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-30 10:15:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-30 10:15:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-30 10:15:43,063 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-30 10:15:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:43,063 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-30 10:15:43,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-30 10:15:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:43,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:43,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:43,065 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:43,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-30 10:15:43,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:43,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:43,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:43,213 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:43,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:43,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:43,214 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-30 10:15:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:46,314 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-30 10:15:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:46,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:46,323 INFO L225 Difference]: With dead ends: 1968 [2018-09-30 10:15:46,323 INFO L226 Difference]: Without dead ends: 1962 [2018-09-30 10:15:46,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-30 10:15:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-30 10:15:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-30 10:15:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-30 10:15:46,872 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-30 10:15:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:46,873 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-30 10:15:46,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-30 10:15:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:46,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:46,874 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:46,874 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:46,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-30 10:15:46,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:46,971 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:46,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:46,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:46,972 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-30 10:15:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:49,662 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-30 10:15:49,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:15:49,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:49,669 INFO L225 Difference]: With dead ends: 2001 [2018-09-30 10:15:49,670 INFO L226 Difference]: Without dead ends: 1995 [2018-09-30 10:15:49,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-30 10:15:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-30 10:15:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-30 10:15:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-30 10:15:50,220 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-30 10:15:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:50,221 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-30 10:15:50,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-30 10:15:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:50,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:50,222 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:50,222 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:50,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-30 10:15:50,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:50,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:50,314 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:50,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:50,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:50,315 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-30 10:15:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:52,780 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-30 10:15:52,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:15:52,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:52,785 INFO L225 Difference]: With dead ends: 1708 [2018-09-30 10:15:52,785 INFO L226 Difference]: Without dead ends: 1702 [2018-09-30 10:15:52,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-30 10:15:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-30 10:15:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-30 10:15:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-30 10:15:53,236 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-30 10:15:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:53,236 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-30 10:15:53,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-30 10:15:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:53,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:53,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:53,238 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:53,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:53,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-30 10:15:53,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:53,467 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:53,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:53,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:53,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:53,468 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-30 10:15:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:56,977 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-30 10:15:56,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:15:56,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:56,983 INFO L225 Difference]: With dead ends: 2402 [2018-09-30 10:15:56,983 INFO L226 Difference]: Without dead ends: 2396 [2018-09-30 10:15:56,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-30 10:15:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-30 10:15:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-30 10:15:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-30 10:15:57,527 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-30 10:15:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:57,527 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-30 10:15:57,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-30 10:15:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:57,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:57,529 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:57,529 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:57,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-30 10:15:57,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:57,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:57,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:57,633 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:57,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:57,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:57,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:57,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:57,635 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-30 10:16:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:00,802 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-30 10:16:00,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:16:00,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:16:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:00,807 INFO L225 Difference]: With dead ends: 2274 [2018-09-30 10:16:00,808 INFO L226 Difference]: Without dead ends: 2268 [2018-09-30 10:16:00,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:16:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-30 10:16:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-30 10:16:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-30 10:16:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-30 10:16:01,432 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-30 10:16:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:01,432 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-30 10:16:01,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:16:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-30 10:16:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:01,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:01,433 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 10:16:01,434 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:01,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-30 10:16:01,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:01,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:01,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:01,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:01,472 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:01,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:16:01,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:16:01,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:16:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:16:01,473 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-30 10:16:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:02,449 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-30 10:16:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:16:02,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 10:16:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:02,451 INFO L225 Difference]: With dead ends: 2170 [2018-09-30 10:16:02,452 INFO L226 Difference]: Without dead ends: 1253 [2018-09-30 10:16:02,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:16:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-30 10:16:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-30 10:16:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-30 10:16:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-30 10:16:02,935 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-30 10:16:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:02,935 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-30 10:16:02,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:16:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-30 10:16:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:02,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:02,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:02,937 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:02,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-30 10:16:02,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:02,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:02,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:03,079 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:03,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:03,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:03,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:03,080 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-30 10:16:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:06,946 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-30 10:16:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:16:06,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:06,951 INFO L225 Difference]: With dead ends: 2095 [2018-09-30 10:16:06,951 INFO L226 Difference]: Without dead ends: 2093 [2018-09-30 10:16:06,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:16:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-30 10:16:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-30 10:16:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-30 10:16:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-30 10:16:07,503 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-30 10:16:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:07,503 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-30 10:16:07,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-30 10:16:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:07,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:07,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:07,505 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:07,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:07,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-30 10:16:07,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:07,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:07,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:07,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:07,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:07,939 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-09-30 10:16:08,272 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-09-30 10:16:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:08,324 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:08,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:08,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:08,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:08,324 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-09-30 10:16:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:12,100 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-09-30 10:16:12,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:16:12,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:12,104 INFO L225 Difference]: With dead ends: 1994 [2018-09-30 10:16:12,105 INFO L226 Difference]: Without dead ends: 1988 [2018-09-30 10:16:12,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:16:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-09-30 10:16:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-09-30 10:16:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-09-30 10:16:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-09-30 10:16:12,697 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-09-30 10:16:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:12,698 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-09-30 10:16:12,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-09-30 10:16:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:12,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:12,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:12,700 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:12,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-09-30 10:16:12,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:12,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:12,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:12,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:12,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:12,870 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-09-30 10:16:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:17,204 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-09-30 10:16:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:16:17,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:17,208 INFO L225 Difference]: With dead ends: 2160 [2018-09-30 10:16:17,209 INFO L226 Difference]: Without dead ends: 2154 [2018-09-30 10:16:17,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:16:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-09-30 10:16:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-09-30 10:16:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-09-30 10:16:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-09-30 10:16:17,853 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-09-30 10:16:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:17,853 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-09-30 10:16:17,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-09-30 10:16:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:17,855 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:17,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:17,855 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:17,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-09-30 10:16:17,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:17,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:18,016 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:18,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:18,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:18,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:18,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:18,017 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-09-30 10:16:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:22,295 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-09-30 10:16:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:16:22,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:22,299 INFO L225 Difference]: With dead ends: 2094 [2018-09-30 10:16:22,299 INFO L226 Difference]: Without dead ends: 2088 [2018-09-30 10:16:22,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:16:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-09-30 10:16:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-09-30 10:16:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-09-30 10:16:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-09-30 10:16:22,926 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-09-30 10:16:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:22,926 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-09-30 10:16:22,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-09-30 10:16:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:22,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:22,927 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 10:16:22,927 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:22,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-09-30 10:16:22,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:22,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:22,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:22,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:22,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:16:22,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:16:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:16:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:16:22,980 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-09-30 10:16:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:23,996 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-09-30 10:16:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:16:23,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 10:16:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:23,999 INFO L225 Difference]: With dead ends: 1929 [2018-09-30 10:16:23,999 INFO L226 Difference]: Without dead ends: 1400 [2018-09-30 10:16:24,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:16:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-09-30 10:16:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-09-30 10:16:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-09-30 10:16:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-09-30 10:16:24,813 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-09-30 10:16:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:24,813 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-09-30 10:16:24,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:16:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-09-30 10:16:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:24,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:24,814 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:24,814 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:24,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-09-30 10:16:24,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:24,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:24,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:24,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:24,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:24,916 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:24,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:24,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:24,917 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-09-30 10:16:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:28,790 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-09-30 10:16:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:16:28,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:28,795 INFO L225 Difference]: With dead ends: 2276 [2018-09-30 10:16:28,795 INFO L226 Difference]: Without dead ends: 2270 [2018-09-30 10:16:28,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:16:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-09-30 10:16:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-09-30 10:16:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-09-30 10:16:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-09-30 10:16:29,615 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-09-30 10:16:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:29,615 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-09-30 10:16:29,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-09-30 10:16:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:29,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:29,617 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:29,617 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:29,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-09-30 10:16:29,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:29,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:29,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:29,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:29,731 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:29,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:29,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:29,732 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-09-30 10:16:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:34,034 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-09-30 10:16:34,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:16:34,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:34,040 INFO L225 Difference]: With dead ends: 2425 [2018-09-30 10:16:34,040 INFO L226 Difference]: Without dead ends: 2419 [2018-09-30 10:16:34,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:16:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-09-30 10:16:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-09-30 10:16:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-09-30 10:16:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-09-30 10:16:35,021 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-09-30 10:16:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:35,021 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-09-30 10:16:35,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-09-30 10:16:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:35,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:35,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:35,024 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:35,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-09-30 10:16:35,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:35,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:35,240 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-09-30 10:16:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:35,270 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:35,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:35,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:35,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:35,271 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-09-30 10:16:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:39,892 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-09-30 10:16:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:16:39,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:39,897 INFO L225 Difference]: With dead ends: 2278 [2018-09-30 10:16:39,898 INFO L226 Difference]: Without dead ends: 2272 [2018-09-30 10:16:39,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:16:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-09-30 10:16:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-09-30 10:16:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-09-30 10:16:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-09-30 10:16:40,801 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-09-30 10:16:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:40,801 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-09-30 10:16:40,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-09-30 10:16:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:40,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:40,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:40,803 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:40,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-09-30 10:16:40,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:40,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:41,049 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:41,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:41,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:41,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:41,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:41,051 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-09-30 10:16:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:45,279 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-09-30 10:16:45,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:16:45,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:45,286 INFO L225 Difference]: With dead ends: 2233 [2018-09-30 10:16:45,286 INFO L226 Difference]: Without dead ends: 2227 [2018-09-30 10:16:45,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:16:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-09-30 10:16:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-09-30 10:16:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-09-30 10:16:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-09-30 10:16:46,205 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-09-30 10:16:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:46,205 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-09-30 10:16:46,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-09-30 10:16:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:46,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:46,206 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:46,206 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:46,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-09-30 10:16:46,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:46,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:46,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:46,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:46,368 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:46,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:46,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:46,370 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-09-30 10:16:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:51,065 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-09-30 10:16:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:16:51,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:51,071 INFO L225 Difference]: With dead ends: 2558 [2018-09-30 10:16:51,071 INFO L226 Difference]: Without dead ends: 2552 [2018-09-30 10:16:51,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:16:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-09-30 10:16:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-09-30 10:16:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-09-30 10:16:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-09-30 10:16:52,051 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-09-30 10:16:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:52,051 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-09-30 10:16:52,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-09-30 10:16:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:52,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:52,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:52,053 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:52,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-09-30 10:16:52,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:52,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:52,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:52,173 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:52,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:52,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:52,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:52,174 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-09-30 10:16:52,313 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-09-30 10:16:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:57,045 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-09-30 10:16:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:16:57,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:16:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:57,050 INFO L225 Difference]: With dead ends: 2703 [2018-09-30 10:16:57,051 INFO L226 Difference]: Without dead ends: 2697 [2018-09-30 10:16:57,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:16:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-09-30 10:16:58,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-09-30 10:16:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-30 10:16:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-09-30 10:16:58,158 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-09-30 10:16:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:58,159 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-09-30 10:16:58,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-09-30 10:16:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:16:58,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:58,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:58,160 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:58,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:58,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-09-30 10:16:58,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:58,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:58,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:58,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:58,387 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:58,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:16:58,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:58,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:58,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:58,388 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-09-30 10:17:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:03,565 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-09-30 10:17:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:17:03,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:17:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:03,573 INFO L225 Difference]: With dead ends: 2674 [2018-09-30 10:17:03,573 INFO L226 Difference]: Without dead ends: 2668 [2018-09-30 10:17:03,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:17:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-09-30 10:17:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-09-30 10:17:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-30 10:17:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-09-30 10:17:04,614 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-09-30 10:17:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:04,615 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-09-30 10:17:04,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-09-30 10:17:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:17:04,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:04,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:04,616 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:04,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-09-30 10:17:04,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:04,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:04,725 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:04,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:04,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:04,726 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-09-30 10:17:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:10,193 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-09-30 10:17:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:17:10,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:17:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:10,200 INFO L225 Difference]: With dead ends: 2722 [2018-09-30 10:17:10,200 INFO L226 Difference]: Without dead ends: 2716 [2018-09-30 10:17:10,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:17:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-09-30 10:17:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-09-30 10:17:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-09-30 10:17:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-09-30 10:17:11,341 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-09-30 10:17:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:11,342 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-09-30 10:17:11,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-09-30 10:17:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:11,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:11,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:11,343 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:11,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-09-30 10:17:11,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:11,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:11,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:11,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:11,435 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:11,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:11,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:11,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:11,437 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-09-30 10:17:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:16,501 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-09-30 10:17:16,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:17:16,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:17:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:16,506 INFO L225 Difference]: With dead ends: 2962 [2018-09-30 10:17:16,507 INFO L226 Difference]: Without dead ends: 2956 [2018-09-30 10:17:16,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:17:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-09-30 10:17:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-09-30 10:17:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-09-30 10:17:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-09-30 10:17:17,821 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-09-30 10:17:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:17,821 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-09-30 10:17:17,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-09-30 10:17:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:17,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:17,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:17,823 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:17,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-09-30 10:17:17,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:17,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:17,896 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:17,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:17,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:17,896 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-09-30 10:17:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:23,004 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-09-30 10:17:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:17:23,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:17:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:23,012 INFO L225 Difference]: With dead ends: 2948 [2018-09-30 10:17:23,012 INFO L226 Difference]: Without dead ends: 2942 [2018-09-30 10:17:23,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:17:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-09-30 10:17:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-09-30 10:17:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-09-30 10:17:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-09-30 10:17:24,431 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-09-30 10:17:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:24,432 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-09-30 10:17:24,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-09-30 10:17:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:24,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:24,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:24,433 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:24,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:24,433 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-09-30 10:17:24,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:24,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:24,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:24,516 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:24,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:24,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:24,517 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-09-30 10:17:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:30,581 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-09-30 10:17:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:17:30,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:17:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:30,587 INFO L225 Difference]: With dead ends: 3238 [2018-09-30 10:17:30,588 INFO L226 Difference]: Without dead ends: 3232 [2018-09-30 10:17:30,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:17:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-09-30 10:17:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-09-30 10:17:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-09-30 10:17:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-09-30 10:17:32,039 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-09-30 10:17:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:32,039 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-09-30 10:17:32,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-09-30 10:17:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:32,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:32,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:32,041 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:32,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-09-30 10:17:32,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:32,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:32,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:32,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:32,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:32,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:32,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:32,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:32,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:32,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:32,348 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-09-30 10:17:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:38,577 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-09-30 10:17:38,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:17:38,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:17:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:38,583 INFO L225 Difference]: With dead ends: 3212 [2018-09-30 10:17:38,583 INFO L226 Difference]: Without dead ends: 3206 [2018-09-30 10:17:38,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:17:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-09-30 10:17:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-09-30 10:17:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-09-30 10:17:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-09-30 10:17:40,009 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-09-30 10:17:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:40,009 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-09-30 10:17:40,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-09-30 10:17:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:40,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:40,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:40,010 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:40,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-09-30 10:17:40,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:40,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:40,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:40,092 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:40,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:40,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:40,093 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-09-30 10:17:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:45,873 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-09-30 10:17:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:17:45,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:17:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:45,880 INFO L225 Difference]: With dead ends: 3315 [2018-09-30 10:17:45,880 INFO L226 Difference]: Without dead ends: 3309 [2018-09-30 10:17:45,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:17:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-09-30 10:17:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-09-30 10:17:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-09-30 10:17:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-09-30 10:17:47,635 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-09-30 10:17:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:47,635 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-09-30 10:17:47,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-09-30 10:17:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:47,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:47,636 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:47,636 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:47,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-09-30 10:17:47,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:47,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:47,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:47,739 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:47,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:47,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:47,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:47,740 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-09-30 10:17:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:54,290 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-09-30 10:17:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:17:54,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:17:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:54,297 INFO L225 Difference]: With dead ends: 3446 [2018-09-30 10:17:54,297 INFO L226 Difference]: Without dead ends: 3440 [2018-09-30 10:17:54,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:17:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-09-30 10:17:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-09-30 10:17:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-09-30 10:17:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-09-30 10:17:56,123 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-09-30 10:17:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:56,123 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-09-30 10:17:56,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:17:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-09-30 10:17:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:17:56,125 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:56,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:56,125 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:56,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-09-30 10:17:56,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:56,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:56,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:56,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:56,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:17:56,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:17:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:17:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:17:56,258 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-09-30 10:18:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:01,709 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-09-30 10:18:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:18:01,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:18:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:01,715 INFO L225 Difference]: With dead ends: 2832 [2018-09-30 10:18:01,715 INFO L226 Difference]: Without dead ends: 2824 [2018-09-30 10:18:01,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:18:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-09-30 10:18:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-09-30 10:18:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-09-30 10:18:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-09-30 10:18:03,423 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-09-30 10:18:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:03,423 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-09-30 10:18:03,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:18:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-09-30 10:18:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:18:03,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:03,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:03,425 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:03,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-09-30 10:18:03,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:03,585 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:18:03,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:18:03,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:18:03,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:18:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:18:03,586 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-09-30 10:18:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:09,567 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-09-30 10:18:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:18:09,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 10:18:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:09,574 INFO L225 Difference]: With dead ends: 3157 [2018-09-30 10:18:09,574 INFO L226 Difference]: Without dead ends: 3151 [2018-09-30 10:18:09,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:18:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-09-30 10:18:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-09-30 10:18:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-09-30 10:18:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-09-30 10:18:11,416 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-09-30 10:18:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:11,416 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-09-30 10:18:11,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:18:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-09-30 10:18:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:18:11,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:11,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:11,418 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:11,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-09-30 10:18:11,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:11,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:11,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:11,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:11,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:11,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:18:11,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:18:11,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:18:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:18:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:18:11,535 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-09-30 10:18:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:20,114 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-09-30 10:18:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:18:20,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 10:18:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:20,122 INFO L225 Difference]: With dead ends: 3822 [2018-09-30 10:18:20,122 INFO L226 Difference]: Without dead ends: 3816 [2018-09-30 10:18:20,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-09-30 10:18:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-09-30 10:18:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-09-30 10:18:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-09-30 10:18:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-09-30 10:18:22,152 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-09-30 10:18:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:22,153 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-09-30 10:18:22,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:18:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-09-30 10:18:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:18:22,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:22,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:22,154 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:22,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:22,155 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-09-30 10:18:22,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:22,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:22,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:22,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:22,293 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:18:22,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:18:22,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:18:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:18:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:18:22,294 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-09-30 10:18:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:31,454 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-09-30 10:18:31,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:18:31,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 10:18:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:31,462 INFO L225 Difference]: With dead ends: 4144 [2018-09-30 10:18:31,462 INFO L226 Difference]: Without dead ends: 4138 [2018-09-30 10:18:31,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-09-30 10:18:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-09-30 10:18:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-09-30 10:18:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-09-30 10:18:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-09-30 10:18:33,789 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-09-30 10:18:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:33,789 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-09-30 10:18:33,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:18:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-09-30 10:18:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:18:33,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:33,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:33,791 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:33,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-09-30 10:18:33,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:33,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:33,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:33,962 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:18:33,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:18:33,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:18:33,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:18:33,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:18:33,963 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-09-30 10:18:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:41,098 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-09-30 10:18:41,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:18:41,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 10:18:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:41,105 INFO L225 Difference]: With dead ends: 3320 [2018-09-30 10:18:41,106 INFO L226 Difference]: Without dead ends: 3314 [2018-09-30 10:18:41,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:18:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-09-30 10:18:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-09-30 10:18:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-09-30 10:18:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-09-30 10:18:43,655 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-09-30 10:18:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:43,655 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-09-30 10:18:43,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:18:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-09-30 10:18:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:18:43,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:43,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:43,657 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:43,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-09-30 10:18:43,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:43,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:43,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:43,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:18:43,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:18:43,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:43,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:43,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:43,827 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-09-30 10:18:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:53,336 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-09-30 10:18:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:18:53,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 10:18:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:53,344 INFO L225 Difference]: With dead ends: 4113 [2018-09-30 10:18:53,345 INFO L226 Difference]: Without dead ends: 4107 [2018-09-30 10:18:53,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:18:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-09-30 10:18:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-09-30 10:18:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-09-30 10:18:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-09-30 10:18:55,765 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-09-30 10:18:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:55,765 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-09-30 10:18:55,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:18:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-09-30 10:18:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:18:55,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:55,766 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:55,766 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-09-30 10:18:55,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:55,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:55,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:56,236 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:18:56,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:18:56,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:18:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:18:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:18:56,237 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 10:19:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:19:04,957 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:19:04,963 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:19:04,963 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:19:04 BoogieIcfgContainer [2018-09-30 10:19:04,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:19:04,964 INFO L168 Benchmark]: Toolchain (without parser) took 264000.32 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 861.6 MB in the end (delta: 599.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-30 10:19:04,965 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:04,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:04,965 INFO L168 Benchmark]: Boogie Preprocessor took 39.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:04,966 INFO L168 Benchmark]: RCFGBuilder took 1151.04 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:19:04,966 INFO L168 Benchmark]: TraceAbstraction took 262751.62 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 861.6 MB in the end (delta: 557.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-30 10:19:04,969 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.40 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 39.63 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 1151.04 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262751.62 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 861.6 MB in the end (delta: 557.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (3624 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 262.6s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 213.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14983 SDtfs, 26637 SDslu, 28667 SDs, 0 SdLazy, 102880 SolverSat, 9515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2260occurred in iteration=50, 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: 39.7s AutomataMinimizationTime, 52 MinimizatonAttempts, 43801 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 25219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 6/6 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_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-19-05-018.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-19-05-018.csv Completed graceful shutdown