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_out_Reals.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-c372c2b
[2018-10-02 12:03:26,765 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-10-02 12:03:26,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-02 12:03:26,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-02 12:03:26,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-02 12:03:26,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-02 12:03:26,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-02 12:03:26,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-02 12:03:26,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-02 12:03:26,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-02 12:03:26,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-02 12:03:26,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-02 12:03:26,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-02 12:03:26,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-02 12:03:26,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-02 12:03:26,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-02 12:03:26,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-02 12:03:26,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-02 12:03:26,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-02 12:03:26,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-02 12:03:26,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-02 12:03:26,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-02 12:03:26,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-02 12:03:26,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-02 12:03:26,827 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-02 12:03:26,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-02 12:03:26,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-02 12:03:26,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-02 12:03:26,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-02 12:03:26,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-02 12:03:26,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-02 12:03:26,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-02 12:03:26,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-02 12:03:26,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-02 12:03:26,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-02 12:03:26,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-10-02 12:03:26,839 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-10-02 12:03:26,859 INFO L110 SettingsManager]: Loading preferences was successful
[2018-10-02 12:03:26,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-02 12:03:26,863 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-02 12:03:26,863 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-10-02 12:03:26,864 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-02 12:03:26,864 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-10-02 12:03:26,864 INFO L133 SettingsManager]: * Use SBE=true
[2018-10-02 12:03:26,864 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-02 12:03:26,865 INFO L133 SettingsManager]: * sizeof long=4
[2018-10-02 12:03:26,865 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-10-02 12:03:26,865 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-10-02 12:03:26,865 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-10-02 12:03:26,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-10-02 12:03:26,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-02 12:03:26,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-10-02 12:03:26,868 INFO L133 SettingsManager]: * sizeof long double=12
[2018-10-02 12:03:26,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-10-02 12:03:26,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-10-02 12:03:26,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-02 12:03:26,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-10-02 12:03:26,869 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-10-02 12:03:26,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-10-02 12:03:26,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-02 12:03:26,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-02 12:03:26,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-10-02 12:03:26,870 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-02 12:03:26,870 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-10-02 12:03:26,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-02 12:03:26,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-02 12:03:26,871 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-02 12:03:26,871 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true
[2018-10-02 12:03:26,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-02 12:03:26,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-02 12:03:26,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-02 12:03:26,945 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-10-02 12:03:26,946 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2018-10-02 12:03:26,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl
[2018-10-02 12:03:26,947 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl'
[2018-10-02 12:03:27,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-02 12:03:27,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-10-02 12:03:27,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-02 12:03:27,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-02 12:03:27,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-02 12:03:27,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,085 WARN L165 Inliner]: Program contained no entry procedure!
[2018-10-02 12:03:27,086 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start]
[2018-10-02 12:03:27,086 WARN L175 Inliner]: Fallback enabled. All procedures will be processed.
[2018-10-02 12:03:27,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-02 12:03:27,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-02 12:03:27,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-02 12:03:27,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-10-02 12:03:27,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
[2018-10-02 12:03:27,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-02 12:03:27,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-02 12:03:27,152 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-10-02 12:03:27,152 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-10-02 12:03:27,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-02 12:03:27,225 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration
[2018-10-02 12:03:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure product
[2018-10-02 12:03:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure product
[2018-10-02 12:03:28,228 INFO L337 CfgBuilder]: Using library mode
[2018-10-02 12:03:28,229 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:28 BoogieIcfgContainer
[2018-10-02 12:03:28,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-02 12:03:28,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-02 12:03:28,230 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-10-02 12:03:28,233 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-10-02 12:03:28,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:27" (1/2) ...
[2018-10-02 12:03:28,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371e3ef and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:28, skipping insertion in model container
[2018-10-02 12:03:28,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:28" (2/2) ...
[2018-10-02 12:03:28,237 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl
[2018-10-02 12:03:28,245 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-02 12:03:28,254 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations.
[2018-10-02 12:03:28,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation
[2018-10-02 12:03:28,311 INFO L381 AbstractCegarLoop]: Interprodecural is true
[2018-10-02 12:03:28,312 INFO L382 AbstractCegarLoop]: Hoare is true
[2018-10-02 12:03:28,312 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-02 12:03:28,312 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-02 12:03:28,312 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-02 12:03:28,312 INFO L386 AbstractCegarLoop]: Difference is false
[2018-10-02 12:03:28,312 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-02 12:03:28,313 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-02 12:03:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states.
[2018-10-02 12:03:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-10-02 12:03:28,337 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:28,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:28,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:28,347 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times
[2018-10-02 12:03:28,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:28,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:28,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:28,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:28,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:28,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-02 12:03:28,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-10-02 12:03:28,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-10-02 12:03:28,760 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:28,762 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states.
[2018-10-02 12:03:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:03:32,247 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions.
[2018-10-02 12:03:32,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-10-02 12:03:32,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7
[2018-10-02 12:03:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:03:32,268 INFO L225 Difference]: With dead ends: 163
[2018-10-02 12:03:32,269 INFO L226 Difference]: Without dead ends: 158
[2018-10-02 12:03:32,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:03:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-10-02 12:03:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93.
[2018-10-02 12:03:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-10-02 12:03:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions.
[2018-10-02 12:03:32,329 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7
[2018-10-02 12:03:32,330 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:03:32,330 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions.
[2018-10-02 12:03:32,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-10-02 12:03:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions.
[2018-10-02 12:03:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-10-02 12:03:32,331 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:32,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:32,333 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:32,333 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times
[2018-10-02 12:03:32,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:32,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:32,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:32,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-02 12:03:32,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-10-02 12:03:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-10-02 12:03:32,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:32,437 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states.
[2018-10-02 12:03:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:03:34,545 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions.
[2018-10-02 12:03:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-10-02 12:03:34,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7
[2018-10-02 12:03:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:03:34,550 INFO L225 Difference]: With dead ends: 188
[2018-10-02 12:03:34,551 INFO L226 Difference]: Without dead ends: 183
[2018-10-02 12:03:34,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime
[2018-10-02 12:03:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2018-10-02 12:03:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118.
[2018-10-02 12:03:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2018-10-02 12:03:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions.
[2018-10-02 12:03:34,575 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7
[2018-10-02 12:03:34,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:03:34,576 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions.
[2018-10-02 12:03:34,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-10-02 12:03:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions.
[2018-10-02 12:03:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-10-02 12:03:34,577 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:34,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:34,578 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:34,579 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times
[2018-10-02 12:03:34,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:34,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:34,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:34,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-02 12:03:34,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-02 12:03:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-02 12:03:34,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:34,693 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states.
[2018-10-02 12:03:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:03:38,098 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions.
[2018-10-02 12:03:38,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-10-02 12:03:38,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9
[2018-10-02 12:03:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:03:38,103 INFO L225 Difference]: With dead ends: 283
[2018-10-02 12:03:38,103 INFO L226 Difference]: Without dead ends: 278
[2018-10-02 12:03:38,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime
[2018-10-02 12:03:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states.
[2018-10-02 12:03:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147.
[2018-10-02 12:03:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-10-02 12:03:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions.
[2018-10-02 12:03:38,133 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9
[2018-10-02 12:03:38,133 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:03:38,134 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions.
[2018-10-02 12:03:38,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-02 12:03:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions.
[2018-10-02 12:03:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-10-02 12:03:38,135 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:38,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:38,136 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:38,136 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times
[2018-10-02 12:03:38,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:38,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:38,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:38,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:38,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-02 12:03:38,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-02 12:03:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-02 12:03:38,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:38,236 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states.
[2018-10-02 12:03:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:03:42,519 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions.
[2018-10-02 12:03:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-10-02 12:03:42,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9
[2018-10-02 12:03:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:03:42,523 INFO L225 Difference]: With dead ends: 387
[2018-10-02 12:03:42,524 INFO L226 Difference]: Without dead ends: 375
[2018-10-02 12:03:42,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime
[2018-10-02 12:03:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states.
[2018-10-02 12:03:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203.
[2018-10-02 12:03:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states.
[2018-10-02 12:03:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions.
[2018-10-02 12:03:42,566 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9
[2018-10-02 12:03:42,566 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:03:42,566 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions.
[2018-10-02 12:03:42,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-02 12:03:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions.
[2018-10-02 12:03:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:03:42,568 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:42,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:42,569 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:42,569 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times
[2018-10-02 12:03:42,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:42,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:42,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:03:42,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:03:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:03:42,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:42,693 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states.
[2018-10-02 12:03:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:03:49,269 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions.
[2018-10-02 12:03:49,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-10-02 12:03:49,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:03:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:03:49,276 INFO L225 Difference]: With dead ends: 725
[2018-10-02 12:03:49,276 INFO L226 Difference]: Without dead ends: 717
[2018-10-02 12:03:49,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:03:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states.
[2018-10-02 12:03:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354.
[2018-10-02 12:03:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states.
[2018-10-02 12:03:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions.
[2018-10-02 12:03:49,344 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12
[2018-10-02 12:03:49,344 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:03:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions.
[2018-10-02 12:03:49,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:03:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions.
[2018-10-02 12:03:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:03:49,346 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:49,347 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:49,347 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:49,347 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times
[2018-10-02 12:03:49,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:49,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:49,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:49,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:03:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:03:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:03:49,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:49,501 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states.
[2018-10-02 12:03:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:03:59,646 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions.
[2018-10-02 12:03:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-02 12:03:59,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:03:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:03:59,654 INFO L225 Difference]: With dead ends: 1008
[2018-10-02 12:03:59,654 INFO L226 Difference]: Without dead ends: 1000
[2018-10-02 12:03:59,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime
[2018-10-02 12:03:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states.
[2018-10-02 12:03:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364.
[2018-10-02 12:03:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states.
[2018-10-02 12:03:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions.
[2018-10-02 12:03:59,734 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12
[2018-10-02 12:03:59,735 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:03:59,735 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions.
[2018-10-02 12:03:59,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:03:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions.
[2018-10-02 12:03:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:03:59,736 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:03:59,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:03:59,737 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:03:59,737 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:03:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times
[2018-10-02 12:03:59,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:03:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:03:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:03:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:03:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:03:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:03:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:03:59,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:03:59,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:03:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:03:59,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:03:59,876 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states.
[2018-10-02 12:04:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:08,391 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions.
[2018-10-02 12:04:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-10-02 12:04:08,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:08,398 INFO L225 Difference]: With dead ends: 924
[2018-10-02 12:04:08,398 INFO L226 Difference]: Without dead ends: 916
[2018-10-02 12:04:08,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:04:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states.
[2018-10-02 12:04:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394.
[2018-10-02 12:04:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states.
[2018-10-02 12:04:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions.
[2018-10-02 12:04:08,509 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12
[2018-10-02 12:04:08,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:08,509 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions.
[2018-10-02 12:04:08,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions.
[2018-10-02 12:04:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:08,510 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:08,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:08,511 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:08,511 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times
[2018-10-02 12:04:08,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:08,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:08,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:08,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:08,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:08,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:08,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:08,935 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states.
[2018-10-02 12:04:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:15,325 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions.
[2018-10-02 12:04:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-10-02 12:04:15,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:15,331 INFO L225 Difference]: With dead ends: 791
[2018-10-02 12:04:15,331 INFO L226 Difference]: Without dead ends: 783
[2018-10-02 12:04:15,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime
[2018-10-02 12:04:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states.
[2018-10-02 12:04:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392.
[2018-10-02 12:04:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states.
[2018-10-02 12:04:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions.
[2018-10-02 12:04:15,432 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12
[2018-10-02 12:04:15,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:15,432 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions.
[2018-10-02 12:04:15,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions.
[2018-10-02 12:04:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:15,433 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:15,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:15,434 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:15,434 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times
[2018-10-02 12:04:15,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:15,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:15,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:15,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:15,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:15,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:15,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:15,530 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states.
[2018-10-02 12:04:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:22,613 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions.
[2018-10-02 12:04:22,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-10-02 12:04:22,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:22,621 INFO L225 Difference]: With dead ends: 1040
[2018-10-02 12:04:22,621 INFO L226 Difference]: Without dead ends: 1032
[2018-10-02 12:04:22,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:04:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states.
[2018-10-02 12:04:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397.
[2018-10-02 12:04:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states.
[2018-10-02 12:04:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions.
[2018-10-02 12:04:22,747 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12
[2018-10-02 12:04:22,747 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:22,747 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions.
[2018-10-02 12:04:22,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions.
[2018-10-02 12:04:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:22,748 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:22,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:22,749 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:22,749 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times
[2018-10-02 12:04:22,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:22,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:22,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:22,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:22,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:22,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:22,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:22,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:22,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:22,842 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states.
[2018-10-02 12:04:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:31,003 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions.
[2018-10-02 12:04:31,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-10-02 12:04:31,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:31,010 INFO L225 Difference]: With dead ends: 1166
[2018-10-02 12:04:31,010 INFO L226 Difference]: Without dead ends: 1158
[2018-10-02 12:04:31,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:04:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states.
[2018-10-02 12:04:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427.
[2018-10-02 12:04:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states.
[2018-10-02 12:04:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions.
[2018-10-02 12:04:31,167 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12
[2018-10-02 12:04:31,167 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:31,167 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions.
[2018-10-02 12:04:31,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions.
[2018-10-02 12:04:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:31,168 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:31,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:31,169 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:31,169 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times
[2018-10-02 12:04:31,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:31,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:31,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:31,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:31,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:31,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:31,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:31,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:31,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:31,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:31,267 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states.
[2018-10-02 12:04:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:39,017 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions.
[2018-10-02 12:04:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-10-02 12:04:39,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:39,023 INFO L225 Difference]: With dead ends: 1127
[2018-10-02 12:04:39,024 INFO L226 Difference]: Without dead ends: 1119
[2018-10-02 12:04:39,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:04:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states.
[2018-10-02 12:04:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387.
[2018-10-02 12:04:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states.
[2018-10-02 12:04:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions.
[2018-10-02 12:04:39,217 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12
[2018-10-02 12:04:39,217 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:39,217 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions.
[2018-10-02 12:04:39,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions.
[2018-10-02 12:04:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:39,218 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:39,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:39,219 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:39,219 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times
[2018-10-02 12:04:39,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:39,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:39,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:39,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:39,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:39,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:39,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:39,372 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states.
[2018-10-02 12:04:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:46,434 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions.
[2018-10-02 12:04:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-10-02 12:04:46,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:46,444 INFO L225 Difference]: With dead ends: 975
[2018-10-02 12:04:46,444 INFO L226 Difference]: Without dead ends: 967
[2018-10-02 12:04:46,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:04:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states.
[2018-10-02 12:04:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411.
[2018-10-02 12:04:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states.
[2018-10-02 12:04:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions.
[2018-10-02 12:04:46,607 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12
[2018-10-02 12:04:46,608 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:46,608 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions.
[2018-10-02 12:04:46,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions.
[2018-10-02 12:04:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:46,609 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:46,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:46,610 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:46,610 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times
[2018-10-02 12:04:46,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:46,701 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:46,702 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states.
[2018-10-02 12:04:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:04:54,393 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions.
[2018-10-02 12:04:54,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-10-02 12:04:54,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:04:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:04:54,398 INFO L225 Difference]: With dead ends: 1011
[2018-10-02 12:04:54,398 INFO L226 Difference]: Without dead ends: 1003
[2018-10-02 12:04:54,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:04:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states.
[2018-10-02 12:04:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391.
[2018-10-02 12:04:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states.
[2018-10-02 12:04:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions.
[2018-10-02 12:04:54,565 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12
[2018-10-02 12:04:54,565 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:04:54,565 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions.
[2018-10-02 12:04:54,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:04:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions.
[2018-10-02 12:04:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:04:54,566 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:04:54,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:04:54,567 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:04:54,567 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:04:54,567 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times
[2018-10-02 12:04:54,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:04:54,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:04:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:54,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:04:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:04:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:04:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:04:54,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:04:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:04:54,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-02 12:04:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-02 12:04:54,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:04:54,665 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states.
[2018-10-02 12:05:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:00,633 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions.
[2018-10-02 12:05:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-10-02 12:05:00,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-02 12:05:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:00,638 INFO L225 Difference]: With dead ends: 859
[2018-10-02 12:05:00,638 INFO L226 Difference]: Without dead ends: 851
[2018-10-02 12:05:00,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime
[2018-10-02 12:05:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states.
[2018-10-02 12:05:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381.
[2018-10-02 12:05:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states.
[2018-10-02 12:05:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions.
[2018-10-02 12:05:00,811 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12
[2018-10-02 12:05:00,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:00,811 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions.
[2018-10-02 12:05:00,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-02 12:05:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions.
[2018-10-02 12:05:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:00,811 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:00,812 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:00,812 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:00,812 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times
[2018-10-02 12:05:00,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:01,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:01,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:01,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:01,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:01,096 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states.
[2018-10-02 12:05:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:07,266 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions.
[2018-10-02 12:05:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-02 12:05:07,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:07,271 INFO L225 Difference]: With dead ends: 962
[2018-10-02 12:05:07,271 INFO L226 Difference]: Without dead ends: 954
[2018-10-02 12:05:07,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime
[2018-10-02 12:05:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states.
[2018-10-02 12:05:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504.
[2018-10-02 12:05:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states.
[2018-10-02 12:05:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions.
[2018-10-02 12:05:07,515 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12
[2018-10-02 12:05:07,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:07,515 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions.
[2018-10-02 12:05:07,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions.
[2018-10-02 12:05:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:07,516 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:07,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:07,517 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:07,517 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times
[2018-10-02 12:05:07,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:07,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:07,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:07,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:07,599 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:07,599 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states.
[2018-10-02 12:05:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:14,797 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions.
[2018-10-02 12:05:14,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-10-02 12:05:14,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:14,803 INFO L225 Difference]: With dead ends: 1064
[2018-10-02 12:05:14,803 INFO L226 Difference]: Without dead ends: 1056
[2018-10-02 12:05:14,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:05:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states.
[2018-10-02 12:05:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522.
[2018-10-02 12:05:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states.
[2018-10-02 12:05:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions.
[2018-10-02 12:05:15,063 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12
[2018-10-02 12:05:15,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:15,063 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions.
[2018-10-02 12:05:15,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions.
[2018-10-02 12:05:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:15,064 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:15,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:15,064 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:15,064 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times
[2018-10-02 12:05:15,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:15,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:15,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:15,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:15,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:15,156 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states.
[2018-10-02 12:05:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:23,759 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions.
[2018-10-02 12:05:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-10-02 12:05:23,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:23,764 INFO L225 Difference]: With dead ends: 1241
[2018-10-02 12:05:23,764 INFO L226 Difference]: Without dead ends: 1233
[2018-10-02 12:05:23,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:05:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states.
[2018-10-02 12:05:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570.
[2018-10-02 12:05:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states.
[2018-10-02 12:05:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions.
[2018-10-02 12:05:24,088 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12
[2018-10-02 12:05:24,088 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:24,088 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions.
[2018-10-02 12:05:24,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions.
[2018-10-02 12:05:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:24,089 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:24,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:24,090 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:24,090 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times
[2018-10-02 12:05:24,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:24,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:24,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:24,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:24,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:24,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:24,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:24,184 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states.
[2018-10-02 12:05:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:30,262 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions.
[2018-10-02 12:05:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-10-02 12:05:30,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:30,268 INFO L225 Difference]: With dead ends: 1139
[2018-10-02 12:05:30,268 INFO L226 Difference]: Without dead ends: 1131
[2018-10-02 12:05:30,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime
[2018-10-02 12:05:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states.
[2018-10-02 12:05:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588.
[2018-10-02 12:05:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states.
[2018-10-02 12:05:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions.
[2018-10-02 12:05:30,566 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12
[2018-10-02 12:05:30,566 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:30,566 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions.
[2018-10-02 12:05:30,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions.
[2018-10-02 12:05:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:30,567 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:30,567 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:30,567 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:30,568 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times
[2018-10-02 12:05:30,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:30,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:30,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:30,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:30,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:30,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:30,662 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states.
[2018-10-02 12:05:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:38,415 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions.
[2018-10-02 12:05:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-02 12:05:38,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:38,421 INFO L225 Difference]: With dead ends: 1325
[2018-10-02 12:05:38,421 INFO L226 Difference]: Without dead ends: 1317
[2018-10-02 12:05:38,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:05:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states.
[2018-10-02 12:05:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573.
[2018-10-02 12:05:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states.
[2018-10-02 12:05:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions.
[2018-10-02 12:05:38,742 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12
[2018-10-02 12:05:38,742 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:38,742 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions.
[2018-10-02 12:05:38,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions.
[2018-10-02 12:05:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:38,743 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:38,743 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:38,744 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:38,744 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:38,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times
[2018-10-02 12:05:38,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:38,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:38,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:38,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:38,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:39,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:39,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:39,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:39,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:39,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:39,015 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states.
[2018-10-02 12:05:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:47,343 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions.
[2018-10-02 12:05:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-02 12:05:47,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:47,348 INFO L225 Difference]: With dead ends: 1334
[2018-10-02 12:05:47,348 INFO L226 Difference]: Without dead ends: 1326
[2018-10-02 12:05:47,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:05:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states.
[2018-10-02 12:05:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579.
[2018-10-02 12:05:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states.
[2018-10-02 12:05:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions.
[2018-10-02 12:05:47,717 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12
[2018-10-02 12:05:47,717 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:47,717 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions.
[2018-10-02 12:05:47,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions.
[2018-10-02 12:05:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:47,718 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:47,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:47,719 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:47,719 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times
[2018-10-02 12:05:47,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:47,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:47,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:47,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:47,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:47,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:47,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:47,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:47,803 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states.
[2018-10-02 12:05:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:52,613 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions.
[2018-10-02 12:05:52,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-10-02 12:05:52,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:52,618 INFO L225 Difference]: With dead ends: 919
[2018-10-02 12:05:52,618 INFO L226 Difference]: Without dead ends: 911
[2018-10-02 12:05:52,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime
[2018-10-02 12:05:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states.
[2018-10-02 12:05:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570.
[2018-10-02 12:05:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states.
[2018-10-02 12:05:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions.
[2018-10-02 12:05:52,979 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12
[2018-10-02 12:05:52,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:52,979 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions.
[2018-10-02 12:05:52,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions.
[2018-10-02 12:05:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:52,980 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:52,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:52,980 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:52,981 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times
[2018-10-02 12:05:52,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:05:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:52,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:05:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:05:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:05:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:05:53,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:05:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:05:53,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:05:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:05:53,070 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:05:53,070 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states.
[2018-10-02 12:05:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:05:59,639 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions.
[2018-10-02 12:05:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-02 12:05:59,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:05:59,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:05:59,646 INFO L225 Difference]: With dead ends: 1095
[2018-10-02 12:05:59,646 INFO L226 Difference]: Without dead ends: 1087
[2018-10-02 12:05:59,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime
[2018-10-02 12:05:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states.
[2018-10-02 12:05:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555.
[2018-10-02 12:05:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states.
[2018-10-02 12:05:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions.
[2018-10-02 12:05:59,997 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12
[2018-10-02 12:05:59,997 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:05:59,997 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions.
[2018-10-02 12:05:59,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:05:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions.
[2018-10-02 12:05:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:05:59,998 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:05:59,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:05:59,999 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:05:59,999 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:05:59,999 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times
[2018-10-02 12:05:59,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:05:59,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:00,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:00,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:00,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:00,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:00,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:06:00,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:06:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:06:00,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:00,077 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states.
[2018-10-02 12:06:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:08,802 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions.
[2018-10-02 12:06:08,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-10-02 12:06:08,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:06:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:08,805 INFO L225 Difference]: With dead ends: 1304
[2018-10-02 12:06:08,805 INFO L226 Difference]: Without dead ends: 1296
[2018-10-02 12:06:08,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:06:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states.
[2018-10-02 12:06:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552.
[2018-10-02 12:06:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states.
[2018-10-02 12:06:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions.
[2018-10-02 12:06:09,158 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12
[2018-10-02 12:06:09,158 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:09,158 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions.
[2018-10-02 12:06:09,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:06:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions.
[2018-10-02 12:06:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-02 12:06:09,159 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:09,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:09,160 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:09,160 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times
[2018-10-02 12:06:09,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:09,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:09,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:09,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:09,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:09,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:06:09,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:06:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:06:09,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:09,236 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states.
[2018-10-02 12:06:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:17,093 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions.
[2018-10-02 12:06:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-10-02 12:06:17,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-02 12:06:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:17,095 INFO L225 Difference]: With dead ends: 1192
[2018-10-02 12:06:17,095 INFO L226 Difference]: Without dead ends: 1184
[2018-10-02 12:06:17,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.2s impTime
[2018-10-02 12:06:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states.
[2018-10-02 12:06:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602.
[2018-10-02 12:06:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2018-10-02 12:06:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions.
[2018-10-02 12:06:17,535 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12
[2018-10-02 12:06:17,535 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:17,535 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions.
[2018-10-02 12:06:17,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:06:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions.
[2018-10-02 12:06:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-10-02 12:06:17,536 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:17,536 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:17,537 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:17,537 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times
[2018-10-02 12:06:17,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:17,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:17,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-02 12:06:17,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-10-02 12:06:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-10-02 12:06:17,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:17,580 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states.
[2018-10-02 12:06:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:18,732 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions.
[2018-10-02 12:06:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-10-02 12:06:18,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-10-02 12:06:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:18,733 INFO L225 Difference]: With dead ends: 1139
[2018-10-02 12:06:18,734 INFO L226 Difference]: Without dead ends: 625
[2018-10-02 12:06:18,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime
[2018-10-02 12:06:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states.
[2018-10-02 12:06:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602.
[2018-10-02 12:06:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2018-10-02 12:06:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions.
[2018-10-02 12:06:19,240 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13
[2018-10-02 12:06:19,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:19,240 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions.
[2018-10-02 12:06:19,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-10-02 12:06:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions.
[2018-10-02 12:06:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-10-02 12:06:19,241 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:19,241 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:19,241 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:19,241 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times
[2018-10-02 12:06:19,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:19,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:19,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:19,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:19,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-02 12:06:19,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-02 12:06:19,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:19,361 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-02 12:06:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:20,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-02 12:06:20,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14
[2018-10-02 12:06:20,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-10-02 12:06:20,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-10-02 12:06:20,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:20,244 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states.
[2018-10-02 12:06:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:29,180 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions.
[2018-10-02 12:06:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-02 12:06:29,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13
[2018-10-02 12:06:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:29,181 INFO L225 Difference]: With dead ends: 794
[2018-10-02 12:06:29,182 INFO L226 Difference]: Without dead ends: 789
[2018-10-02 12:06:29,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime
[2018-10-02 12:06:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states.
[2018-10-02 12:06:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664.
[2018-10-02 12:06:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states.
[2018-10-02 12:06:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions.
[2018-10-02 12:06:29,840 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13
[2018-10-02 12:06:29,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:29,840 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions.
[2018-10-02 12:06:29,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-10-02 12:06:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions.
[2018-10-02 12:06:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-10-02 12:06:29,841 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:29,841 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:29,841 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:29,841 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times
[2018-10-02 12:06:29,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:29,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:29,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:29,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:29,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-02 12:06:29,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-10-02 12:06:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-10-02 12:06:29,903 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:29,903 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states.
[2018-10-02 12:06:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:31,563 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions.
[2018-10-02 12:06:31,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-10-02 12:06:31,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-10-02 12:06:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:31,565 INFO L225 Difference]: With dead ends: 1317
[2018-10-02 12:06:31,565 INFO L226 Difference]: Without dead ends: 729
[2018-10-02 12:06:31,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime
[2018-10-02 12:06:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states.
[2018-10-02 12:06:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690.
[2018-10-02 12:06:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states.
[2018-10-02 12:06:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions.
[2018-10-02 12:06:32,186 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13
[2018-10-02 12:06:32,186 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:32,186 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions.
[2018-10-02 12:06:32,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-10-02 12:06:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions.
[2018-10-02 12:06:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:06:32,187 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:32,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:32,188 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:32,188 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times
[2018-10-02 12:06:32,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:32,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:32,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:32,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:06:32,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:06:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:06:32,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:32,270 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states.
[2018-10-02 12:06:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:39,381 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions.
[2018-10-02 12:06:39,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-10-02 12:06:39,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:06:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:39,385 INFO L225 Difference]: With dead ends: 1435
[2018-10-02 12:06:39,385 INFO L226 Difference]: Without dead ends: 1427
[2018-10-02 12:06:39,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime
[2018-10-02 12:06:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states.
[2018-10-02 12:06:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789.
[2018-10-02 12:06:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states.
[2018-10-02 12:06:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions.
[2018-10-02 12:06:40,241 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16
[2018-10-02 12:06:40,241 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:40,241 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions.
[2018-10-02 12:06:40,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:06:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions.
[2018-10-02 12:06:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:06:40,242 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:40,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:40,242 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:40,243 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times
[2018-10-02 12:06:40,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:40,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:40,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:40,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:40,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:40,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:06:40,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:06:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:06:40,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:40,432 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states.
[2018-10-02 12:06:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:48,423 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions.
[2018-10-02 12:06:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-02 12:06:48,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:06:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:48,426 INFO L225 Difference]: With dead ends: 1599
[2018-10-02 12:06:48,427 INFO L226 Difference]: Without dead ends: 1591
[2018-10-02 12:06:48,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:06:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states.
[2018-10-02 12:06:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821.
[2018-10-02 12:06:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states.
[2018-10-02 12:06:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions.
[2018-10-02 12:06:49,253 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16
[2018-10-02 12:06:49,253 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:49,253 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions.
[2018-10-02 12:06:49,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:06:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions.
[2018-10-02 12:06:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:06:49,254 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:49,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:49,254 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:49,254 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times
[2018-10-02 12:06:49,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:49,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:49,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:49,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:06:49,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:06:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:06:49,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:49,361 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states.
[2018-10-02 12:06:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:06:56,074 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions.
[2018-10-02 12:06:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-10-02 12:06:56,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:06:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:06:56,079 INFO L225 Difference]: With dead ends: 1411
[2018-10-02 12:06:56,080 INFO L226 Difference]: Without dead ends: 1403
[2018-10-02 12:06:56,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime
[2018-10-02 12:06:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states.
[2018-10-02 12:06:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823.
[2018-10-02 12:06:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states.
[2018-10-02 12:06:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions.
[2018-10-02 12:06:56,904 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16
[2018-10-02 12:06:56,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:06:56,904 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions.
[2018-10-02 12:06:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:06:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions.
[2018-10-02 12:06:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:06:56,905 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:06:56,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:06:56,905 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:06:56,905 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:06:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times
[2018-10-02 12:06:56,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:06:56,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:06:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:56,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:06:56,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:06:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:06:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:06:57,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:06:57,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:06:57,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:06:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:06:57,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:06:57,041 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states.
[2018-10-02 12:07:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:07:04,479 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions.
[2018-10-02 12:07:04,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-02 12:07:04,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:07:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:07:04,482 INFO L225 Difference]: With dead ends: 1490
[2018-10-02 12:07:04,482 INFO L226 Difference]: Without dead ends: 1482
[2018-10-02 12:07:04,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:07:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states.
[2018-10-02 12:07:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943.
[2018-10-02 12:07:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states.
[2018-10-02 12:07:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions.
[2018-10-02 12:07:05,476 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16
[2018-10-02 12:07:05,476 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:07:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions.
[2018-10-02 12:07:05,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:07:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions.
[2018-10-02 12:07:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:07:05,477 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:07:05,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:07:05,477 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:07:05,478 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:07:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times
[2018-10-02 12:07:05,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:07:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:07:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:07:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:07:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:07:05,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:07:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:07:05,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:07:05,702 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states.
[2018-10-02 12:07:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:07:12,935 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions.
[2018-10-02 12:07:12,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-02 12:07:12,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:07:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:07:12,938 INFO L225 Difference]: With dead ends: 1427
[2018-10-02 12:07:12,938 INFO L226 Difference]: Without dead ends: 1419
[2018-10-02 12:07:12,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime
[2018-10-02 12:07:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states.
[2018-10-02 12:07:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927.
[2018-10-02 12:07:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states.
[2018-10-02 12:07:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions.
[2018-10-02 12:07:13,822 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16
[2018-10-02 12:07:13,822 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:07:13,822 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions.
[2018-10-02 12:07:13,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:07:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions.
[2018-10-02 12:07:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:07:13,823 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:07:13,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:07:13,824 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:07:13,824 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:07:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times
[2018-10-02 12:07:13,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:07:13,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:07:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:13,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-02 12:07:13,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-02 12:07:13,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-02 12:07:13,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:07:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:07:13,908 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:07:13,909 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states.
[2018-10-02 12:07:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:07:20,555 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions.
[2018-10-02 12:07:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-10-02 12:07:20,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:07:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:07:20,557 INFO L225 Difference]: With dead ends: 1306
[2018-10-02 12:07:20,558 INFO L226 Difference]: Without dead ends: 1298
[2018-10-02 12:07:20,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime
[2018-10-02 12:07:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states.
[2018-10-02 12:07:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986.
[2018-10-02 12:07:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states.
[2018-10-02 12:07:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions.
[2018-10-02 12:07:21,567 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16
[2018-10-02 12:07:21,567 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:07:21,567 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions.
[2018-10-02 12:07:21,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:07:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions.
[2018-10-02 12:07:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:07:21,568 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:07:21,568 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:07:21,569 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:07:21,569 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:07:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times
[2018-10-02 12:07:21,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:07:21,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:07:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:21,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-02 12:07:21,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-02 12:07:21,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-02 12:07:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:21,665 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-02 12:07:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-02 12:07:21,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-02 12:07:21,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-02 12:07:21,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:07:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:07:21,718 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:07:21,718 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states.
[2018-10-02 12:07:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:07:27,820 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions.
[2018-10-02 12:07:27,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-10-02 12:07:27,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:07:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:07:27,822 INFO L225 Difference]: With dead ends: 1285
[2018-10-02 12:07:27,822 INFO L226 Difference]: Without dead ends: 1277
[2018-10-02 12:07:27,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:07:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states.
[2018-10-02 12:07:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986.
[2018-10-02 12:07:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states.
[2018-10-02 12:07:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions.
[2018-10-02 12:07:28,882 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16
[2018-10-02 12:07:28,882 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:07:28,882 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions.
[2018-10-02 12:07:28,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:07:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions.
[2018-10-02 12:07:28,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:07:28,883 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:07:28,883 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:07:28,883 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:07:28,883 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:07:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times
[2018-10-02 12:07:28,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:07:28,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:07:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:28,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-02 12:07:28,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-02 12:07:28,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-02 12:07:28,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:28,979 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-02 12:07:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-02 12:07:29,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-02 12:07:29,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-02 12:07:29,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:07:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:07:29,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:07:29,037 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states.
[2018-10-02 12:07:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-02 12:07:36,590 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions.
[2018-10-02 12:07:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-10-02 12:07:36,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-02 12:07:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-02 12:07:36,592 INFO L225 Difference]: With dead ends: 1518
[2018-10-02 12:07:36,592 INFO L226 Difference]: Without dead ends: 1510
[2018-10-02 12:07:36,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime
[2018-10-02 12:07:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states.
[2018-10-02 12:07:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977.
[2018-10-02 12:07:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states.
[2018-10-02 12:07:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions.
[2018-10-02 12:07:37,595 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16
[2018-10-02 12:07:37,595 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-02 12:07:37,595 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions.
[2018-10-02 12:07:37,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-02 12:07:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions.
[2018-10-02 12:07:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-02 12:07:37,595 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-02 12:07:37,595 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-02 12:07:37,596 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]===
[2018-10-02 12:07:37,596 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier
[2018-10-02 12:07:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times
[2018-10-02 12:07:37,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-02 12:07:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-02 12:07:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:37,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-02 12:07:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-02 12:07:37,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-02 12:07:37,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-02 12:07:37,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-02 12:07:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-02 12:07:37,707 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-02 12:07:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-02 12:07:37,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-02 12:07:37,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-02 12:07:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-02 12:07:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-02 12:07:37,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap
[2018-10-02 12:07:37,776 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states.
Received shutdown request...
[2018-10-02 12:07:40,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-10-02 12:07:40,535 WARN L549 AbstractCegarLoop]: Verification canceled
[2018-10-02 12:07:40,540 WARN L205 ceAbstractionStarter]: Timeout
[2018-10-02 12:07:40,541 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:07:40 BoogieIcfgContainer
[2018-10-02 12:07:40,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-02 12:07:40,542 INFO L168 Benchmark]: Toolchain (without parser) took 253514.12 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -98.0 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 243.8 MB). Peak memory consumption was 145.7 MB. Max. memory is 7.1 GB.
[2018-10-02 12:07:40,544 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-02 12:07:40,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-02 12:07:40,546 INFO L168 Benchmark]: Boogie Preprocessor took 61.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-02 12:07:40,546 INFO L168 Benchmark]: RCFGBuilder took 1077.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
[2018-10-02 12:07:40,547 INFO L168 Benchmark]: TraceAbstraction took 252310.82 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -98.0 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 212.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB.
[2018-10-02 12:07:40,552 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 57.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 61.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* RCFGBuilder took 1077.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 252310.82 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -98.0 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 212.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (977states) and FLOYD_HOARE automaton (currently 10 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa).
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 252.2s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 232.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9234 SDtfs, 25302 SDslu, 28291 SDs, 0 SdLazy, 52457 SolverSat, 5225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 747 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=986occurred in iteration=33, 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: 14.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 16303 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 18237 SizeOfPredicates, 17 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 40 InterpolantComputations, 32 PerfectInterpolantSequences, 13/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-07-40-565.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-07-40-565.csv
Completed graceful shutdown