java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 09:55:43,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 09:55:43,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 09:55:43,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 09:55:43,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 09:55:43,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 09:55:43,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 09:55:43,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 09:55:43,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 09:55:43,761 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 09:55:43,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 09:55:43,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 09:55:43,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 09:55:43,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 09:55:43,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 09:55:43,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 09:55:43,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 09:55:43,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 09:55:43,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 09:55:43,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 09:55:43,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 09:55:43,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 09:55:43,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 09:55:43,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 09:55:43,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 09:55:43,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 09:55:43,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 09:55:43,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 09:55:43,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 09:55:43,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 09:55:43,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 09:55:43,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 09:55:43,795 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 09:55:43,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 09:55:43,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 09:55:43,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 09:55:43,798 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-28 09:55:43,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 09:55:43,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 09:55:43,828 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 09:55:43,828 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 09:55:43,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 09:55:43,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 09:55:43,830 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 09:55:43,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 09:55:43,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 09:55:43,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 09:55:43,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 09:55:43,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 09:55:43,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 09:55:43,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 09:55:43,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 09:55:43,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 09:55:43,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 09:55:43,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 09:55:43,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 09:55:43,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 09:55:43,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 09:55:43,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 09:55:43,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 09:55:43,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 09:55:43,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 09:55:43,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 09:55:43,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 09:55:43,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 09:55:43,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 09:55:43,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 09:55:43,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 09:55:43,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 09:55:43,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 09:55:43,904 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 09:55:43,904 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 09:55:43,905 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-09-28 09:55:43,906 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-28 09:55:44,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 09:55:44,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 09:55:44,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 09:55:44,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 09:55:44,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 09:55:44,037 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 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,054 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 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,060 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-28 09:55:44,061 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-28 09:55:44,061 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-28 09:55:44,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 09:55:44,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 09:55:44,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 09:55:44,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 09:55:44,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... [2018-09-28 09:55:44,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 09:55:44,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 09:55:44,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 09:55:44,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 09:55:44,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 09:55:44,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-28 09:55:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-28 09:55:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-28 09:55:44,963 INFO L350 CfgBuilder]: Using library mode [2018-09-28 09:55:44,964 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 09:55:44 BoogieIcfgContainer [2018-09-28 09:55:44,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 09:55:44,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 09:55:44,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 09:55:44,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 09:55:44,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:43" (1/2) ... [2018-09-28 09:55:44,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e76f7f and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 09:55:44, skipping insertion in model container [2018-09-28 09:55:44,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 09:55:44" (2/2) ... [2018-09-28 09:55:44,972 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-28 09:55:44,982 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 09:55:44,991 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-28 09:55:45,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 09:55:45,047 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 09:55:45,047 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 09:55:45,047 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 09:55:45,047 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 09:55:45,047 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 09:55:45,048 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 09:55:45,048 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 09:55:45,048 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 09:55:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-28 09:55:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-28 09:55:45,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:45,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:45,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:45,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-28 09:55:45,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:45,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:45,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:45,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:45,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:45,383 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:45,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:55:45,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-28 09:55:45,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-28 09:55:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-28 09:55:45,409 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-28 09:55:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:47,202 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-28 09:55:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 09:55:47,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-28 09:55:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:47,223 INFO L225 Difference]: With dead ends: 163 [2018-09-28 09:55:47,223 INFO L226 Difference]: Without dead ends: 158 [2018-09-28 09:55:47,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-28 09:55:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-28 09:55:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-28 09:55:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-28 09:55:47,289 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-28 09:55:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:47,290 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-28 09:55:47,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-28 09:55:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-28 09:55:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-28 09:55:47,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:47,292 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:47,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:47,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-28 09:55:47,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:47,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:47,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:47,423 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:47,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:55:47,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-28 09:55:47,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-28 09:55:47,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-28 09:55:47,427 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-28 09:55:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:48,247 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-28 09:55:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 09:55:48,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-28 09:55:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:48,252 INFO L225 Difference]: With dead ends: 188 [2018-09-28 09:55:48,253 INFO L226 Difference]: Without dead ends: 183 [2018-09-28 09:55:48,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-28 09:55:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-28 09:55:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-28 09:55:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-28 09:55:48,278 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-28 09:55:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:48,278 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-28 09:55:48,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-28 09:55:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-28 09:55:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 09:55:48,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:48,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:48,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:48,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-28 09:55:48,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:48,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:48,389 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:48,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-28 09:55:48,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 09:55:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 09:55:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:55:48,390 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-28 09:55:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:49,790 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-28 09:55:49,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 09:55:49,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-28 09:55:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:49,794 INFO L225 Difference]: With dead ends: 283 [2018-09-28 09:55:49,794 INFO L226 Difference]: Without dead ends: 278 [2018-09-28 09:55:49,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-28 09:55:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-28 09:55:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-28 09:55:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-28 09:55:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-28 09:55:49,829 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-28 09:55:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:49,829 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-28 09:55:49,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 09:55:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-28 09:55:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 09:55:49,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:49,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:49,832 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:49,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-28 09:55:49,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:49,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:49,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:50,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:50,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-28 09:55:50,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 09:55:50,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 09:55:50,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:55:50,029 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-28 09:55:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:51,924 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-28 09:55:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 09:55:51,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-28 09:55:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:51,931 INFO L225 Difference]: With dead ends: 387 [2018-09-28 09:55:51,931 INFO L226 Difference]: Without dead ends: 375 [2018-09-28 09:55:51,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-28 09:55:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-28 09:55:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-28 09:55:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-28 09:55:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-28 09:55:51,977 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-28 09:55:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:51,977 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-28 09:55:51,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 09:55:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-28 09:55:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:51,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:51,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:51,980 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:51,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-28 09:55:51,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:51,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:52,380 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:52,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:52,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:55:52,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:55:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:52,382 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-28 09:55:53,115 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-28 09:55:54,187 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:55:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:58,404 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-28 09:55:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 09:55:58,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:55:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:58,411 INFO L225 Difference]: With dead ends: 725 [2018-09-28 09:55:58,411 INFO L226 Difference]: Without dead ends: 717 [2018-09-28 09:55:58,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:55:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-28 09:55:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-28 09:55:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-28 09:55:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-28 09:55:58,480 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-28 09:55:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:58,481 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-28 09:55:58,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:55:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-28 09:55:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:55:58,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:58,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:55:58,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:58,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-28 09:55:58,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:58,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:58,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:55:58,606 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:58,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:55:58,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:55:58,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:55:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:58,607 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-28 09:56:01,201 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-28 09:56:02,097 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-28 09:56:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:04,461 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-28 09:56:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:56:04,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:04,470 INFO L225 Difference]: With dead ends: 1008 [2018-09-28 09:56:04,470 INFO L226 Difference]: Without dead ends: 1000 [2018-09-28 09:56:04,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-28 09:56:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-28 09:56:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-28 09:56:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-28 09:56:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-28 09:56:04,536 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-28 09:56:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:04,537 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-28 09:56:04,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-28 09:56:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:04,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:04,538 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:04,539 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:04,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-28 09:56:04,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:04,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:04,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:04,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:04,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:04,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:04,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:04,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:04,688 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-28 09:56:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:07,281 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-28 09:56:07,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-28 09:56:07,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:07,289 INFO L225 Difference]: With dead ends: 924 [2018-09-28 09:56:07,290 INFO L226 Difference]: Without dead ends: 916 [2018-09-28 09:56:07,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:56:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-28 09:56:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-28 09:56:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-28 09:56:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-28 09:56:07,366 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-28 09:56:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:07,367 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-28 09:56:07,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-28 09:56:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:07,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:07,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:07,369 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:07,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:07,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-28 09:56:07,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:07,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:07,450 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:07,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:07,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:07,452 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-28 09:56:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:09,310 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-28 09:56:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 09:56:09,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:09,316 INFO L225 Difference]: With dead ends: 791 [2018-09-28 09:56:09,316 INFO L226 Difference]: Without dead ends: 783 [2018-09-28 09:56:09,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:56:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-28 09:56:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-28 09:56:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-28 09:56:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-28 09:56:09,414 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-28 09:56:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:09,415 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-28 09:56:09,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-28 09:56:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:09,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:09,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:09,417 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:09,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-28 09:56:09,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:09,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:09,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:09,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:09,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:09,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:09,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:09,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:09,523 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-28 09:56:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:11,869 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-28 09:56:11,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 09:56:11,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:11,876 INFO L225 Difference]: With dead ends: 1040 [2018-09-28 09:56:11,876 INFO L226 Difference]: Without dead ends: 1032 [2018-09-28 09:56:11,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 09:56:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-28 09:56:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-28 09:56:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-28 09:56:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-28 09:56:12,006 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-28 09:56:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:12,007 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-28 09:56:12,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-28 09:56:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:12,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:12,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:12,009 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:12,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-28 09:56:12,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:12,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:12,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:12,149 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:12,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:12,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:12,151 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-28 09:56:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:14,776 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-28 09:56:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-28 09:56:14,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:14,783 INFO L225 Difference]: With dead ends: 1166 [2018-09-28 09:56:14,784 INFO L226 Difference]: Without dead ends: 1158 [2018-09-28 09:56:14,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-28 09:56:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-28 09:56:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-28 09:56:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-28 09:56:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-28 09:56:14,920 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-28 09:56:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:14,920 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-28 09:56:14,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-28 09:56:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:14,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:14,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:14,922 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:14,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-28 09:56:14,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:14,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:14,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:14,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:15,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:15,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:15,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:15,146 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-28 09:56:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:17,797 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-28 09:56:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 09:56:17,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:17,805 INFO L225 Difference]: With dead ends: 1127 [2018-09-28 09:56:17,805 INFO L226 Difference]: Without dead ends: 1119 [2018-09-28 09:56:17,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-28 09:56:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-28 09:56:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-28 09:56:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-28 09:56:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-28 09:56:18,011 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-28 09:56:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:18,012 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-28 09:56:18,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-28 09:56:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:18,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:18,013 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:18,014 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:18,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-28 09:56:18,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:18,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:18,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:18,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:18,236 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:18,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:18,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:18,238 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-28 09:56:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:20,606 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-28 09:56:20,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:56:20,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:20,613 INFO L225 Difference]: With dead ends: 975 [2018-09-28 09:56:20,613 INFO L226 Difference]: Without dead ends: 967 [2018-09-28 09:56:20,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-28 09:56:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-28 09:56:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-28 09:56:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-28 09:56:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-28 09:56:20,789 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-28 09:56:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:20,790 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-28 09:56:20,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-28 09:56:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:20,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:20,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:20,792 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:20,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-28 09:56:20,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:20,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:20,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:20,939 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:20,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:20,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:20,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:20,940 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-28 09:56:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:23,671 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-28 09:56:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:56:23,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:23,676 INFO L225 Difference]: With dead ends: 1011 [2018-09-28 09:56:23,676 INFO L226 Difference]: Without dead ends: 1003 [2018-09-28 09:56:23,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-28 09:56:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-28 09:56:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-28 09:56:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-28 09:56:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-28 09:56:23,875 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-28 09:56:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:23,875 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-28 09:56:23,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-28 09:56:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:23,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:23,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:23,877 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:23,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-28 09:56:23,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:23,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:23,964 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:23,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:23,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:56:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:56:23,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:56:23,966 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-28 09:56:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:26,005 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-28 09:56:26,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 09:56:26,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-28 09:56:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:26,010 INFO L225 Difference]: With dead ends: 859 [2018-09-28 09:56:26,010 INFO L226 Difference]: Without dead ends: 851 [2018-09-28 09:56:26,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:56:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-28 09:56:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-28 09:56:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-28 09:56:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-28 09:56:26,207 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-28 09:56:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:26,207 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-28 09:56:26,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:56:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-28 09:56:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:26,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:26,208 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:26,209 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:26,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-28 09:56:26,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:26,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:26,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:26,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:26,318 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:26,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:26,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:26,319 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-28 09:56:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:28,594 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-28 09:56:28,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:56:28,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:28,598 INFO L225 Difference]: With dead ends: 962 [2018-09-28 09:56:28,598 INFO L226 Difference]: Without dead ends: 954 [2018-09-28 09:56:28,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:56:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-28 09:56:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-28 09:56:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-28 09:56:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-28 09:56:28,862 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-28 09:56:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:28,862 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-28 09:56:28,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-28 09:56:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:28,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:28,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:28,863 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:28,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:28,864 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-28 09:56:28,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:28,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:28,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:28,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:28,940 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:28,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:28,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:28,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:28,942 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-28 09:56:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:31,577 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-28 09:56:31,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 09:56:31,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:31,586 INFO L225 Difference]: With dead ends: 1064 [2018-09-28 09:56:31,586 INFO L226 Difference]: Without dead ends: 1056 [2018-09-28 09:56:31,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-28 09:56:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-28 09:56:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-28 09:56:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-28 09:56:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-28 09:56:31,924 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-28 09:56:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:31,924 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-28 09:56:31,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-28 09:56:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:31,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:31,925 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:31,926 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:31,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:31,926 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-28 09:56:31,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:31,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:31,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:31,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:32,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:32,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:32,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:32,048 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-28 09:56:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:35,154 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-28 09:56:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-28 09:56:35,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:35,160 INFO L225 Difference]: With dead ends: 1241 [2018-09-28 09:56:35,160 INFO L226 Difference]: Without dead ends: 1233 [2018-09-28 09:56:35,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-28 09:56:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-28 09:56:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-28 09:56:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-28 09:56:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-28 09:56:35,508 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-28 09:56:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:35,508 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-28 09:56:35,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-28 09:56:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:35,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:35,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:35,510 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:35,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-28 09:56:35,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:35,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:35,596 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:35,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:35,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:35,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:35,597 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-28 09:56:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:38,044 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-28 09:56:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:56:38,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:38,050 INFO L225 Difference]: With dead ends: 1139 [2018-09-28 09:56:38,050 INFO L226 Difference]: Without dead ends: 1131 [2018-09-28 09:56:38,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:56:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-28 09:56:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-28 09:56:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-28 09:56:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-28 09:56:38,380 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-28 09:56:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:38,381 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-28 09:56:38,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-28 09:56:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:38,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:38,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:38,382 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:38,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:38,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-28 09:56:38,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:38,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:38,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:38,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:38,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:38,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:38,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:38,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:38,469 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-28 09:56:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:41,407 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-28 09:56:41,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:56:41,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:41,413 INFO L225 Difference]: With dead ends: 1325 [2018-09-28 09:56:41,413 INFO L226 Difference]: Without dead ends: 1317 [2018-09-28 09:56:41,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:56:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-28 09:56:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-28 09:56:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-28 09:56:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-28 09:56:41,742 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-28 09:56:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:41,742 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-28 09:56:41,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-28 09:56:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:41,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:41,743 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:41,744 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:41,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-28 09:56:41,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:41,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:41,834 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:41,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:41,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:41,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:41,836 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-28 09:56:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:45,106 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-28 09:56:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:56:45,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:45,112 INFO L225 Difference]: With dead ends: 1334 [2018-09-28 09:56:45,112 INFO L226 Difference]: Without dead ends: 1326 [2018-09-28 09:56:45,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-28 09:56:45,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-28 09:56:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-28 09:56:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-28 09:56:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-28 09:56:45,444 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-28 09:56:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:45,444 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-28 09:56:45,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-28 09:56:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:45,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:45,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:45,445 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:45,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-28 09:56:45,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:45,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:45,511 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:45,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:45,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:45,512 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-28 09:56:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:47,561 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-28 09:56:47,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:56:47,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:47,567 INFO L225 Difference]: With dead ends: 919 [2018-09-28 09:56:47,567 INFO L226 Difference]: Without dead ends: 911 [2018-09-28 09:56:47,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:56:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-28 09:56:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-28 09:56:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-28 09:56:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-28 09:56:47,927 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-28 09:56:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-28 09:56:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-28 09:56:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:47,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:47,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:47,929 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:47,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-28 09:56:47,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:47,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:47,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:47,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:47,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:47,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:47,993 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-28 09:56:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:50,634 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-28 09:56:50,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:56:50,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:50,640 INFO L225 Difference]: With dead ends: 1095 [2018-09-28 09:56:50,640 INFO L226 Difference]: Without dead ends: 1087 [2018-09-28 09:56:50,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:56:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-28 09:56:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-28 09:56:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-28 09:56:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-28 09:56:50,998 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-28 09:56:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:50,999 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-28 09:56:50,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-28 09:56:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:50,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:50,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:51,000 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:51,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-28 09:56:51,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:51,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:51,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:51,072 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:51,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:51,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:51,073 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-28 09:56:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:54,917 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-28 09:56:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-28 09:56:54,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:54,926 INFO L225 Difference]: With dead ends: 1304 [2018-09-28 09:56:54,926 INFO L226 Difference]: Without dead ends: 1296 [2018-09-28 09:56:54,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-28 09:56:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-28 09:56:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-28 09:56:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-28 09:56:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-28 09:56:55,296 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-28 09:56:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:55,296 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-28 09:56:55,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-28 09:56:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 09:56:55,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:55,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:55,298 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:55,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-28 09:56:55,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:55,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:55,376 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:55,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:56:55,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:56:55,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:56:55,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:56:55,377 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-28 09:56:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:58,762 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-28 09:56:58,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 09:56:58,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-28 09:56:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:58,765 INFO L225 Difference]: With dead ends: 1192 [2018-09-28 09:56:58,765 INFO L226 Difference]: Without dead ends: 1184 [2018-09-28 09:56:58,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-28 09:56:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-28 09:56:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-28 09:56:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-28 09:56:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-28 09:56:59,233 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-28 09:56:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:59,234 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-28 09:56:59,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:56:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-28 09:56:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:56:59,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:59,235 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:56:59,235 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:59,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-28 09:56:59,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:59,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:59,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:59,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:56:59,283 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:56:59,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:56:59,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 09:56:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 09:56:59,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-28 09:56:59,284 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-28 09:57:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:00,073 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-28 09:57:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 09:57:00,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-28 09:57:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:00,075 INFO L225 Difference]: With dead ends: 1139 [2018-09-28 09:57:00,075 INFO L226 Difference]: Without dead ends: 625 [2018-09-28 09:57:00,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:57:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-28 09:57:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-28 09:57:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-28 09:57:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-28 09:57:00,559 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-28 09:57:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:00,560 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-28 09:57:00,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 09:57:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-28 09:57:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:57:00,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:00,560 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:00,561 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:00,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-28 09:57:00,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:00,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:00,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:00,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:00,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:00,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:00,670 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-09-28 09:57:00,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:00,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:01,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:01,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-28 09:57:01,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 09:57:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 09:57:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-28 09:57:01,958 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-28 09:57:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:05,260 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-28 09:57:05,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 09:57:05,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-28 09:57:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:05,262 INFO L225 Difference]: With dead ends: 794 [2018-09-28 09:57:05,262 INFO L226 Difference]: Without dead ends: 789 [2018-09-28 09:57:05,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-28 09:57:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-28 09:57:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-28 09:57:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-28 09:57:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-28 09:57:06,008 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-28 09:57:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:06,008 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-28 09:57:06,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 09:57:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-28 09:57:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:57:06,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:06,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:06,009 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:06,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-28 09:57:06,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:06,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:06,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:06,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:06,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:06,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:06,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 09:57:06,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 09:57:06,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 09:57:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-28 09:57:06,052 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-28 09:57:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:07,406 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-28 09:57:07,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 09:57:07,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-28 09:57:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:07,408 INFO L225 Difference]: With dead ends: 1317 [2018-09-28 09:57:07,408 INFO L226 Difference]: Without dead ends: 729 [2018-09-28 09:57:07,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-28 09:57:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-28 09:57:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-28 09:57:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-28 09:57:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-28 09:57:08,016 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-28 09:57:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:08,017 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-28 09:57:08,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 09:57:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-28 09:57:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:08,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:08,018 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:08,018 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:08,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-28 09:57:08,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:08,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:08,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:08,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:08,217 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:08,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:57:08,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:08,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:08,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:08,217 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-28 09:57:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:11,589 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-28 09:57:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 09:57:11,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:11,592 INFO L225 Difference]: With dead ends: 1435 [2018-09-28 09:57:11,592 INFO L226 Difference]: Without dead ends: 1427 [2018-09-28 09:57:11,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:57:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-28 09:57:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-28 09:57:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-28 09:57:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-28 09:57:12,450 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-28 09:57:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:12,450 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-28 09:57:12,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-28 09:57:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:12,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:12,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:12,451 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:12,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-28 09:57:12,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:12,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:12,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:12,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:57:12,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:12,717 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-28 09:57:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:16,250 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-28 09:57:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:57:16,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:16,254 INFO L225 Difference]: With dead ends: 1599 [2018-09-28 09:57:16,254 INFO L226 Difference]: Without dead ends: 1591 [2018-09-28 09:57:16,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:57:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-28 09:57:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-28 09:57:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-28 09:57:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-28 09:57:17,044 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-28 09:57:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:17,044 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-28 09:57:17,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-28 09:57:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:17,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:17,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:17,046 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:17,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:17,046 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-28 09:57:17,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:17,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:17,127 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:17,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:57:17,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:17,128 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-28 09:57:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:20,356 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-28 09:57:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:57:20,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:20,362 INFO L225 Difference]: With dead ends: 1411 [2018-09-28 09:57:20,362 INFO L226 Difference]: Without dead ends: 1403 [2018-09-28 09:57:20,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:57:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-28 09:57:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-28 09:57:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-28 09:57:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-28 09:57:21,301 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-28 09:57:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:21,301 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-28 09:57:21,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-28 09:57:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:21,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:21,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:21,302 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:21,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:21,303 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-28 09:57:21,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:21,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:21,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:21,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:21,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:21,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:21,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:57:21,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:21,388 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-28 09:57:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:24,874 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-28 09:57:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:57:24,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:24,877 INFO L225 Difference]: With dead ends: 1490 [2018-09-28 09:57:24,877 INFO L226 Difference]: Without dead ends: 1482 [2018-09-28 09:57:24,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-28 09:57:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-28 09:57:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-28 09:57:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-28 09:57:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-28 09:57:25,786 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-28 09:57:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:25,786 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-28 09:57:25,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-28 09:57:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:25,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:25,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:25,787 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:25,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-28 09:57:25,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:25,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:25,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:25,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:25,868 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:25,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:57:25,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:25,869 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-28 09:57:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:29,258 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-28 09:57:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:57:29,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:29,260 INFO L225 Difference]: With dead ends: 1427 [2018-09-28 09:57:29,260 INFO L226 Difference]: Without dead ends: 1419 [2018-09-28 09:57:29,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:57:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-28 09:57:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-28 09:57:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-28 09:57:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-28 09:57:30,105 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-28 09:57:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:30,105 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-28 09:57:30,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-28 09:57:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:30,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:30,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:30,107 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:30,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-28 09:57:30,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:30,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:30,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:30,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:30,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:30,278 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:30,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-28 09:57:30,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:30,279 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-28 09:57:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:33,332 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-28 09:57:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-28 09:57:33,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:33,334 INFO L225 Difference]: With dead ends: 1306 [2018-09-28 09:57:33,334 INFO L226 Difference]: Without dead ends: 1298 [2018-09-28 09:57:33,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:57:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-28 09:57:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-28 09:57:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-28 09:57:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-28 09:57:34,282 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-28 09:57:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:34,282 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-28 09:57:34,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-28 09:57:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:34,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:34,283 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:34,283 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:34,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-28 09:57:34,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:34,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:34,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:34,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:34,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:34,360 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-09-28 09:57:34,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:34,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:34,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:34,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:57:34,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:34,414 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-28 09:57:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:37,417 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-28 09:57:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 09:57:37,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:37,419 INFO L225 Difference]: With dead ends: 1285 [2018-09-28 09:57:37,419 INFO L226 Difference]: Without dead ends: 1277 [2018-09-28 09:57:37,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-28 09:57:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-28 09:57:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-28 09:57:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-28 09:57:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-28 09:57:38,457 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-28 09:57:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:38,458 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-28 09:57:38,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-28 09:57:38,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:38,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:38,458 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:38,459 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:38,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-28 09:57:38,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:38,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:38,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:38,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:38,568 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-09-28 09:57:38,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:38,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:38,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:38,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:57:38,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:38,632 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-28 09:57:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:42,220 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-28 09:57:42,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 09:57:42,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:42,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:42,222 INFO L225 Difference]: With dead ends: 1518 [2018-09-28 09:57:42,222 INFO L226 Difference]: Without dead ends: 1510 [2018-09-28 09:57:42,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-28 09:57:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-28 09:57:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-28 09:57:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-28 09:57:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-28 09:57:43,280 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-28 09:57:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:43,280 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-28 09:57:43,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-28 09:57:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:43,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:43,281 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:43,281 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:43,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-28 09:57:43,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:43,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:43,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:43,347 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:43,347 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-09-28 09:57:43,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:43,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:43,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:43,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:57:43,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:43,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:43,411 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-28 09:57:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:46,940 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-28 09:57:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:57:46,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:46,952 INFO L225 Difference]: With dead ends: 1448 [2018-09-28 09:57:46,952 INFO L226 Difference]: Without dead ends: 1440 [2018-09-28 09:57:46,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-28 09:57:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-28 09:57:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-28 09:57:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-28 09:57:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-28 09:57:48,020 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-28 09:57:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:48,020 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-28 09:57:48,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-28 09:57:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:48,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:48,021 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:48,022 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:48,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:48,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-28 09:57:48,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:48,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:48,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:48,107 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:48,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:57:48,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:48,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:57:48,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:48,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-28 09:57:48,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-28 09:57:48,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-28 09:57:48,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-28 09:57:48,148 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-28 09:57:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:51,151 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-28 09:57:51,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:57:51,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-28 09:57:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:51,153 INFO L225 Difference]: With dead ends: 1254 [2018-09-28 09:57:51,153 INFO L226 Difference]: Without dead ends: 1246 [2018-09-28 09:57:51,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:57:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-28 09:57:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-28 09:57:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-28 09:57:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-28 09:57:52,091 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-28 09:57:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:52,091 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-28 09:57:52,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-28 09:57:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-28 09:57:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:52,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:52,092 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:52,093 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:52,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-28 09:57:52,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:52,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:52,197 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:52,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:57:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:52,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:52,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:52,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:57:52,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:57:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:57:52,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:57:52,529 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-09-28 09:57:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:58,427 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-09-28 09:57:58,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-28 09:57:58,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:57:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:58,429 INFO L225 Difference]: With dead ends: 1278 [2018-09-28 09:57:58,429 INFO L226 Difference]: Without dead ends: 1270 [2018-09-28 09:57:58,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-09-28 09:57:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-09-28 09:57:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-09-28 09:57:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-28 09:57:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-28 09:57:59,525 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-28 09:57:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:59,526 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-28 09:57:59,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:57:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-28 09:57:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:57:59,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:59,526 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:57:59,527 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:59,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-28 09:57:59,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:59,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:59,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:57:59,635 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:57:59,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-28 09:57:59,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:57:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:57:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:57:59,636 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-28 09:58:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:02,852 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-28 09:58:02,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:58:02,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-28 09:58:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:02,854 INFO L225 Difference]: With dead ends: 1180 [2018-09-28 09:58:02,854 INFO L226 Difference]: Without dead ends: 1172 [2018-09-28 09:58:02,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:58:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-28 09:58:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-28 09:58:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-28 09:58:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-28 09:58:03,944 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-28 09:58:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:03,944 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-28 09:58:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:58:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-28 09:58:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:03,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:03,945 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:03,945 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-28 09:58:03,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:03,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:03,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:04,513 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:58:04,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-28 09:58:04,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:58:04,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:58:04,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:58:04,513 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-28 09:58:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:08,120 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-28 09:58:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:58:08,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-28 09:58:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:08,122 INFO L225 Difference]: With dead ends: 1233 [2018-09-28 09:58:08,123 INFO L226 Difference]: Without dead ends: 1225 [2018-09-28 09:58:08,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-28 09:58:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-28 09:58:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-28 09:58:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-28 09:58:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-28 09:58:09,149 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-28 09:58:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:09,149 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-28 09:58:09,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:58:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-28 09:58:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:09,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:09,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:09,151 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:09,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-28 09:58:09,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:09,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:09,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:09,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:58:09,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-28 09:58:09,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:58:09,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:58:09,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:58:09,223 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-28 09:58:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:13,420 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-09-28 09:58:13,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 09:58:13,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-28 09:58:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:13,422 INFO L225 Difference]: With dead ends: 1537 [2018-09-28 09:58:13,422 INFO L226 Difference]: Without dead ends: 1529 [2018-09-28 09:58:13,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-09-28 09:58:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-28 09:58:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-09-28 09:58:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-28 09:58:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-28 09:58:14,535 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-28 09:58:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:14,535 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-28 09:58:14,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:58:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-28 09:58:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:14,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:14,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:14,536 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:14,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-28 09:58:14,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:14,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:14,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:14,605 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:58:14,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-28 09:58:14,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:58:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:58:14,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:58:14,606 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-28 09:58:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:19,161 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-28 09:58:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 09:58:19,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-28 09:58:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:19,163 INFO L225 Difference]: With dead ends: 1590 [2018-09-28 09:58:19,164 INFO L226 Difference]: Without dead ends: 1582 [2018-09-28 09:58:19,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-09-28 09:58:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-28 09:58:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-28 09:58:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-28 09:58:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-28 09:58:20,347 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-28 09:58:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:20,347 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-28 09:58:20,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:58:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-28 09:58:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:20,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:20,348 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:20,348 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:20,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-28 09:58:20,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:20,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:20,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:20,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:20,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:20,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:20,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:58:20,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:58:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:58:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:58:20,572 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-09-28 09:58:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:30,282 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-09-28 09:58:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-28 09:58:30,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:58:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:30,285 INFO L225 Difference]: With dead ends: 1949 [2018-09-28 09:58:30,285 INFO L226 Difference]: Without dead ends: 1941 [2018-09-28 09:58:30,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-09-28 09:58:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-09-28 09:58:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-09-28 09:58:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-28 09:58:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-28 09:58:31,596 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-28 09:58:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:31,596 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-28 09:58:31,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:58:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-28 09:58:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:31,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:31,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:31,597 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:31,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-28 09:58:31,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:31,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:31,670 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:58:31,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-28 09:58:31,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:58:31,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:58:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:58:31,671 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-28 09:58:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:35,892 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-28 09:58:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-28 09:58:35,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-28 09:58:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:35,904 INFO L225 Difference]: With dead ends: 1420 [2018-09-28 09:58:35,904 INFO L226 Difference]: Without dead ends: 1412 [2018-09-28 09:58:35,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-28 09:58:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-28 09:58:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-28 09:58:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-28 09:58:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-28 09:58:37,022 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-28 09:58:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:37,022 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-28 09:58:37,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:58:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-28 09:58:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:37,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:37,023 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:37,023 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:37,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-28 09:58:37,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:37,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:37,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:37,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:37,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:37,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:38,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:38,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:58:38,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:58:38,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:58:38,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:58:38,067 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-09-28 09:58:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:51,018 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-09-28 09:58:51,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-28 09:58:51,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:58:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:51,022 INFO L225 Difference]: With dead ends: 2767 [2018-09-28 09:58:51,023 INFO L226 Difference]: Without dead ends: 2759 [2018-09-28 09:58:51,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-09-28 09:58:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-28 09:58:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-09-28 09:58:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-28 09:58:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-09-28 09:58:52,570 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-09-28 09:58:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:52,570 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-09-28 09:58:52,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:58:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-09-28 09:58:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 09:58:52,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:52,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:58:52,572 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:52,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-28 09:58:52,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:52,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:52,677 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:52,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:58:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:52,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:58:52,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:52,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-28 09:58:52,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:58:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:58:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:58:52,820 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-09-28 09:59:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:06,384 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-09-28 09:59:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-28 09:59:06,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-28 09:59:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:06,387 INFO L225 Difference]: With dead ends: 2361 [2018-09-28 09:59:06,387 INFO L226 Difference]: Without dead ends: 2353 [2018-09-28 09:59:06,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-09-28 09:59:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-09-28 09:59:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-09-28 09:59:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-09-28 09:59:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-09-28 09:59:08,017 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-09-28 09:59:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:08,017 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-09-28 09:59:08,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:59:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-09-28 09:59:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-28 09:59:08,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:08,018 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:08,018 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:08,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-28 09:59:08,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:08,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:59:08,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:08,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:08,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:08,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:59:08,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:08,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-28 09:59:08,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-28 09:59:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-28 09:59:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-28 09:59:08,309 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-09-28 09:59:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:11,103 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-09-28 09:59:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-28 09:59:11,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-09-28 09:59:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:11,105 INFO L225 Difference]: With dead ends: 1507 [2018-09-28 09:59:11,105 INFO L226 Difference]: Without dead ends: 1502 [2018-09-28 09:59:11,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:59:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-09-28 09:59:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-09-28 09:59:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-09-28 09:59:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-09-28 09:59:13,028 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-09-28 09:59:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:13,028 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-09-28 09:59:13,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-28 09:59:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-09-28 09:59:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-28 09:59:13,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:13,029 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:13,030 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:13,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-28 09:59:13,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:13,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:59:13,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:13,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:13,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:13,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 09:59:13,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:13,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-28 09:59:13,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-28 09:59:13,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-28 09:59:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:59:13,883 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-09-28 09:59:14,371 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-28 09:59:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:24,363 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-09-28 09:59:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-28 09:59:24,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-09-28 09:59:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:24,367 INFO L225 Difference]: With dead ends: 3654 [2018-09-28 09:59:24,367 INFO L226 Difference]: Without dead ends: 3646 [2018-09-28 09:59:24,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-09-28 09:59:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-09-28 09:59:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-09-28 09:59:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-28 09:59:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-09-28 09:59:27,135 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-09-28 09:59:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:27,136 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-09-28 09:59:27,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-28 09:59:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-09-28 09:59:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 09:59:27,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:27,137 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:27,137 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:27,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-28 09:59:27,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:27,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:27,232 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:27,233 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:27,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:27,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:27,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:27,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-28 09:59:27,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-28 09:59:27,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-28 09:59:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-28 09:59:27,319 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-09-28 09:59:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:32,898 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-09-28 09:59:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 09:59:32,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-28 09:59:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:32,901 INFO L225 Difference]: With dead ends: 2767 [2018-09-28 09:59:32,902 INFO L226 Difference]: Without dead ends: 2759 [2018-09-28 09:59:32,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-28 09:59:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-28 09:59:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-09-28 09:59:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-09-28 09:59:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-09-28 09:59:35,763 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-09-28 09:59:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:35,763 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-09-28 09:59:35,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-28 09:59:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-09-28 09:59:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 09:59:35,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:35,764 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:35,765 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:35,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-09-28 09:59:35,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:35,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:35,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:36,345 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:36,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:36,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:36,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:36,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:36,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-28 09:59:36,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-28 09:59:36,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-28 09:59:36,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-28 09:59:36,406 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-09-28 09:59:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:42,564 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-09-28 09:59:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 09:59:42,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-28 09:59:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:42,567 INFO L225 Difference]: With dead ends: 3146 [2018-09-28 09:59:42,568 INFO L226 Difference]: Without dead ends: 3138 [2018-09-28 09:59:42,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-09-28 09:59:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-28 09:59:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-09-28 09:59:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-09-28 09:59:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-09-28 09:59:45,582 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-09-28 09:59:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:45,582 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-09-28 09:59:45,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-28 09:59:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-09-28 09:59:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 09:59:45,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:45,583 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:45,583 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:45,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:45,584 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-28 09:59:45,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:45,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:45,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:45,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:45,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:45,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:45,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:45,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:45,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:45,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-28 09:59:45,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-28 09:59:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-28 09:59:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-28 09:59:45,756 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-09-28 09:59:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:52,372 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-09-28 09:59:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-28 09:59:52,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-28 09:59:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:52,376 INFO L225 Difference]: With dead ends: 3089 [2018-09-28 09:59:52,377 INFO L226 Difference]: Without dead ends: 3081 [2018-09-28 09:59:52,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:59:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-09-28 09:59:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-09-28 09:59:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-28 09:59:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-09-28 09:59:55,354 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-09-28 09:59:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:55,355 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-09-28 09:59:55,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-28 09:59:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-09-28 09:59:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 09:59:55,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:55,357 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 09:59:55,357 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:55,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-09-28 09:59:55,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:55,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:55,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:55,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:55,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:55,454 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:55,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:59:55,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:55,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 09:59:55,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:55,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-28 09:59:55,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-28 09:59:55,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-28 09:59:55,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-28 09:59:55,525 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. Received shutdown request... [2018-09-28 09:59:59,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 09:59:59,511 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-28 09:59:59,517 WARN L206 ceAbstractionStarter]: Timeout [2018-09-28 09:59:59,518 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 09:59:59 BoogieIcfgContainer [2018-09-28 09:59:59,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 09:59:59,519 INFO L168 Benchmark]: Toolchain (without parser) took 255511.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 339.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-28 09:59:59,520 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:59,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:59,520 INFO L168 Benchmark]: Boogie Preprocessor took 56.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:59,521 INFO L168 Benchmark]: RCFGBuilder took 836.50 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-09-28 09:59:59,521 INFO L168 Benchmark]: TraceAbstraction took 254552.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 307.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-28 09:59:59,524 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.22 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 50.62 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 56.15 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 836.50 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 254552.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 307.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 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 (2246states) and FLOYD_HOARE automaton (currently 15 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1159 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 254.4s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 202.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13587 SDtfs, 45591 SDslu, 46828 SDs, 0 SdLazy, 95736 SolverSat, 9979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1838 GetRequests, 327 SyntacticMatches, 4 SemanticMatches, 1507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25582 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 40.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 27176 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 47980 SizeOfPredicates, 77 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 67 InterpolantComputations, 37 PerfectInterpolantSequences, 43/111 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-28_09-59-59-535.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-28_09-59-59-535.csv Completed graceful shutdown