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-00a8621 [2018-09-30 10:14:44,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:14:44,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:14:44,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:14:44,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:14:44,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:14:44,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:14:44,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:14:44,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:14:44,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:14:44,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:14:44,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:14:44,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:14:44,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:14:44,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:14:44,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:14:44,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:14:44,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:14:44,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:14:44,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:14:44,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:14:44,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:14:44,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:14:44,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:14:44,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:14:44,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:14:44,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:14:44,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:14:44,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:14:44,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:14:44,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:14:44,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:14:44,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:14:44,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:14:44,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:14:44,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:14:44,839 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:14:44,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:14:44,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:14:44,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:14:44,866 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:14:44,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:14:44,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:14:44,868 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:14:44,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:14:44,869 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:14:44,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:14:44,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:14:44,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:14:44,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:14:44,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:14:44,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:14:44,871 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:14:44,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:14:44,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:14:44,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:14:44,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:14:44,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:14:44,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:14:44,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:44,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:14:44,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:14:44,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:14:44,874 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:14:44,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:14:44,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:14:44,875 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:14:44,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:14:44,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:14:44,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:14:44,963 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:14:44,964 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:14:44,965 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 10:14:44,965 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-30 10:14:45,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:14:45,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:14:45,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:45,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:14:45,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:14:45,091 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,107 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,113 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:14:45,114 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:14:45,114 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:14:45,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:45,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:14:45,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:14:45,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:14:45,130 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,130 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,140 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,141 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,156 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,168 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,175 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 10:14:45" (1/1) ... [2018-09-30 10:14:45,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:14:45,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:14:45,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:14:45,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:14:45,184 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 10:14:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:45,264 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:14:45,265 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:14:45,265 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:14:46,053 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:14:46,054 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:46 BoogieIcfgContainer [2018-09-30 10:14:46,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:14:46,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:14:46,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:14:46,059 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:14:46,059 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 10:14:45" (1/2) ... [2018-09-30 10:14:46,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37207836 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:14:46, skipping insertion in model container [2018-09-30 10:14:46,060 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 10:14:46" (2/2) ... [2018-09-30 10:14:46,063 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-30 10:14:46,073 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:14:46,082 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 10:14:46,134 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:14:46,135 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:14:46,135 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:14:46,135 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:14:46,135 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:14:46,136 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:14:46,136 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:14:46,136 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:14:46,136 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:14:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 10:14:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:14:46,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:46,164 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:46,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:46,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 10:14:46,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:46,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:46,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:46,489 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:46,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:14:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:14:46,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:14:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:14:46,513 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 10:14:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:48,336 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 10:14:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:14:48,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:14:48,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:48,358 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:14:48,358 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:14:48,362 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 10:14:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:14:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 10:14:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:14:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 10:14:48,431 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 10:14:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:48,431 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 10:14:48,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:14:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 10:14:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:14:48,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:48,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:48,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:48,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 10:14:48,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:48,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:48,577 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:48,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:14:48,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:14:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:14:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:14:48,580 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 10:14:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:49,392 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 10:14:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:14:49,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:14:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:49,397 INFO L225 Difference]: With dead ends: 188 [2018-09-30 10:14:49,398 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 10:14:49,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 10:14:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 10:14:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 10:14:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 10:14:49,425 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 10:14:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:49,426 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 10:14:49,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:14:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 10:14:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:49,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:49,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:49,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:49,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 10:14:49,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:49,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:49,528 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:49,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:14:49,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:14:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:14:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:49,531 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 10:14:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:50,552 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-30 10:14:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:14:50,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:14:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:50,557 INFO L225 Difference]: With dead ends: 283 [2018-09-30 10:14:50,557 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 10:14:50,559 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 10:14:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 10:14:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-30 10:14:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 10:14:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-30 10:14:50,590 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-30 10:14:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:50,590 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-30 10:14:50,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:14:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-30 10:14:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:50,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:50,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:50,593 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:50,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 10:14:50,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:50,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:50,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:50,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:50,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:50,787 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:50,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:14:50,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:14:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:14:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:50,788 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-30 10:14:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:53,003 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-30 10:14:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:14:53,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:14:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:53,008 INFO L225 Difference]: With dead ends: 387 [2018-09-30 10:14:53,008 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 10:14:53,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:14:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 10:14:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-30 10:14:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 10:14:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 10:14:53,050 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 10:14:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:53,050 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 10:14:53,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:14:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 10:14:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:53,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:53,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:53,054 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:53,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 10:14:53,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:53,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:53,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:53,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:53,448 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:53,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:53,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:14:53,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:14:53,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:53,449 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-30 10:14:54,766 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:56,817 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-30 10:14:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:14:56,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:14:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:56,825 INFO L225 Difference]: With dead ends: 725 [2018-09-30 10:14:56,825 INFO L226 Difference]: Without dead ends: 717 [2018-09-30 10:14:56,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:14:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-30 10:14:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-30 10:14:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 10:14:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-30 10:14:56,888 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-30 10:14:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:56,888 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-30 10:14:56,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:14:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-30 10:14:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:14:56,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:56,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:56,891 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:56,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 10:14:56,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:56,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:56,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:56,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:57,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:57,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:14:57,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:14:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:14:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:57,031 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-30 10:14:59,479 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 10:15:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:01,705 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-30 10:15:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:01,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:01,719 INFO L225 Difference]: With dead ends: 1008 [2018-09-30 10:15:01,719 INFO L226 Difference]: Without dead ends: 1000 [2018-09-30 10:15:01,721 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 10:15:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-30 10:15:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-30 10:15:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-30 10:15:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-30 10:15:01,798 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-30 10:15:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:01,799 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-30 10:15:01,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-30 10:15:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:01,800 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:01,800 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:01,801 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:01,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 10:15:01,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:01,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:01,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:01,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:01,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:01,949 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:01,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:01,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:01,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:01,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:01,951 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-30 10:15:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:04,647 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-30 10:15:04,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:15:04,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:04,654 INFO L225 Difference]: With dead ends: 924 [2018-09-30 10:15:04,654 INFO L226 Difference]: Without dead ends: 916 [2018-09-30 10:15:04,655 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 10:15:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-30 10:15:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-30 10:15:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 10:15:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-30 10:15:04,732 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-30 10:15:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:04,732 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-30 10:15:04,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-30 10:15:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:04,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:04,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:04,734 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:04,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 10:15:04,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:04,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:04,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:04,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:04,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:04,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:04,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:04,827 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-30 10:15:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:06,716 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-30 10:15:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:06,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:06,722 INFO L225 Difference]: With dead ends: 791 [2018-09-30 10:15:06,722 INFO L226 Difference]: Without dead ends: 783 [2018-09-30 10:15:06,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:15:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-30 10:15:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-30 10:15:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-30 10:15:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-30 10:15:06,824 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-30 10:15:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:06,825 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-30 10:15:06,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-30 10:15:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:06,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:06,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:06,827 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:06,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-30 10:15:06,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:06,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:06,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:06,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:06,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:06,919 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:06,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:06,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:06,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:06,921 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-30 10:15:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:09,292 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-30 10:15:09,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:15:09,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:09,299 INFO L225 Difference]: With dead ends: 1040 [2018-09-30 10:15:09,300 INFO L226 Difference]: Without dead ends: 1032 [2018-09-30 10:15:09,301 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 10:15:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-30 10:15:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-30 10:15:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-30 10:15:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-30 10:15:09,429 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-30 10:15:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:09,429 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-30 10:15:09,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-30 10:15:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:09,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:09,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:09,431 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:09,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-30 10:15:09,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:09,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:09,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:09,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:09,527 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:09,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:09,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:09,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:09,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:09,528 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-30 10:15:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:12,192 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-30 10:15:12,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:15:12,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:12,200 INFO L225 Difference]: With dead ends: 1166 [2018-09-30 10:15:12,200 INFO L226 Difference]: Without dead ends: 1158 [2018-09-30 10:15:12,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 10:15:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-30 10:15:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-30 10:15:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-30 10:15:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-30 10:15:12,375 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-30 10:15:12,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:12,376 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-30 10:15:12,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-30 10:15:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:12,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:12,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:12,377 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:12,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:12,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-30 10:15:12,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:12,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:12,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:12,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:12,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:12,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:12,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:12,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:12,827 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-30 10:15:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:15,507 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-30 10:15:15,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:15:15,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:15,514 INFO L225 Difference]: With dead ends: 1127 [2018-09-30 10:15:15,514 INFO L226 Difference]: Without dead ends: 1119 [2018-09-30 10:15:15,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:15:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-30 10:15:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-30 10:15:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-30 10:15:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-30 10:15:15,661 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-30 10:15:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:15,661 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-30 10:15:15,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-30 10:15:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:15,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:15,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:15,663 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:15,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:15,663 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-30 10:15:15,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:15,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:15,800 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:15,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:15,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:15,801 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-30 10:15:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:18,130 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-30 10:15:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:15:18,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:18,136 INFO L225 Difference]: With dead ends: 975 [2018-09-30 10:15:18,137 INFO L226 Difference]: Without dead ends: 967 [2018-09-30 10:15:18,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:15:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-30 10:15:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-30 10:15:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-30 10:15:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-30 10:15:18,297 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-30 10:15:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:18,299 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-30 10:15:18,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-30 10:15:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:18,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:18,301 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:18,301 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:18,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-30 10:15:18,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:18,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:18,387 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:18,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:18,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:18,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:18,388 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-30 10:15:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:21,156 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-30 10:15:21,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:15:21,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:21,161 INFO L225 Difference]: With dead ends: 1011 [2018-09-30 10:15:21,161 INFO L226 Difference]: Without dead ends: 1003 [2018-09-30 10:15:21,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:15:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-30 10:15:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-30 10:15:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-30 10:15:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-30 10:15:21,328 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-30 10:15:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:21,328 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-30 10:15:21,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-30 10:15:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:21,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:21,329 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:21,330 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:21,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-30 10:15:21,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:21,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:21,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:21,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:21,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:21,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:21,413 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-30 10:15:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:23,466 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-30 10:15:23,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:15:23,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:15:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:23,470 INFO L225 Difference]: With dead ends: 859 [2018-09-30 10:15:23,471 INFO L226 Difference]: Without dead ends: 851 [2018-09-30 10:15:23,471 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 10:15:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-30 10:15:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-30 10:15:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 10:15:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 10:15:23,658 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 10:15:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:23,658 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 10:15:23,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 10:15:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:23,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:23,659 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:23,660 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:23,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 10:15:23,660 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:23,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:23,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:23,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:23,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:23,757 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 10:15:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:26,222 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-30 10:15:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:15:26,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:26,227 INFO L225 Difference]: With dead ends: 962 [2018-09-30 10:15:26,227 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 10:15:26,227 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 10:15:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 10:15:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-30 10:15:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-30 10:15:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-30 10:15:26,458 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-30 10:15:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:26,459 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-30 10:15:26,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-30 10:15:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:26,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:26,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:26,460 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:26,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-30 10:15:26,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:26,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:26,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:26,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:26,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:26,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:26,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:26,550 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-30 10:15:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:29,091 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-30 10:15:29,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:15:29,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:29,098 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 10:15:29,098 INFO L226 Difference]: Without dead ends: 1056 [2018-09-30 10:15:29,099 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 10:15:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-30 10:15:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-30 10:15:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-30 10:15:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-30 10:15:29,408 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-30 10:15:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:29,408 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-30 10:15:29,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-30 10:15:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:29,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:29,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:29,410 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:29,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 10:15:29,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:29,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:29,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:29,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:29,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:29,506 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-30 10:15:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:32,649 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-30 10:15:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:15:32,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:32,655 INFO L225 Difference]: With dead ends: 1241 [2018-09-30 10:15:32,656 INFO L226 Difference]: Without dead ends: 1233 [2018-09-30 10:15:32,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:15:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-30 10:15:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-30 10:15:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 10:15:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-30 10:15:32,999 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-30 10:15:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:32,999 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-30 10:15:32,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-30 10:15:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:33,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:33,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:33,001 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:33,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:33,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-30 10:15:33,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:33,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:33,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:33,076 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:33,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:33,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:33,077 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-30 10:15:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:35,558 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-30 10:15:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:15:35,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:35,565 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 10:15:35,565 INFO L226 Difference]: Without dead ends: 1131 [2018-09-30 10:15:35,566 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 10:15:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-30 10:15:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-30 10:15:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-30 10:15:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-30 10:15:35,868 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-30 10:15:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:35,869 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-30 10:15:35,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-30 10:15:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:35,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:35,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:35,870 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:35,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-30 10:15:35,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:35,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:35,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:35,960 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:35,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:35,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:35,962 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-30 10:15:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:38,948 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-30 10:15:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:15:38,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:38,953 INFO L225 Difference]: With dead ends: 1325 [2018-09-30 10:15:38,953 INFO L226 Difference]: Without dead ends: 1317 [2018-09-30 10:15:38,954 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 10:15:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-30 10:15:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-30 10:15:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-30 10:15:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-30 10:15:39,267 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-30 10:15:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:39,267 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-30 10:15:39,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-30 10:15:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:39,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:39,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:39,269 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:39,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 10:15:39,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:39,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:39,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:39,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:39,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:39,372 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:39,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:39,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:39,373 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-30 10:15:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:42,687 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-30 10:15:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:42,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:42,693 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 10:15:42,693 INFO L226 Difference]: Without dead ends: 1326 [2018-09-30 10:15:42,694 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 10:15:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-30 10:15:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-30 10:15:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-30 10:15:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-30 10:15:43,031 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-30 10:15:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:43,031 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-30 10:15:43,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-30 10:15:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:43,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:43,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:43,032 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:43,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-30 10:15:43,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:43,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:43,104 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:43,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:43,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:43,105 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-30 10:15:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:45,163 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-30 10:15:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:15:45,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:45,168 INFO L225 Difference]: With dead ends: 919 [2018-09-30 10:15:45,168 INFO L226 Difference]: Without dead ends: 911 [2018-09-30 10:15:45,169 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 10:15:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-30 10:15:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-30 10:15:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 10:15:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-30 10:15:45,521 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-30 10:15:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:45,521 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-30 10:15:45,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-30 10:15:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:45,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:45,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:45,522 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:45,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-30 10:15:45,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:45,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:45,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:45,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:45,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:45,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:45,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:45,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:45,596 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-30 10:15:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:48,175 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-30 10:15:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:15:48,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:48,182 INFO L225 Difference]: With dead ends: 1095 [2018-09-30 10:15:48,182 INFO L226 Difference]: Without dead ends: 1087 [2018-09-30 10:15:48,183 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 10:15:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-30 10:15:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-30 10:15:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-30 10:15:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-30 10:15:48,527 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-30 10:15:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:48,527 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-30 10:15:48,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-30 10:15:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:48,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:48,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:48,529 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:48,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-30 10:15:48,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:48,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:48,597 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:48,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:48,598 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-30 10:15:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:52,392 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-30 10:15:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:15:52,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:52,396 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 10:15:52,397 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 10:15:52,397 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 10:15:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 10:15:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-30 10:15:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-30 10:15:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-30 10:15:52,743 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-30 10:15:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:52,743 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-30 10:15:52,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-30 10:15:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:52,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:52,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:52,745 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:52,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 10:15:52,745 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:52,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:52,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:52,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:52,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:52,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:52,819 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-30 10:15:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:56,110 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-30 10:15:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:15:56,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:15:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:56,114 INFO L225 Difference]: With dead ends: 1192 [2018-09-30 10:15:56,114 INFO L226 Difference]: Without dead ends: 1184 [2018-09-30 10:15:56,115 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 10:15:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-30 10:15:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-30 10:15:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 10:15:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 10:15:56,593 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 10:15:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:56,593 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 10:15:56,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 10:15:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:15:56,594 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:56,594 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:56,595 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:56,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-30 10:15:56,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:56,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:56,640 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 10:15:56,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:56,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:15:56,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:15:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:15:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:15:56,641 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 10:15:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:57,448 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-30 10:15:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:15:57,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:15:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:57,449 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 10:15:57,449 INFO L226 Difference]: Without dead ends: 625 [2018-09-30 10:15:57,451 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 10:15:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-30 10:15:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-30 10:15:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 10:15:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-30 10:15:57,906 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-30 10:15:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:57,906 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-30 10:15:57,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:15:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-30 10:15:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:15:57,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:57,907 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:57,908 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:57,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-30 10:15:57,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:57,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:57,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:58,090 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 10:15:58,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:58,090 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 10:15:58,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:58,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:59,279 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 10:15:59,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:59,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 10:15:59,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:15:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:15:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:59,311 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-30 10:16:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:02,544 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-30 10:16:02,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:16:02,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 10:16:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:02,546 INFO L225 Difference]: With dead ends: 794 [2018-09-30 10:16:02,546 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 10:16:02,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:16:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 10:16:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-30 10:16:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-30 10:16:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-30 10:16:03,221 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-30 10:16:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:03,222 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-30 10:16:03,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:16:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-30 10:16:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:16:03,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:03,222 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:03,223 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:03,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:03,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-30 10:16:03,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:03,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:03,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:03,278 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:03,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:16:03,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:16:03,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:16:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:16:03,279 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-30 10:16:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:04,610 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-30 10:16:04,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:16:04,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:16:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:04,612 INFO L225 Difference]: With dead ends: 1317 [2018-09-30 10:16:04,612 INFO L226 Difference]: Without dead ends: 729 [2018-09-30 10:16:04,614 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 10:16:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-30 10:16:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-30 10:16:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 10:16:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 10:16:05,272 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 10:16:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:05,272 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 10:16:05,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:16:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 10:16:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:05,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:05,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:05,274 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:05,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-30 10:16:05,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:05,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:05,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:05,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:05,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:16:05,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:05,477 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-30 10:16:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:08,811 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-30 10:16:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:16:08,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:08,814 INFO L225 Difference]: With dead ends: 1435 [2018-09-30 10:16:08,814 INFO L226 Difference]: Without dead ends: 1427 [2018-09-30 10:16:08,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:16:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-30 10:16:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-30 10:16:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 10:16:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-30 10:16:09,625 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-30 10:16:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:09,625 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-30 10:16:09,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-30 10:16:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:09,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:09,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:09,627 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:09,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-30 10:16:09,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:09,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:09,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:09,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:09,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:09,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:16:09,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:09,831 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-30 10:16:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:13,497 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-30 10:16:13,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:16:13,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:13,502 INFO L225 Difference]: With dead ends: 1599 [2018-09-30 10:16:13,502 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 10:16:13,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:16:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 10:16:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-30 10:16:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 10:16:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-30 10:16:14,290 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-30 10:16:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:14,290 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-30 10:16:14,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-30 10:16:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:14,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:14,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:14,292 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:14,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-30 10:16:14,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:14,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:14,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:14,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:14,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:14,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:16:14,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:14,378 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-30 10:16:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:17,591 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-30 10:16:17,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:16:17,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:17,597 INFO L225 Difference]: With dead ends: 1411 [2018-09-30 10:16:17,597 INFO L226 Difference]: Without dead ends: 1403 [2018-09-30 10:16:17,598 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 10:16:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-30 10:16:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-30 10:16:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-30 10:16:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-30 10:16:18,441 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-30 10:16:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:18,441 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-30 10:16:18,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-30 10:16:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:18,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:18,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:18,442 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:18,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-30 10:16:18,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:18,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:18,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:18,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:18,550 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:18,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:16:18,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:18,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:18,551 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-30 10:16:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:22,064 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-30 10:16:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:16:22,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:22,066 INFO L225 Difference]: With dead ends: 1490 [2018-09-30 10:16:22,066 INFO L226 Difference]: Without dead ends: 1482 [2018-09-30 10:16:22,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:16:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-30 10:16:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-30 10:16:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-30 10:16:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-30 10:16:22,883 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-30 10:16:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:22,884 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-30 10:16:22,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-30 10:16:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:22,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:22,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:22,885 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:22,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-30 10:16:22,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:22,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:22,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:16:22,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:22,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:22,988 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-30 10:16:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:26,360 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-30 10:16:26,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:16:26,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:26,363 INFO L225 Difference]: With dead ends: 1427 [2018-09-30 10:16:26,363 INFO L226 Difference]: Without dead ends: 1419 [2018-09-30 10:16:26,363 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 10:16:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-30 10:16:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-30 10:16:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-30 10:16:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-30 10:16:27,223 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-30 10:16:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:27,223 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-30 10:16:27,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-30 10:16:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:27,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:27,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:27,225 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-30 10:16:27,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:27,333 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:27,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:16:27,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:27,334 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-30 10:16:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:30,402 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-30 10:16:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:16:30,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:30,404 INFO L225 Difference]: With dead ends: 1306 [2018-09-30 10:16:30,404 INFO L226 Difference]: Without dead ends: 1298 [2018-09-30 10:16:30,405 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 10:16:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-30 10:16:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-30 10:16:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 10:16:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-30 10:16:31,389 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-30 10:16:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:31,389 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-30 10:16:31,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-30 10:16:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:31,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:31,390 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:31,390 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:31,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-30 10:16:31,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:31,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:31,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:31,459 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 10:16:31,460 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:31,460 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 10:16:31,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:31,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:31,479 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 10:16:31,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:31,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:16:31,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:31,501 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-30 10:16:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:34,502 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-30 10:16:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:16:34,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:34,504 INFO L225 Difference]: With dead ends: 1285 [2018-09-30 10:16:34,504 INFO L226 Difference]: Without dead ends: 1277 [2018-09-30 10:16:34,505 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 10:16:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-30 10:16:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-30 10:16:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 10:16:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-30 10:16:35,454 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-30 10:16:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:35,454 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-30 10:16:35,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-30 10:16:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:35,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:35,454 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:35,455 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:35,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-30 10:16:35,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:35,563 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 10:16:35,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:35,563 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 10:16:35,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:35,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:35,591 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 10:16:35,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:35,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:16:35,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:35,614 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-30 10:16:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:39,245 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-30 10:16:39,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:16:39,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:39,247 INFO L225 Difference]: With dead ends: 1518 [2018-09-30 10:16:39,247 INFO L226 Difference]: Without dead ends: 1510 [2018-09-30 10:16:39,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-30 10:16:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-30 10:16:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-30 10:16:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-30 10:16:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-30 10:16:40,220 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-30 10:16:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:40,221 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-30 10:16:40,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-30 10:16:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:40,221 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:40,221 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:40,222 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:40,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-30 10:16:40,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:40,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:40,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:40,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:40,555 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 10:16:40,556 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:40,556 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 10:16:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:40,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:40,588 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 10:16:40,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:40,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:16:40,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:40,617 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-30 10:16:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:44,188 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-30 10:16:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:16:44,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:44,190 INFO L225 Difference]: With dead ends: 1448 [2018-09-30 10:16:44,190 INFO L226 Difference]: Without dead ends: 1440 [2018-09-30 10:16:44,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:16:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-30 10:16:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-30 10:16:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-30 10:16:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-30 10:16:45,150 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-30 10:16:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:45,150 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-30 10:16:45,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-30 10:16:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:45,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:45,151 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:45,152 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:45,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-30 10:16:45,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:45,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:45,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:45,762 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 10:16:45,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:45,763 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 10:16:45,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:45,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:45,801 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 10:16:45,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:45,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:16:45,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:16:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:16:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:16:45,836 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-30 10:16:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:48,997 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-30 10:16:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:16:48,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:16:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:48,998 INFO L225 Difference]: With dead ends: 1254 [2018-09-30 10:16:48,999 INFO L226 Difference]: Without dead ends: 1246 [2018-09-30 10:16:48,999 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 10:16:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-30 10:16:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-30 10:16:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-30 10:16:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-30 10:16:49,923 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-30 10:16:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:49,923 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-30 10:16:49,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:16:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-30 10:16:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:49,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:49,925 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:49,925 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:49,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-30 10:16:49,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:49,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:49,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:49,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:49,994 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 10:16:49,994 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:49,994 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 10:16:50,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:50,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:50,180 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 10:16:50,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:50,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:16:50,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:16:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:16:50,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:16:50,203 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-09-30 10:16:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:56,010 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-09-30 10:16:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:16:56,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:16:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:56,012 INFO L225 Difference]: With dead ends: 1278 [2018-09-30 10:16:56,012 INFO L226 Difference]: Without dead ends: 1270 [2018-09-30 10:16:56,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 10:16:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-09-30 10:16:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-09-30 10:16:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-30 10:16:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-30 10:16:57,010 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-30 10:16:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:57,010 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-30 10:16:57,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:16:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-30 10:16:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:16:57,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:57,011 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:57,011 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:57,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-30 10:16:57,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:57,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:57,111 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 10:16:57,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:16:57,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 10:16:57,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:16:57,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:16:57,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:16:57,112 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-30 10:17:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:00,377 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-30 10:17:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:17:00,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 10:17:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:00,379 INFO L225 Difference]: With dead ends: 1180 [2018-09-30 10:17:00,379 INFO L226 Difference]: Without dead ends: 1172 [2018-09-30 10:17:00,379 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 10:17:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-30 10:17:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-30 10:17:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-30 10:17:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-30 10:17:01,392 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-30 10:17:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:01,393 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-30 10:17:01,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:17:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-30 10:17:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:01,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:01,393 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:01,393 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:01,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-30 10:17:01,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:01,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:01,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:01,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:01,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:01,923 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 10:17:01,923 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:01,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 10:17:01,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:17:01,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:17:01,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:17:01,924 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-30 10:17:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:05,527 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-30 10:17:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:17:05,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 10:17:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:05,530 INFO L225 Difference]: With dead ends: 1233 [2018-09-30 10:17:05,530 INFO L226 Difference]: Without dead ends: 1225 [2018-09-30 10:17:05,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-30 10:17:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-30 10:17:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-30 10:17:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-30 10:17:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-30 10:17:06,553 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-30 10:17:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:06,553 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-30 10:17:06,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:17:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-30 10:17:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:06,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:06,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:06,554 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:06,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-30 10:17:06,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:06,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:06,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:06,623 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:06,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 10:17:06,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:17:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:17:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:17:06,624 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-30 10:17:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:10,863 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-09-30 10:17:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:17:10,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 10:17:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:10,865 INFO L225 Difference]: With dead ends: 1537 [2018-09-30 10:17:10,865 INFO L226 Difference]: Without dead ends: 1529 [2018-09-30 10:17:10,865 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 10:17:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-30 10:17:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-09-30 10:17:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-30 10:17:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-30 10:17:11,965 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-30 10:17:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:11,966 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-30 10:17:11,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:17:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-30 10:17:11,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:11,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:11,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:11,967 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:11,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:11,967 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-30 10:17:11,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:11,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:12,052 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:12,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 10:17:12,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:17:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:17:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:17:12,053 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-30 10:17:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:16,610 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-30 10:17:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:17:16,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 10:17:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:16,613 INFO L225 Difference]: With dead ends: 1590 [2018-09-30 10:17:16,613 INFO L226 Difference]: Without dead ends: 1582 [2018-09-30 10:17:16,614 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 10:17:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-30 10:17:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-30 10:17:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-30 10:17:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-30 10:17:17,779 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-30 10:17:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:17,780 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-30 10:17:17,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:17:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-30 10:17:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:17,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:17,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:17,780 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:17,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-30 10:17:17,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:17,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:17,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:17,852 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 10:17:17,852 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:17,852 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 10:17:17,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:17,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:17,977 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 10:17:17,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:17,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:17:17,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:17,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:17,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:17,999 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-09-30 10:17:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:27,818 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-09-30 10:17:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 10:17:27,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:17:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:27,820 INFO L225 Difference]: With dead ends: 1949 [2018-09-30 10:17:27,820 INFO L226 Difference]: Without dead ends: 1941 [2018-09-30 10:17:27,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 10:17:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-09-30 10:17:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-09-30 10:17:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-30 10:17:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-30 10:17:28,958 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-30 10:17:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:28,959 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-30 10:17:28,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-30 10:17:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:28,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:28,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:28,960 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:28,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:28,960 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-30 10:17:28,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:28,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:29,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:17:29,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 10:17:29,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:17:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:17:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:17:29,224 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-30 10:17:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:33,477 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-30 10:17:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:17:33,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 10:17:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:33,480 INFO L225 Difference]: With dead ends: 1420 [2018-09-30 10:17:33,480 INFO L226 Difference]: Without dead ends: 1412 [2018-09-30 10:17:33,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:17:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-30 10:17:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-30 10:17:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-30 10:17:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-30 10:17:34,750 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-30 10:17:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:34,750 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-30 10:17:34,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:17:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-30 10:17:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:34,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:34,751 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:34,751 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:34,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-30 10:17:34,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:34,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:34,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:34,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:34,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:34,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:34,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:34,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:34,955 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 10:17:34,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:34,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:17:34,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:34,977 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-09-30 10:17:46,052 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 10:17:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:48,090 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-09-30 10:17:48,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-30 10:17:48,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:17:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:48,093 INFO L225 Difference]: With dead ends: 2767 [2018-09-30 10:17:48,093 INFO L226 Difference]: Without dead ends: 2759 [2018-09-30 10:17:48,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 10:17:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-30 10:17:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-09-30 10:17:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-30 10:17:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-09-30 10:17:49,447 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-09-30 10:17:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:49,448 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-09-30 10:17:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-09-30 10:17:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:17:49,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:49,449 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:49,449 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:49,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-30 10:17:49,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:49,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:49,532 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 10:17:49,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:49,532 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 10:17:49,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:49,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:49,671 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 10:17:49,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:49,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 10:17:49,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:49,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:49,694 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-09-30 10:18:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:03,327 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-09-30 10:18:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 10:18:03,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:18:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:03,330 INFO L225 Difference]: With dead ends: 2361 [2018-09-30 10:18:03,330 INFO L226 Difference]: Without dead ends: 2353 [2018-09-30 10:18:03,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 10:18:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-09-30 10:18:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-09-30 10:18:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-09-30 10:18:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-09-30 10:18:04,871 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-09-30 10:18:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:04,871 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-09-30 10:18:04,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:18:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-09-30 10:18:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:18:04,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:04,872 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 10:18:04,872 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:04,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-30 10:18:04,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:04,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:04,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:05,033 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 10:18:05,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:05,034 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 10:18:05,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:05,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:05,126 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 10:18:05,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:05,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 10:18:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:18:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:18:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:18:05,149 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-09-30 10:18:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:07,940 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-09-30 10:18:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:18:07,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-09-30 10:18:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:07,942 INFO L225 Difference]: With dead ends: 1507 [2018-09-30 10:18:07,942 INFO L226 Difference]: Without dead ends: 1502 [2018-09-30 10:18:07,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:18:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-09-30 10:18:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-09-30 10:18:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-09-30 10:18:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-09-30 10:18:09,754 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-09-30 10:18:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:09,754 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-09-30 10:18:09,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:18:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-09-30 10:18:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:18:09,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:09,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:09,756 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:09,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-30 10:18:09,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:09,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:09,861 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 10:18:09,862 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:09,862 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 10:18:09,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:09,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:10,351 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 10:18:10,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:10,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-30 10:18:10,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:18:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:18:10,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:18:10,374 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-09-30 10:18:10,862 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-30 10:18:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:20,737 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-09-30 10:18:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:18:20,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-09-30 10:18:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:20,740 INFO L225 Difference]: With dead ends: 3654 [2018-09-30 10:18:20,740 INFO L226 Difference]: Without dead ends: 3646 [2018-09-30 10:18:20,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:18:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-09-30 10:18:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-09-30 10:18:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-30 10:18:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-09-30 10:18:23,497 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-09-30 10:18:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:23,497 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-09-30 10:18:23,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:18:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-09-30 10:18:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:18:23,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:23,498 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:23,498 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:23,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-30 10:18:23,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:23,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:23,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:23,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:23,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:23,580 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 10:18:23,580 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:23,580 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 10:18:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:23,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:23,636 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 10:18:23,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:23,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 10:18:23,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:18:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:18:23,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:18:23,658 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-09-30 10:18:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:29,179 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-09-30 10:18:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:18:29,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 10:18:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:29,182 INFO L225 Difference]: With dead ends: 2767 [2018-09-30 10:18:29,182 INFO L226 Difference]: Without dead ends: 2759 [2018-09-30 10:18:29,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:18:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-30 10:18:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-09-30 10:18:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-09-30 10:18:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-09-30 10:18:32,050 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-09-30 10:18:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:32,050 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-09-30 10:18:32,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:18:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-09-30 10:18:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:18:32,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:32,051 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 10:18:32,051 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:32,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:32,052 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-09-30 10:18:32,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:32,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:32,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:32,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:32,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:32,521 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 10:18:32,521 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:32,521 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 10:18:32,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:32,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:32,571 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 10:18:32,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:32,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 10:18:32,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:18:32,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:18:32,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:18:32,593 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-09-30 10:18:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:38,976 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-09-30 10:18:38,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:18:38,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 10:18:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:38,980 INFO L225 Difference]: With dead ends: 3146 [2018-09-30 10:18:38,980 INFO L226 Difference]: Without dead ends: 3138 [2018-09-30 10:18:38,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:18:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-30 10:18:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-09-30 10:18:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-09-30 10:18:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-09-30 10:18:41,965 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-09-30 10:18:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:41,965 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-09-30 10:18:41,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:18:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-09-30 10:18:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:18:41,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:41,966 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 10:18:41,967 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:41,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:41,967 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-30 10:18:41,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:41,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:41,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:42,087 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 10:18:42,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:42,088 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 10:18:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:42,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:42,132 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 10:18:42,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:42,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 10:18:42,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:18:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:18:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:18:42,154 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-09-30 10:18:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:48,867 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-09-30 10:18:48,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:18:48,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 10:18:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:48,871 INFO L225 Difference]: With dead ends: 3089 [2018-09-30 10:18:48,871 INFO L226 Difference]: Without dead ends: 3081 [2018-09-30 10:18:48,871 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 10:18:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-09-30 10:18:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-09-30 10:18:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-30 10:18:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-09-30 10:18:51,753 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-09-30 10:18:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:51,753 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-09-30 10:18:51,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:18:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-09-30 10:18:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:18:51,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:51,755 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 10:18:51,755 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:51,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-09-30 10:18:51,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:51,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:51,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:51,900 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 10:18:51,900 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:51,900 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 10:18:51,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:51,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:51,980 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 10:18:52,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:52,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 10:18:52,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:18:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:18:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:18:52,001 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-09-30 10:18:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:58,496 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-09-30 10:18:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:18:58,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 10:18:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:58,500 INFO L225 Difference]: With dead ends: 3266 [2018-09-30 10:18:58,500 INFO L226 Difference]: Without dead ends: 3258 [2018-09-30 10:18:58,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:18:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-09-30 10:19:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-09-30 10:19:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-09-30 10:19:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-09-30 10:19:01,556 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-09-30 10:19:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:19:01,556 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-09-30 10:19:01,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:19:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-09-30 10:19:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:19:01,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:19:01,557 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 10:19:01,557 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:19:01,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:19:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-09-30 10:19:01,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:19:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:19:01,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:19:01,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:19:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:19:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:19:01,650 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 10:19:01,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:19:01,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:19:01,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:19:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:19:01,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:19:01,714 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 10:19:01,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:19:01,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 10:19:01,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:19:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:19:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:19:01,740 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. Received shutdown request... [2018-09-30 10:19:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:19:05,762 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:19:05,768 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:19:05,769 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:19:05 BoogieIcfgContainer [2018-09-30 10:19:05,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:19:05,770 INFO L168 Benchmark]: Toolchain (without parser) took 260704.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -167.0 MB). Peak memory consumption was 614.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:19:05,771 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:05,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:05,771 INFO L168 Benchmark]: Boogie Preprocessor took 64.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:05,772 INFO L168 Benchmark]: RCFGBuilder took 871.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:19:05,772 INFO L168 Benchmark]: TraceAbstraction took 259713.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -198.7 MB). Peak memory consumption was 583.0 MB. Max. memory is 7.1 GB. [2018-09-30 10:19:05,775 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 871.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259713.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -198.7 MB). Peak memory consumption was 583.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 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 (2328states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (917 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 259.6s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 205.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13855 SDtfs, 46149 SDslu, 47519 SDs, 0 SdLazy, 97243 SolverSat, 10103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1880 GetRequests, 344 SyntacticMatches, 5 SemanticMatches, 1531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25661 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2328occurred in iteration=52, 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.4s AutomataMinimizationTime, 52 MinimizatonAttempts, 28106 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 50298 SizeOfPredicates, 82 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 69 InterpolantComputations, 37 PerfectInterpolantSequences, 45/117 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_10-19-05-792.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_10-19-05-792.csv Completed graceful shutdown