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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:42:43,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:42:43,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:42:43,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:42:43,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:42:43,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:42:43,785 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:42:43,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:42:43,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:42:43,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:42:43,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:42:43,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:42:43,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:42:43,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:42:43,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:42:43,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:42:43,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:42:43,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:42:43,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:42:43,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:42:43,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:42:43,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:42:43,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:42:43,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:42:43,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:42:43,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:42:43,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:42:43,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:42:43,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:42:43,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:42:43,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:42:43,827 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:42:43,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:42:43,827 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:42:43,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:42:43,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:42:43,831 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 10:42:43,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:42:43,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:42:43,861 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:42:43,861 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:42:43,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:42:43,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:42:43,862 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:42:43,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:42:43,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:42:43,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:42:43,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:42:43,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:42:43,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:42:43,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:42:43,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:42:43,864 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:42:43,865 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:42:43,865 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:42:43,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:42:43,865 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:42:43,865 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:42:43,866 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:42:43,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:43,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:42:43,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:42:43,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:42:43,867 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:42:43,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:42:43,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:42:43,867 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:42:43,868 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:42:43,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:42:43,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:42:43,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:42:43,946 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:42:43,947 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:42:43,948 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:42:43,948 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-30 10:42:44,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:42:44,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:42:44,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:44,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:42:44,073 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:42:44,094 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:42:44" (1/1) ... [2018-09-30 10:42:44,115 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:42:44" (1/1) ... [2018-09-30 10:42:44,123 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:42:44,123 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:42:44,124 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:42:44,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:44,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:42:44,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:42:44,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:42:44,140 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:42:44" (1/1) ... [2018-09-30 10:42:44,140 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:42:44" (1/1) ... [2018-09-30 10:42:44,143 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:42:44" (1/1) ... [2018-09-30 10:42:44,143 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:42:44" (1/1) ... [2018-09-30 10:42:44,164 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:42:44" (1/1) ... [2018-09-30 10:42:44,177 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:42:44" (1/1) ... [2018-09-30 10:42:44,182 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:42:44" (1/1) ... [2018-09-30 10:42:44,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:42:44,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:42:44,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:42:44,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:42:44,196 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:42:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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:42:44,273 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:42:44,274 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:42:44,274 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:42:45,407 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:42:45,408 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:45 BoogieIcfgContainer [2018-09-30 10:42:45,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:42:45,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:42:45,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:42:45,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:42:45,412 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:42:44" (1/2) ... [2018-09-30 10:42:45,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cbbdcd and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:42:45, skipping insertion in model container [2018-09-30 10:42:45,414 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:42:45" (2/2) ... [2018-09-30 10:42:45,416 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-30 10:42:45,425 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:42:45,436 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-30 10:42:45,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:42:45,494 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:42:45,494 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:42:45,495 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:42:45,495 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:42:45,495 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:42:45,495 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:42:45,495 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:42:45,495 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:42:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-30 10:42:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:45,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:45,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:45,535 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:45,547 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-30 10:42:45,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:45,756 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:42:45,758 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:45,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:45,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:45,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:45,778 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-30 10:42:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:49,258 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-30 10:42:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:42:49,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:49,281 INFO L225 Difference]: With dead ends: 142 [2018-09-30 10:42:49,281 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 10:42:49,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 10:42:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-30 10:42:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 10:42:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-30 10:42:49,355 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-30 10:42:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:49,356 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-30 10:42:49,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-30 10:42:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:49,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:49,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:49,361 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:49,361 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-30 10:42:49,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:49,485 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:42:49,486 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:49,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:49,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:49,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:49,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:49,489 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-30 10:42:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:53,735 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-30 10:42:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:42:53,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:53,743 INFO L225 Difference]: With dead ends: 241 [2018-09-30 10:42:53,744 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 10:42:53,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 10:42:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-30 10:42:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-30 10:42:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-30 10:42:53,788 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-30 10:42:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:53,788 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-30 10:42:53,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-30 10:42:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:53,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:53,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:53,791 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:53,791 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:53,791 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-30 10:42:53,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:53,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:53,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:53,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:53,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:53,863 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:42:53,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:53,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:53,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:53,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:53,865 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-30 10:42:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:57,690 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-30 10:42:57,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:42:57,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:57,695 INFO L225 Difference]: With dead ends: 269 [2018-09-30 10:42:57,696 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 10:42:57,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 10:42:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-30 10:42:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 10:42:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-30 10:42:57,753 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-30 10:42:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:57,754 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-30 10:42:57,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-30 10:42:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:42:57,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:57,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:57,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:57,757 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:57,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-30 10:42:57,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:57,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:57,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:57,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:57,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:57,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:42:57,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:57,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:42:57,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:42:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:42:57,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:57,880 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-30 10:43:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:09,045 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-30 10:43:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:43:09,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:09,051 INFO L225 Difference]: With dead ends: 790 [2018-09-30 10:43:09,051 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 10:43:09,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 10:43:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-30 10:43:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-30 10:43:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-30 10:43:09,111 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-30 10:43:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:09,111 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-30 10:43:09,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-30 10:43:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:09,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:09,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:09,114 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:09,115 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-30 10:43:09,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:09,306 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:43:09,307 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:09,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:09,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:09,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:09,308 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-30 10:43:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:19,785 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-30 10:43:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:43:19,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:19,790 INFO L225 Difference]: With dead ends: 634 [2018-09-30 10:43:19,790 INFO L226 Difference]: Without dead ends: 628 [2018-09-30 10:43:19,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-30 10:43:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-30 10:43:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-30 10:43:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-30 10:43:19,850 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-30 10:43:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:19,851 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-30 10:43:19,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-30 10:43:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:19,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:19,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:19,854 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:19,854 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-30 10:43:19,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:19,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:19,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:19,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:19,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:19,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:19,984 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:19,984 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-30 10:43:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:29,358 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-30 10:43:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:29,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:29,362 INFO L225 Difference]: With dead ends: 768 [2018-09-30 10:43:29,362 INFO L226 Difference]: Without dead ends: 537 [2018-09-30 10:43:29,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-30 10:43:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-30 10:43:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-30 10:43:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-30 10:43:29,429 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-30 10:43:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:29,429 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-30 10:43:29,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-30 10:43:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:29,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:29,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:29,432 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:29,432 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-30 10:43:29,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:29,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:29,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:29,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:29,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:29,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:29,552 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-30 10:43:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:39,526 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-30 10:43:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:43:39,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:39,533 INFO L225 Difference]: With dead ends: 1145 [2018-09-30 10:43:39,533 INFO L226 Difference]: Without dead ends: 812 [2018-09-30 10:43:39,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-30 10:43:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-30 10:43:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-30 10:43:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-30 10:43:39,623 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-30 10:43:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:39,623 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-30 10:43:39,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-30 10:43:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:39,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:39,625 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:39,626 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:39,626 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:39,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-30 10:43:39,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:39,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:39,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:39,784 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:43:39,784 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:39,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:39,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:39,786 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:39,786 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-30 10:43:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:47,835 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-30 10:43:47,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:43:47,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:47,842 INFO L225 Difference]: With dead ends: 877 [2018-09-30 10:43:47,843 INFO L226 Difference]: Without dead ends: 871 [2018-09-30 10:43:47,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-30 10:43:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-30 10:43:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-30 10:43:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-30 10:43:47,946 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-30 10:43:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-30 10:43:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-30 10:43:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:47,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:47,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:47,948 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:47,948 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-30 10:43:47,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:47,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:47,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:47,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:48,051 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:43:48,052 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:48,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:48,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:48,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:48,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:48,053 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-30 10:43:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:57,003 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-30 10:43:57,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:57,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:57,009 INFO L225 Difference]: With dead ends: 1049 [2018-09-30 10:43:57,009 INFO L226 Difference]: Without dead ends: 818 [2018-09-30 10:43:57,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-30 10:43:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-30 10:43:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-30 10:43:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-30 10:43:57,166 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-30 10:43:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:57,167 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-30 10:43:57,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-30 10:43:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:57,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:57,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:57,169 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:57,169 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-30 10:43:57,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:57,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:57,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:57,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:57,658 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:43:57,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:57,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:57,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:57,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:57,659 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-30 10:44:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:05,076 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-30 10:44:05,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:44:05,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:44:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:05,082 INFO L225 Difference]: With dead ends: 733 [2018-09-30 10:44:05,082 INFO L226 Difference]: Without dead ends: 727 [2018-09-30 10:44:05,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-30 10:44:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-30 10:44:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-30 10:44:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-30 10:44:05,224 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-30 10:44:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:05,224 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-30 10:44:05,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-30 10:44:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:44:05,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:05,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:05,226 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:05,226 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-30 10:44:05,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:05,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:05,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:05,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:05,399 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:44:05,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:05,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:44:05,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:05,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:05,401 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-30 10:44:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:17,090 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-30 10:44:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:44:17,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:44:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:17,100 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 10:44:17,100 INFO L226 Difference]: Without dead ends: 1323 [2018-09-30 10:44:17,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-30 10:44:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-30 10:44:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-30 10:44:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-30 10:44:17,311 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-30 10:44:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:17,311 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-30 10:44:17,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-30 10:44:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:44:17,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:17,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:17,314 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:17,314 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-30 10:44:17,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:17,424 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:44:17,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:17,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:44:17,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:17,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:17,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:17,426 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-30 10:44:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:25,948 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-30 10:44:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:44:25,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:44:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:25,955 INFO L225 Difference]: With dead ends: 1268 [2018-09-30 10:44:25,955 INFO L226 Difference]: Without dead ends: 1262 [2018-09-30 10:44:25,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-30 10:44:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-30 10:44:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-30 10:44:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-30 10:44:26,127 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-30 10:44:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:26,128 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-30 10:44:26,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-30 10:44:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:44:26,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:26,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:26,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:26,130 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-30 10:44:26,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:26,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:26,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:26,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:26,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:26,207 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:44:26,208 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:26,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:44:26,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:26,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:26,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:26,209 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-30 10:44:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:34,957 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-30 10:44:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:44:34,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:44:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:34,965 INFO L225 Difference]: With dead ends: 1367 [2018-09-30 10:44:34,965 INFO L226 Difference]: Without dead ends: 1361 [2018-09-30 10:44:34,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-30 10:44:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-30 10:44:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-30 10:44:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-30 10:44:35,179 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-30 10:44:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:35,179 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-30 10:44:35,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-30 10:44:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:44:35,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:35,180 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:35,181 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:35,181 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-30 10:44:35,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:35,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:35,266 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:44:35,267 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:35,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:44:35,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:35,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:35,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:35,268 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-30 10:44:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:46,767 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-30 10:44:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:44:46,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:44:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:46,779 INFO L225 Difference]: With dead ends: 1373 [2018-09-30 10:44:46,779 INFO L226 Difference]: Without dead ends: 1367 [2018-09-30 10:44:46,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-30 10:44:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-30 10:44:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-30 10:44:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-30 10:44:47,130 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-30 10:44:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:47,130 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-30 10:44:47,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-30 10:44:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:44:47,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:47,132 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:47,132 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:47,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-30 10:44:47,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:47,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:47,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:47,414 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:44:47,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:47,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:44:47,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:47,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:47,416 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-30 10:44:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:55,755 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-30 10:44:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:44:55,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:44:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:55,765 INFO L225 Difference]: With dead ends: 1526 [2018-09-30 10:44:55,766 INFO L226 Difference]: Without dead ends: 1520 [2018-09-30 10:44:55,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-30 10:44:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-30 10:44:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 10:44:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-30 10:44:56,039 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-30 10:44:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:56,039 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-30 10:44:56,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:44:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-30 10:44:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:44:56,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:56,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:56,041 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:56,042 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-30 10:44:56,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:56,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:56,115 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:44:56,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:56,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:44:56,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:44:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:44:56,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:56,116 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-30 10:45:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:04,579 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-30 10:45:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:45:04,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:04,587 INFO L225 Difference]: With dead ends: 1548 [2018-09-30 10:45:04,587 INFO L226 Difference]: Without dead ends: 1542 [2018-09-30 10:45:04,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-30 10:45:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-30 10:45:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 10:45:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-30 10:45:04,868 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-30 10:45:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:04,868 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-30 10:45:04,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-30 10:45:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:04,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:04,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:04,870 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:04,870 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-30 10:45:04,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:04,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:05,078 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:05,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:05,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:05,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:05,079 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-30 10:45:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:13,825 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-30 10:45:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:45:13,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:13,833 INFO L225 Difference]: With dead ends: 1575 [2018-09-30 10:45:13,833 INFO L226 Difference]: Without dead ends: 1569 [2018-09-30 10:45:13,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-30 10:45:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-30 10:45:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-30 10:45:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-30 10:45:14,153 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-30 10:45:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:14,153 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-30 10:45:14,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-30 10:45:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:14,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:14,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:14,155 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:14,155 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-30 10:45:14,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:14,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:14,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:14,230 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:45:14,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:14,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:14,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:14,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:14,231 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-30 10:45:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:21,212 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-30 10:45:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:45:21,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:21,222 INFO L225 Difference]: With dead ends: 1597 [2018-09-30 10:45:21,223 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 10:45:21,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 10:45:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-30 10:45:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-30 10:45:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-30 10:45:21,554 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-30 10:45:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:21,555 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-30 10:45:21,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-30 10:45:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:21,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:21,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:21,558 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:21,558 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:21,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-30 10:45:21,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:21,726 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:21,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:21,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:21,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:21,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:21,728 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-30 10:45:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:27,917 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-30 10:45:27,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:45:27,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:27,927 INFO L225 Difference]: With dead ends: 1726 [2018-09-30 10:45:27,927 INFO L226 Difference]: Without dead ends: 1720 [2018-09-30 10:45:27,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-30 10:45:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-30 10:45:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-30 10:45:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-30 10:45:28,381 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-30 10:45:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:28,381 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-30 10:45:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-30 10:45:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:28,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:28,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:28,383 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:28,383 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-30 10:45:28,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:28,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:28,464 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:45:28,464 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:28,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:28,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:28,465 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:28,465 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-30 10:45:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:37,458 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-30 10:45:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:45:37,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:37,465 INFO L225 Difference]: With dead ends: 1758 [2018-09-30 10:45:37,465 INFO L226 Difference]: Without dead ends: 1752 [2018-09-30 10:45:37,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-30 10:45:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-30 10:45:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-30 10:45:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-30 10:45:37,940 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-30 10:45:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:37,941 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-30 10:45:37,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-30 10:45:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:37,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:37,942 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:37,942 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:37,943 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-30 10:45:37,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:37,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:38,034 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:45:38,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:38,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:38,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:38,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:38,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:38,036 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-30 10:45:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:46,759 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-30 10:45:46,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:45:46,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:46,766 INFO L225 Difference]: With dead ends: 1867 [2018-09-30 10:45:46,766 INFO L226 Difference]: Without dead ends: 1861 [2018-09-30 10:45:46,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-30 10:45:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-30 10:45:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-30 10:45:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-30 10:45:47,335 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-30 10:45:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:47,335 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-30 10:45:47,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-30 10:45:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:47,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:47,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:47,336 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:47,337 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-30 10:45:47,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:47,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:47,454 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:45:47,454 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:47,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:47,455 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:47,456 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-30 10:45:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:57,397 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-30 10:45:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:45:57,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:45:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:57,406 INFO L225 Difference]: With dead ends: 1968 [2018-09-30 10:45:57,407 INFO L226 Difference]: Without dead ends: 1962 [2018-09-30 10:45:57,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-30 10:45:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-30 10:45:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-30 10:45:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-30 10:45:58,088 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-30 10:45:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:58,088 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-30 10:45:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:45:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-30 10:45:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:45:58,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:58,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:58,090 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:58,090 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-30 10:45:58,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:58,160 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:45:58,161 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:58,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:45:58,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:45:58,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:45:58,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:58,162 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-30 10:46:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:06,164 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-30 10:46:06,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:46:06,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:46:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:06,171 INFO L225 Difference]: With dead ends: 2001 [2018-09-30 10:46:06,172 INFO L226 Difference]: Without dead ends: 1995 [2018-09-30 10:46:06,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-30 10:46:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-30 10:46:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-30 10:46:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-30 10:46:06,839 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-30 10:46:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:06,839 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-30 10:46:06,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:46:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-30 10:46:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:46:06,840 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:06,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:06,841 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:06,841 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-30 10:46:06,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:06,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:06,947 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:46:06,947 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:06,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:46:06,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:46:06,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:46:06,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:06,948 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-30 10:46:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:13,718 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-30 10:46:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:46:13,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:46:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:13,723 INFO L225 Difference]: With dead ends: 1708 [2018-09-30 10:46:13,723 INFO L226 Difference]: Without dead ends: 1702 [2018-09-30 10:46:13,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-30 10:46:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-30 10:46:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-30 10:46:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-30 10:46:14,449 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-30 10:46:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:14,449 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-30 10:46:14,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:46:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-30 10:46:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:46:14,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:14,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:14,451 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:14,451 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-30 10:46:14,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:14,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:14,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:14,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:46:14,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:14,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:46:14,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:46:14,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:46:14,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:14,520 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-30 10:46:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:24,115 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-30 10:46:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:46:24,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:46:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:24,122 INFO L225 Difference]: With dead ends: 2402 [2018-09-30 10:46:24,122 INFO L226 Difference]: Without dead ends: 2396 [2018-09-30 10:46:24,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-30 10:46:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-30 10:46:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-30 10:46:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-30 10:46:25,002 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-30 10:46:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:25,002 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-30 10:46:25,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:46:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-30 10:46:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:46:25,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:25,007 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:25,007 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:25,007 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-30 10:46:25,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:25,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:25,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:25,115 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:46:25,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:25,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:46:25,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:46:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:46:25,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:25,117 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-30 10:46:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:33,659 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-30 10:46:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:46:33,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:46:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:33,664 INFO L225 Difference]: With dead ends: 2274 [2018-09-30 10:46:33,664 INFO L226 Difference]: Without dead ends: 2268 [2018-09-30 10:46:33,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-30 10:46:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-30 10:46:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-30 10:46:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-30 10:46:34,519 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-30 10:46:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:34,519 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-30 10:46:34,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:46:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-30 10:46:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:46:34,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:34,521 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 10:46:34,521 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:34,521 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-30 10:46:34,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:34,557 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:46:34,557 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:34,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:46:34,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:46:34,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:46:34,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:34,558 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-30 10:46:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:35,872 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-30 10:46:35,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:46:35,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 10:46:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:35,875 INFO L225 Difference]: With dead ends: 2170 [2018-09-30 10:46:35,875 INFO L226 Difference]: Without dead ends: 1253 [2018-09-30 10:46:35,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-30 10:46:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-30 10:46:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-30 10:46:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-30 10:46:36,582 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-30 10:46:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:36,582 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-30 10:46:36,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:46:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-30 10:46:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:46:36,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:36,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:36,584 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:36,584 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-30 10:46:36,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:36,672 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:46:36,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:36,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:46:36,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:36,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:36,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:36,673 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-30 10:46:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:49,380 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-30 10:46:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:46:49,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:46:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:49,384 INFO L225 Difference]: With dead ends: 2095 [2018-09-30 10:46:49,384 INFO L226 Difference]: Without dead ends: 2093 [2018-09-30 10:46:49,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-30 10:46:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-30 10:46:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-30 10:46:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-30 10:46:50,172 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-30 10:46:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:50,173 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-30 10:46:50,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:46:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-30 10:46:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:46:50,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:50,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:50,174 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr26ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:50,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-30 10:46:50,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:50,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:50,941 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:46:50,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:50,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:46:50,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:50,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:50,942 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 10:46:57,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:46:57,521 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:46:57,527 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:46:57,528 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:46:57 BoogieIcfgContainer [2018-09-30 10:46:57,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:46:57,528 INFO L168 Benchmark]: Toolchain (without parser) took 253459.64 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 75.5 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -33.4 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:57,531 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:57,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:57,532 INFO L168 Benchmark]: Boogie Preprocessor took 65.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:57,532 INFO L168 Benchmark]: RCFGBuilder took 1216.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:46:57,533 INFO L168 Benchmark]: TraceAbstraction took 252118.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 75.5 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -75.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:57,537 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1216.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 252118.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 75.5 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -75.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 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 (1161states) and FLOYD_HOARE automaton (currently 15 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (559 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 252.0s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 237.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7929 SDtfs, 13691 SDslu, 14077 SDs, 0 SdLazy, 49000 SolverSat, 5162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1341occurred in iteration=25, 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: 9.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 15463 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 18590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 3/3 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-46-57-550.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-46-57-550.csv Completed graceful shutdown