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-1cc990c [2018-09-30 20:06:20,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:06:20,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:06:20,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:06:20,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:06:20,927 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:06:20,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:06:20,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:06:20,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:06:20,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:06:20,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:06:20,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:06:20,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:06:20,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:06:20,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:06:20,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:06:20,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:06:20,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:06:20,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:06:20,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:06:20,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:06:20,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:06:20,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:06:20,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:06:20,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:06:20,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:06:20,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:06:20,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:06:20,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:06:20,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:06:20,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:06:20,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:06:20,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:06:20,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:06:20,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:06:20,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:06:20,957 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:06:20,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:06:20,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:06:20,973 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:06:20,974 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:06:20,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:06:20,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:06:20,975 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:06:20,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:06:20,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:06:20,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:06:20,976 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:06:20,976 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:06:20,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:06:20,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:06:20,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:06:20,977 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:06:20,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:06:20,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:06:20,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:06:20,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:06:20,977 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:06:20,978 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:06:20,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:20,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:06:20,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:06:20,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:06:20,979 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:06:20,979 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:06:20,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:06:20,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:06:21,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:06:21,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:06:21,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:06:21,053 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:06:21,054 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:06:21,055 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-30 20:06:21,055 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-30 20:06:21,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:06:21,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:06:21,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:21,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:06:21,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:06:21,153 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 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,168 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 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,173 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:06:21,173 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:06:21,173 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:06:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:21,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:06:21,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:06:21,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:06:21,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... [2018-09-30 20:06:21,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:06:21,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:06:21,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:06:21,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:06:21,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:21,300 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:06:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:06:21,300 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:06:22,240 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:06:22,241 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:22 BoogieIcfgContainer [2018-09-30 20:06:22,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:06:22,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:06:22,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:06:22,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:06:22,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:21" (1/2) ... [2018-09-30 20:06:22,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371e3ef and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:06:22, skipping insertion in model container [2018-09-30 20:06:22,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:22" (2/2) ... [2018-09-30 20:06:22,249 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-30 20:06:22,260 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:06:22,268 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 20:06:22,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:06:22,318 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:06:22,318 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:06:22,318 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:06:22,318 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:06:22,319 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:06:22,319 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:06:22,319 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:06:22,319 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:06:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 20:06:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:06:22,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:22,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:22,345 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 20:06:22,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:22,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:22,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:22,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:22,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:06:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:06:22,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:06:22,670 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 20:06:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:24,559 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 20:06:24,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:06:24,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:06:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:24,579 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:06:24,580 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 20:06:24,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 20:06:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 20:06:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:06:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 20:06:24,645 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 20:06:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:24,646 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 20:06:24,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:06:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 20:06:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:06:24,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:24,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:24,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:24,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 20:06:24,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:24,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:24,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:24,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:24,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:24,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:06:24,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:06:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:06:24,814 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 20:06:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:25,729 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 20:06:25,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:06:25,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:06:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:25,734 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:06:25,735 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 20:06:25,736 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-30 20:06:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 20:06:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 20:06:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 20:06:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 20:06:25,784 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 20:06:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:25,786 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 20:06:25,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:06:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 20:06:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:25,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:25,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:25,789 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:25,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:25,790 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 20:06:25,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:25,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:25,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:25,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:25,891 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:25,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:06:25,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:25,893 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 20:06:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:27,406 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-30 20:06:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:06:27,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:06:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:27,411 INFO L225 Difference]: With dead ends: 283 [2018-09-30 20:06:27,411 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 20:06:27,412 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-30 20:06:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 20:06:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-30 20:06:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 20:06:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-30 20:06:27,443 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-30 20:06:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:27,443 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-30 20:06:27,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-30 20:06:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:27,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:27,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:27,446 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:27,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 20:06:27,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:27,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:27,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:27,652 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:27,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:06:27,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:27,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:27,654 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-30 20:06:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:29,424 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-30 20:06:29,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:06:29,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:06:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:29,429 INFO L225 Difference]: With dead ends: 387 [2018-09-30 20:06:29,429 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 20:06:29,430 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-30 20:06:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 20:06:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-30 20:06:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 20:06:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 20:06:29,476 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 20:06:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:29,476 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 20:06:29,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 20:06:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:29,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:29,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:29,479 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:29,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 20:06:29,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:29,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:29,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:29,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:29,586 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:29,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:29,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:29,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:29,588 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-30 20:06:30,902 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:33,293 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-30 20:06:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:06:33,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:33,300 INFO L225 Difference]: With dead ends: 725 [2018-09-30 20:06:33,300 INFO L226 Difference]: Without dead ends: 717 [2018-09-30 20:06:33,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:06:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-30 20:06:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-30 20:06:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 20:06:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-30 20:06:33,367 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-30 20:06:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:33,368 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-30 20:06:33,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-30 20:06:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:33,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:33,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:33,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:33,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 20:06:33,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:33,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:33,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:33,500 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:33,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:33,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:33,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:33,502 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-30 20:06:36,132 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 20:06:37,081 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-30 20:06:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:38,855 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-30 20:06:38,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:06:38,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:38,864 INFO L225 Difference]: With dead ends: 1008 [2018-09-30 20:06:38,864 INFO L226 Difference]: Without dead ends: 1000 [2018-09-30 20:06:38,866 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-30 20:06:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-30 20:06:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-30 20:06:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-30 20:06:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-30 20:06:38,965 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-30 20:06:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:38,965 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-30 20:06:38,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-30 20:06:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:38,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:38,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:38,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:38,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 20:06:38,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:38,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:38,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:39,112 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:39,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:39,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:39,113 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-30 20:06:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:41,621 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-30 20:06:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:06:41,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:41,630 INFO L225 Difference]: With dead ends: 924 [2018-09-30 20:06:41,630 INFO L226 Difference]: Without dead ends: 916 [2018-09-30 20:06:41,632 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-30 20:06:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-30 20:06:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-30 20:06:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 20:06:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-30 20:06:41,726 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-30 20:06:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:41,726 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-30 20:06:41,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-30 20:06:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:41,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:41,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:41,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:41,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:41,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 20:06:41,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:41,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:41,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:41,943 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:41,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:41,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:41,944 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-30 20:06:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:43,970 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-30 20:06:43,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:06:43,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:43,978 INFO L225 Difference]: With dead ends: 791 [2018-09-30 20:06:43,978 INFO L226 Difference]: Without dead ends: 783 [2018-09-30 20:06:43,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-30 20:06:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-30 20:06:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-30 20:06:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-30 20:06:44,086 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-30 20:06:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:44,086 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-30 20:06:44,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-30 20:06:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:44,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:44,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:44,088 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:44,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:44,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-30 20:06:44,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:44,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:44,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:44,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:44,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:44,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:44,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:44,172 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-30 20:06:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:46,436 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-30 20:06:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:06:46,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:46,442 INFO L225 Difference]: With dead ends: 1040 [2018-09-30 20:06:46,442 INFO L226 Difference]: Without dead ends: 1032 [2018-09-30 20:06:46,443 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-30 20:06:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-30 20:06:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-30 20:06:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-30 20:06:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-30 20:06:46,570 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-30 20:06:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:46,571 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-30 20:06:46,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-30 20:06:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:46,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:46,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:46,573 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:46,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-30 20:06:46,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:46,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:46,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:46,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:46,711 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:46,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:46,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:46,712 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-30 20:06:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:49,581 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-30 20:06:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:06:49,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:49,589 INFO L225 Difference]: With dead ends: 1166 [2018-09-30 20:06:49,589 INFO L226 Difference]: Without dead ends: 1158 [2018-09-30 20:06:49,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 20:06:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-30 20:06:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-30 20:06:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-30 20:06:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-30 20:06:49,767 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-30 20:06:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:49,768 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-30 20:06:49,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-30 20:06:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:49,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:49,769 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:49,769 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:49,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-30 20:06:49,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:50,104 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:50,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:50,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:50,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:50,105 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-30 20:06:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:52,678 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-30 20:06:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:06:52,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:52,685 INFO L225 Difference]: With dead ends: 1127 [2018-09-30 20:06:52,686 INFO L226 Difference]: Without dead ends: 1119 [2018-09-30 20:06:52,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:06:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-30 20:06:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-30 20:06:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-30 20:06:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-30 20:06:52,826 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-30 20:06:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:52,826 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-30 20:06:52,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-30 20:06:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:52,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:52,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:52,828 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:52,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-30 20:06:52,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:53,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:53,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:53,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:53,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:53,119 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-30 20:06:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:55,548 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-30 20:06:55,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:06:55,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:55,554 INFO L225 Difference]: With dead ends: 975 [2018-09-30 20:06:55,554 INFO L226 Difference]: Without dead ends: 967 [2018-09-30 20:06:55,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-30 20:06:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-30 20:06:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-30 20:06:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-30 20:06:55,718 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-30 20:06:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:55,720 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-30 20:06:55,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-30 20:06:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:55,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:55,721 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:55,721 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:55,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-30 20:06:55,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:55,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:55,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:55,809 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:55,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:55,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:55,811 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-30 20:06:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:58,494 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-30 20:06:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:06:58,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:58,498 INFO L225 Difference]: With dead ends: 1011 [2018-09-30 20:06:58,499 INFO L226 Difference]: Without dead ends: 1003 [2018-09-30 20:06:58,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-30 20:06:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-30 20:06:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-30 20:06:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-30 20:06:58,676 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-30 20:06:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:58,676 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-30 20:06:58,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-30 20:06:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:58,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:58,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:58,678 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:58,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-30 20:06:58,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:58,764 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:58,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:58,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:58,766 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-30 20:07:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:00,918 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-30 20:07:00,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:07:00,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:00,922 INFO L225 Difference]: With dead ends: 859 [2018-09-30 20:07:00,922 INFO L226 Difference]: Without dead ends: 851 [2018-09-30 20:07:00,923 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-30 20:07:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-30 20:07:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-30 20:07:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 20:07:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 20:07:01,113 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 20:07:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:01,113 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 20:07:01,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 20:07:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:01,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:01,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:01,114 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:01,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 20:07:01,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:01,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:01,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:01,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:01,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:01,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:01,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:01,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:01,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:01,204 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 20:07:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:03,618 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-30 20:07:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:07:03,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:03,623 INFO L225 Difference]: With dead ends: 962 [2018-09-30 20:07:03,623 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 20:07:03,623 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-30 20:07:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 20:07:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-30 20:07:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-30 20:07:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-30 20:07:03,868 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-30 20:07:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:03,868 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-30 20:07:03,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-30 20:07:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:03,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:03,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:03,870 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:03,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-30 20:07:03,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:03,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:03,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:03,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:03,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:03,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:03,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:03,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:03,959 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-30 20:07:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:06,547 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-30 20:07:06,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:07:06,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:06,553 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 20:07:06,553 INFO L226 Difference]: Without dead ends: 1056 [2018-09-30 20:07:06,554 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-30 20:07:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-30 20:07:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-30 20:07:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-30 20:07:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-30 20:07:06,886 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-30 20:07:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:06,886 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-30 20:07:06,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-30 20:07:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:06,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:06,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:06,888 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:06,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 20:07:06,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:06,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:06,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:06,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:06,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:06,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:06,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:06,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:06,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:06,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:06,967 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-30 20:07:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:10,302 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-30 20:07:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:07:10,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:10,307 INFO L225 Difference]: With dead ends: 1241 [2018-09-30 20:07:10,307 INFO L226 Difference]: Without dead ends: 1233 [2018-09-30 20:07:10,308 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-30 20:07:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-30 20:07:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-30 20:07:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 20:07:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-30 20:07:10,663 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-30 20:07:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:10,663 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-30 20:07:10,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-30 20:07:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:10,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:10,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:10,664 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:10,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-30 20:07:10,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:10,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:10,742 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:10,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:10,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:10,744 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-30 20:07:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:13,149 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-30 20:07:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:07:13,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:13,155 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 20:07:13,155 INFO L226 Difference]: Without dead ends: 1131 [2018-09-30 20:07:13,155 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-30 20:07:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-30 20:07:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-30 20:07:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-30 20:07:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-30 20:07:13,476 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-30 20:07:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:13,477 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-30 20:07:13,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-30 20:07:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:13,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:13,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:13,478 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:13,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:13,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-30 20:07:13,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:13,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:13,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:13,575 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:13,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:13,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:13,576 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-30 20:07:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:16,712 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-30 20:07:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:07:16,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:16,718 INFO L225 Difference]: With dead ends: 1325 [2018-09-30 20:07:16,718 INFO L226 Difference]: Without dead ends: 1317 [2018-09-30 20:07:16,719 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-30 20:07:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-30 20:07:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-30 20:07:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-30 20:07:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-30 20:07:17,027 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-30 20:07:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:17,027 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-30 20:07:17,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-30 20:07:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:17,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:17,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:17,028 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:17,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 20:07:17,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:17,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:17,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:17,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:17,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:17,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:17,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:17,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:17,113 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-30 20:07:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:20,586 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-30 20:07:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:07:20,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:20,592 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 20:07:20,592 INFO L226 Difference]: Without dead ends: 1326 [2018-09-30 20:07:20,593 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-30 20:07:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-30 20:07:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-30 20:07:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-30 20:07:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-30 20:07:20,921 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-30 20:07:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:20,921 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-30 20:07:20,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-30 20:07:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:20,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:20,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:20,922 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:20,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-30 20:07:20,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:20,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:20,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:20,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:20,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:20,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:20,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:20,988 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-30 20:07:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:23,005 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-30 20:07:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:07:23,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:23,010 INFO L225 Difference]: With dead ends: 919 [2018-09-30 20:07:23,010 INFO L226 Difference]: Without dead ends: 911 [2018-09-30 20:07:23,011 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-30 20:07:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-30 20:07:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-30 20:07:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 20:07:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-30 20:07:23,350 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-30 20:07:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:23,350 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-30 20:07:23,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-30 20:07:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:23,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:23,351 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:23,351 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:23,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-30 20:07:23,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:23,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:23,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:23,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:23,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:23,442 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:23,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:23,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:23,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:23,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:23,443 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-30 20:07:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:26,230 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-30 20:07:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:07:26,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:26,237 INFO L225 Difference]: With dead ends: 1095 [2018-09-30 20:07:26,237 INFO L226 Difference]: Without dead ends: 1087 [2018-09-30 20:07:26,238 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-30 20:07:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-30 20:07:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-30 20:07:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-30 20:07:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-30 20:07:26,594 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-30 20:07:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:26,594 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-30 20:07:26,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-30 20:07:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:26,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:26,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:26,595 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:26,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-30 20:07:26,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:26,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:26,659 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:26,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:26,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:26,660 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-30 20:07:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:30,467 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-30 20:07:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:07:30,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:30,472 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 20:07:30,472 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 20:07:30,473 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-30 20:07:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 20:07:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-30 20:07:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-30 20:07:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-30 20:07:30,883 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-30 20:07:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:30,883 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-30 20:07:30,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-30 20:07:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:30,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:30,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:30,885 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:30,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 20:07:30,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:30,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:30,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:30,980 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-30 20:07:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:34,337 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-30 20:07:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:07:34,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:07:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:34,341 INFO L225 Difference]: With dead ends: 1192 [2018-09-30 20:07:34,341 INFO L226 Difference]: Without dead ends: 1184 [2018-09-30 20:07:34,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:07:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-30 20:07:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-30 20:07:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 20:07:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 20:07:34,843 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 20:07:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:34,844 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 20:07:34,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 20:07:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:07:34,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:34,844 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:34,845 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:34,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-30 20:07:34,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:34,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:34,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:34,899 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-30 20:07:34,899 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:34,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:07:34,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:07:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:07:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:07:34,900 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 20:07:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:35,731 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-30 20:07:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:07:35,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:07:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:35,733 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 20:07:35,733 INFO L226 Difference]: Without dead ends: 625 [2018-09-30 20:07:35,735 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-30 20:07:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-30 20:07:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-30 20:07:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 20:07:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-30 20:07:36,193 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-30 20:07:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:36,193 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-30 20:07:36,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:07:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-30 20:07:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:07:36,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:36,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:36,194 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:36,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-30 20:07:36,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:36,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:36,296 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-30 20:07:36,297 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:36,297 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-30 20:07:36,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:36,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:37,316 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-30 20:07:37,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:37,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:07:37,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:07:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:07:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:07:37,339 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-30 20:07:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:41,315 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-30 20:07:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:07:41,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 20:07:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:41,317 INFO L225 Difference]: With dead ends: 794 [2018-09-30 20:07:41,317 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 20:07:41,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:07:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 20:07:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-30 20:07:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-30 20:07:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-30 20:07:42,036 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-30 20:07:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:42,036 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-30 20:07:42,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:07:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-30 20:07:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:07:42,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:42,037 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:42,038 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:42,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-30 20:07:42,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:42,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:42,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:42,098 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:42,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:07:42,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:07:42,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:07:42,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:07:42,100 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-30 20:07:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:43,595 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-30 20:07:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:07:43,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:07:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:43,598 INFO L225 Difference]: With dead ends: 1317 [2018-09-30 20:07:43,598 INFO L226 Difference]: Without dead ends: 729 [2018-09-30 20:07:43,599 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-30 20:07:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-30 20:07:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-30 20:07:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 20:07:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 20:07:44,308 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 20:07:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:44,308 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 20:07:44,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:07:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 20:07:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:07:44,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:44,309 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:44,309 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:44,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-30 20:07:44,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:44,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:44,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:44,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:44,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:44,608 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:44,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:44,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:44,609 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-30 20:07:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:48,054 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-30 20:07:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:07:48,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:07:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:48,058 INFO L225 Difference]: With dead ends: 1435 [2018-09-30 20:07:48,059 INFO L226 Difference]: Without dead ends: 1427 [2018-09-30 20:07:48,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 20:07:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-30 20:07:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-30 20:07:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 20:07:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-30 20:07:48,990 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-30 20:07:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:48,990 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-30 20:07:48,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-30 20:07:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:07:48,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:48,991 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:48,992 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:48,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-30 20:07:48,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:48,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:49,252 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:49,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:49,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:49,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:49,253 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-30 20:07:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:53,037 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-30 20:07:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:07:53,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:07:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:53,042 INFO L225 Difference]: With dead ends: 1599 [2018-09-30 20:07:53,043 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 20:07:53,044 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-30 20:07:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 20:07:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-30 20:07:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 20:07:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-30 20:07:53,900 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-30 20:07:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:53,900 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-30 20:07:53,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-30 20:07:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:07:53,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:53,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:53,902 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:53,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-30 20:07:53,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:53,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:53,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:53,999 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:54,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:54,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:54,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:54,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:54,000 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-30 20:07:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:57,317 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-30 20:07:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:07:57,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:07:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:57,321 INFO L225 Difference]: With dead ends: 1411 [2018-09-30 20:07:57,321 INFO L226 Difference]: Without dead ends: 1403 [2018-09-30 20:07:57,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:07:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-30 20:07:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-30 20:07:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-30 20:07:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-30 20:07:58,246 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-30 20:07:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:58,246 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-30 20:07:58,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-30 20:07:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:07:58,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:58,247 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:58,247 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:58,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-30 20:07:58,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:58,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:58,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:58,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:58,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:58,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:58,352 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-30 20:08:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:02,054 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-30 20:08:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:08:02,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:02,057 INFO L225 Difference]: With dead ends: 1490 [2018-09-30 20:08:02,057 INFO L226 Difference]: Without dead ends: 1482 [2018-09-30 20:08:02,057 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-30 20:08:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-30 20:08:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-30 20:08:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-30 20:08:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-30 20:08:03,003 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-30 20:08:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:03,004 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-30 20:08:03,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-30 20:08:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:03,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:03,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:03,005 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:03,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-30 20:08:03,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:03,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:03,141 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:03,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:08:03,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:03,142 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-30 20:08:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:06,605 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-30 20:08:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:08:06,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:06,607 INFO L225 Difference]: With dead ends: 1427 [2018-09-30 20:08:06,607 INFO L226 Difference]: Without dead ends: 1419 [2018-09-30 20:08:06,608 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-30 20:08:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-30 20:08:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-30 20:08:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-30 20:08:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-30 20:08:07,563 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-30 20:08:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:07,563 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-30 20:08:07,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-30 20:08:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:07,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:07,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:07,565 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:07,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-30 20:08:07,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:07,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:07,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:07,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:07,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:08:07,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:07,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:07,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:07,675 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-30 20:08:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:10,919 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-30 20:08:10,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:08:10,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:10,921 INFO L225 Difference]: With dead ends: 1306 [2018-09-30 20:08:10,921 INFO L226 Difference]: Without dead ends: 1298 [2018-09-30 20:08:10,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:08:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-30 20:08:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-30 20:08:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 20:08:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-30 20:08:11,998 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-30 20:08:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:11,998 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-30 20:08:11,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-30 20:08:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:11,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:11,999 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:11,999 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:11,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:11,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-30 20:08:11,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:12,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:12,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:12,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:12,066 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-30 20:08:12,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:12,067 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-30 20:08:12,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:12,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:12,089 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-30 20:08:12,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:12,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:08:12,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:12,120 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-30 20:08:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:15,198 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-30 20:08:15,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:08:15,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:15,200 INFO L225 Difference]: With dead ends: 1285 [2018-09-30 20:08:15,200 INFO L226 Difference]: Without dead ends: 1277 [2018-09-30 20:08:15,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:08:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-30 20:08:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-30 20:08:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 20:08:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-30 20:08:16,306 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-30 20:08:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:16,306 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-30 20:08:16,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-30 20:08:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:16,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:16,307 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:16,307 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:16,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-30 20:08:16,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:16,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:16,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:16,522 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-30 20:08:16,523 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:16,523 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-30 20:08:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:16,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:16,542 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-30 20:08:16,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:16,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:08:16,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:16,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:16,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:16,573 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-30 20:08:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:20,305 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-30 20:08:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:08:20,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:20,307 INFO L225 Difference]: With dead ends: 1518 [2018-09-30 20:08:20,307 INFO L226 Difference]: Without dead ends: 1510 [2018-09-30 20:08:20,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-30 20:08:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-30 20:08:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-30 20:08:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-30 20:08:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-30 20:08:21,394 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-30 20:08:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:21,394 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-30 20:08:21,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-30 20:08:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:21,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:21,395 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:21,395 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:21,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-30 20:08:21,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:21,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:21,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:21,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:21,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:21,500 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-30 20:08:21,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:21,500 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-30 20:08:21,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:21,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:21,535 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-30 20:08:21,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:21,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:08:21,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:21,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:21,556 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-30 20:08:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:25,208 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-30 20:08:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:08:25,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:25,210 INFO L225 Difference]: With dead ends: 1448 [2018-09-30 20:08:25,211 INFO L226 Difference]: Without dead ends: 1440 [2018-09-30 20:08:25,211 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-30 20:08:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-30 20:08:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-30 20:08:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-30 20:08:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-30 20:08:26,285 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-30 20:08:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:26,285 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-30 20:08:26,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-30 20:08:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:26,286 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:26,286 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:26,286 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:26,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:26,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-30 20:08:26,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:26,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:26,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:26,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:26,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:26,908 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-30 20:08:26,909 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:26,909 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-30 20:08:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:26,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:26,948 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-30 20:08:26,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:26,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:08:26,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:26,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:26,971 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-30 20:08:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:30,052 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-30 20:08:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:08:30,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:08:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:30,054 INFO L225 Difference]: With dead ends: 1254 [2018-09-30 20:08:30,054 INFO L226 Difference]: Without dead ends: 1246 [2018-09-30 20:08:30,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:08:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-30 20:08:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-30 20:08:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-30 20:08:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-30 20:08:31,082 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-30 20:08:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:31,082 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-30 20:08:31,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-30 20:08:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:31,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:31,083 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:31,084 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:31,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-30 20:08:31,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:31,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:31,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:31,160 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-30 20:08:31,160 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:31,161 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-30 20:08:31,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:31,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:31,488 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-30 20:08:31,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:31,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:08:31,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:08:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:08:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:08:31,510 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-09-30 20:08:34,024 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-30 20:08:35,829 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 20:08:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:37,383 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-09-30 20:08:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:08:37,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:08:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:37,385 INFO L225 Difference]: With dead ends: 1278 [2018-09-30 20:08:37,385 INFO L226 Difference]: Without dead ends: 1270 [2018-09-30 20:08:37,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:08:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-09-30 20:08:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-09-30 20:08:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-30 20:08:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-30 20:08:38,483 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-30 20:08:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:38,484 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-30 20:08:38,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:08:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-30 20:08:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:38,484 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:38,484 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:38,485 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:38,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-30 20:08:38,485 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:38,558 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-30 20:08:38,558 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:38,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 20:08:38,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:08:38,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:08:38,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:08:38,559 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-30 20:08:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:41,960 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-30 20:08:41,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:08:41,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 20:08:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:41,962 INFO L225 Difference]: With dead ends: 1180 [2018-09-30 20:08:41,962 INFO L226 Difference]: Without dead ends: 1172 [2018-09-30 20:08:41,963 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-30 20:08:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-30 20:08:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-30 20:08:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-30 20:08:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-30 20:08:42,983 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-30 20:08:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:42,983 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-30 20:08:42,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:08:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-30 20:08:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:42,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:42,984 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:42,984 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:42,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-30 20:08:42,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:42,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:43,367 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-30 20:08:43,367 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:43,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 20:08:43,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:08:43,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:08:43,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:08:43,368 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-30 20:08:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:47,128 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-30 20:08:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:08:47,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 20:08:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:47,131 INFO L225 Difference]: With dead ends: 1233 [2018-09-30 20:08:47,131 INFO L226 Difference]: Without dead ends: 1225 [2018-09-30 20:08:47,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-30 20:08:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-30 20:08:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-30 20:08:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-30 20:08:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-30 20:08:48,304 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-30 20:08:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:48,304 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-30 20:08:48,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:08:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-30 20:08:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:48,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:48,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:48,305 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:48,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-30 20:08:48,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:48,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:48,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:48,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:48,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:48,379 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:48,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 20:08:48,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:08:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:08:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:08:48,380 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-30 20:08:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:52,762 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-09-30 20:08:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:08:52,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 20:08:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:52,764 INFO L225 Difference]: With dead ends: 1537 [2018-09-30 20:08:52,764 INFO L226 Difference]: Without dead ends: 1529 [2018-09-30 20:08:52,765 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-30 20:08:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-30 20:08:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-09-30 20:08:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-30 20:08:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-30 20:08:53,996 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-30 20:08:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:53,996 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-30 20:08:53,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:08:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-30 20:08:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:53,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:53,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:53,997 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:53,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:53,998 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-30 20:08:53,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:53,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:53,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:54,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:54,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 20:08:54,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:08:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:08:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:08:54,117 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-30 20:08:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:58,858 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-30 20:08:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:08:58,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 20:08:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:58,861 INFO L225 Difference]: With dead ends: 1590 [2018-09-30 20:08:58,861 INFO L226 Difference]: Without dead ends: 1582 [2018-09-30 20:08:58,862 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-30 20:08:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-30 20:09:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-30 20:09:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-30 20:09:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-30 20:09:00,138 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-30 20:09:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:00,138 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-30 20:09:00,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:09:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-30 20:09:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:00,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:00,139 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:00,139 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:00,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-30 20:09:00,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:00,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:00,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:00,213 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-30 20:09:00,213 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:00,213 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-30 20:09:00,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:00,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:00,377 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-30 20:09:00,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:00,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:09:00,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:09:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:09:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:09:00,400 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-09-30 20:09:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:10,526 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-09-30 20:09:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 20:09:10,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:09:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:10,528 INFO L225 Difference]: With dead ends: 1949 [2018-09-30 20:09:10,528 INFO L226 Difference]: Without dead ends: 1941 [2018-09-30 20:09:10,531 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-30 20:09:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-09-30 20:09:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-09-30 20:09:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-30 20:09:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-30 20:09:11,812 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-30 20:09:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:11,812 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-30 20:09:11,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:09:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-30 20:09:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:11,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:11,813 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:11,814 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-30 20:09:11,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:11,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:12,369 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:12,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 20:09:12,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:09:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:09:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:09:12,370 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-30 20:09:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:16,696 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-30 20:09:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:09:16,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 20:09:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:16,708 INFO L225 Difference]: With dead ends: 1420 [2018-09-30 20:09:16,708 INFO L226 Difference]: Without dead ends: 1412 [2018-09-30 20:09:16,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:09:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-30 20:09:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-30 20:09:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-30 20:09:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-30 20:09:17,869 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-30 20:09:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:17,869 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-30 20:09:17,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:09:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-30 20:09:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:17,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:17,870 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:17,870 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:17,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-30 20:09:17,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:17,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:17,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:17,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:17,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:17,940 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-30 20:09:17,940 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:17,940 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-30 20:09:17,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:17,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:18,079 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-30 20:09:18,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:18,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:09:18,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:09:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:09:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:09:18,102 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-09-30 20:09:29,327 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 20:09:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:31,281 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-09-30 20:09:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-30 20:09:31,282 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:09:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:31,285 INFO L225 Difference]: With dead ends: 2767 [2018-09-30 20:09:31,285 INFO L226 Difference]: Without dead ends: 2759 [2018-09-30 20:09:31,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:09:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-30 20:09:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-09-30 20:09:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-30 20:09:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-09-30 20:09:32,813 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-09-30 20:09:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:32,814 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-09-30 20:09:32,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:09:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-09-30 20:09:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:32,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:32,815 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:32,815 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:32,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:32,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-30 20:09:32,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:32,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:32,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:32,914 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-30 20:09:32,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:32,914 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-30 20:09:32,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:32,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:33,074 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-30 20:09:33,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:33,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:09:33,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:09:33,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:09:33,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:09:33,096 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-09-30 20:09:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:46,759 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-09-30 20:09:46,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 20:09:46,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:09:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:46,763 INFO L225 Difference]: With dead ends: 2361 [2018-09-30 20:09:46,763 INFO L226 Difference]: Without dead ends: 2353 [2018-09-30 20:09:46,766 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-30 20:09:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-09-30 20:09:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-09-30 20:09:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-09-30 20:09:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-09-30 20:09:48,421 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-09-30 20:09:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:48,422 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-09-30 20:09:48,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:09:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-09-30 20:09:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:09:48,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:48,422 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:48,423 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:48,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-30 20:09:48,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:48,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:48,500 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-30 20:09:48,501 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:48,501 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-30 20:09:48,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:48,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:48,604 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-30 20:09:48,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:48,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:09:48,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:09:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:09:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:09:48,625 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-09-30 20:09:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:51,508 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-09-30 20:09:51,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:09:51,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-09-30 20:09:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:51,510 INFO L225 Difference]: With dead ends: 1507 [2018-09-30 20:09:51,510 INFO L226 Difference]: Without dead ends: 1502 [2018-09-30 20:09:51,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:09:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-09-30 20:09:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-09-30 20:09:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-09-30 20:09:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-09-30 20:09:53,480 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-09-30 20:09:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:53,480 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-09-30 20:09:53,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:09:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-09-30 20:09:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:09:53,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:53,481 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:53,482 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:53,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-30 20:09:53,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:53,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:53,626 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-30 20:09:53,627 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:53,627 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-30 20:09:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:53,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:54,156 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-30 20:09:54,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:54,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-30 20:09:54,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 20:09:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 20:09:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:09:54,181 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-09-30 20:09:54,738 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-30 20:10:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:04,824 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-09-30 20:10:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:10:04,824 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-09-30 20:10:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:04,829 INFO L225 Difference]: With dead ends: 3654 [2018-09-30 20:10:04,829 INFO L226 Difference]: Without dead ends: 3646 [2018-09-30 20:10:04,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:10:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-09-30 20:10:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-09-30 20:10:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-30 20:10:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-09-30 20:10:07,748 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-09-30 20:10:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:07,748 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-09-30 20:10:07,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 20:10:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-09-30 20:10:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:10:07,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:07,749 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:07,749 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:07,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-30 20:10:07,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:07,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:07,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:07,914 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-30 20:10:07,915 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:07,915 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-30 20:10:07,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:07,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:07,971 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-30 20:10:07,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:07,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 20:10:07,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:10:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:10:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:10:07,994 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-09-30 20:10:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:13,811 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-09-30 20:10:13,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:10:13,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 20:10:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:13,815 INFO L225 Difference]: With dead ends: 2767 [2018-09-30 20:10:13,815 INFO L226 Difference]: Without dead ends: 2759 [2018-09-30 20:10:13,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:10:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-30 20:10:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-09-30 20:10:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-09-30 20:10:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-09-30 20:10:16,785 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-09-30 20:10:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:16,785 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-09-30 20:10:16,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:10:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-09-30 20:10:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:10:16,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:16,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:16,786 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:16,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-09-30 20:10:16,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:16,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:16,870 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-30 20:10:16,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:16,871 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-30 20:10:16,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:16,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:17,144 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-30 20:10:17,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:17,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 20:10:17,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:10:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:10:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:10:17,165 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-09-30 20:10:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:23,654 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-09-30 20:10:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:10:23,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 20:10:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:23,659 INFO L225 Difference]: With dead ends: 3146 [2018-09-30 20:10:23,659 INFO L226 Difference]: Without dead ends: 3138 [2018-09-30 20:10:23,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:10:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-30 20:10:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-09-30 20:10:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-09-30 20:10:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-09-30 20:10:26,580 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-09-30 20:10:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:26,580 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-09-30 20:10:26,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:10:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-09-30 20:10:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:10:26,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:26,581 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:26,582 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:26,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-30 20:10:26,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:26,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:26,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:26,667 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-30 20:10:26,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:26,668 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-30 20:10:26,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:26,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:26,741 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-30 20:10:26,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:26,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 20:10:26,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:10:26,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:10:26,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:10:26,763 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-09-30 20:10:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:33,642 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-09-30 20:10:33,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:10:33,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 20:10:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:33,647 INFO L225 Difference]: With dead ends: 3089 [2018-09-30 20:10:33,647 INFO L226 Difference]: Without dead ends: 3081 [2018-09-30 20:10:33,647 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-30 20:10:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-09-30 20:10:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-09-30 20:10:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-30 20:10:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-09-30 20:10:36,891 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-09-30 20:10:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:36,891 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-09-30 20:10:36,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:10:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-09-30 20:10:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:10:36,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:36,893 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-30 20:10:36,893 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:36,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-09-30 20:10:36,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:36,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:36,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:36,983 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-30 20:10:36,983 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:36,983 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-30 20:10:36,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:37,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:37,039 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-30 20:10:37,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:37,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 20:10:37,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:10:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:10:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:10:37,060 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. Received shutdown request... [2018-09-30 20:10:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:10:39,107 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:10:39,113 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:10:39,113 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:10:39 BoogieIcfgContainer [2018-09-30 20:10:39,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:10:39,114 INFO L168 Benchmark]: Toolchain (without parser) took 257985.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 659.0 MB). Free memory was 1.4 GB in the beginning and 905.1 MB in the end (delta: 536.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-30 20:10:39,115 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:39,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:39,116 INFO L168 Benchmark]: Boogie Preprocessor took 40.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:39,116 INFO L168 Benchmark]: RCFGBuilder took 1018.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:39,117 INFO L168 Benchmark]: TraceAbstraction took 256871.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 659.0 MB). Free memory was 1.4 GB in the beginning and 905.1 MB in the end (delta: 505.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-30 20:10:39,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1018.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256871.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 659.0 MB). Free memory was 1.4 GB in the beginning and 905.1 MB in the end (delta: 505.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 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 12 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (366 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 256.8s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 203.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13516 SDtfs, 45442 SDslu, 46650 SDs, 0 SdLazy, 95367 SolverSat, 9937 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 91.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1835 GetRequests, 327 SyntacticMatches, 4 SemanticMatches, 1504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25560 ImplicationChecksByTransitivity, 29.3s 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: 42.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 27176 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.9s 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-30_20-10-39-130.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-30_20-10-39-130.csv Completed graceful shutdown