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-2eb0a67 [2018-10-03 08:34:59,868 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:34:59,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:34:59,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:34:59,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:34:59,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:34:59,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:34:59,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:34:59,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:34:59,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:34:59,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:34:59,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:34:59,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:34:59,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:34:59,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:34:59,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:34:59,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:34:59,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:34:59,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:34:59,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:34:59,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:34:59,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:34:59,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:34:59,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:34:59,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:34:59,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:34:59,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:34:59,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:34:59,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:34:59,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:34:59,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:34:59,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:34:59,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:34:59,931 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:34:59,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:34:59,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:34:59,933 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-10-03 08:34:59,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:34:59,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:34:59,963 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:34:59,964 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:34:59,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:34:59,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:34:59,965 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:34:59,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:34:59,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:34:59,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:34:59,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:34:59,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:34:59,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:34:59,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:34:59,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:34:59,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:34:59,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:34:59,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:34:59,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:34:59,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:34:59,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:34:59,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:34:59,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:34:59,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:34:59,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:34:59,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:34:59,970 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:34:59,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:34:59,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:34:59,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:35:00,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:35:00,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:35:00,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:35:00,049 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:35:00,049 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:35:00,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-10-03 08:35:00,050 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-03 08:35:00,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:35:00,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:35:00,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:35:00,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:35:00,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:35:00,151 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 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,167 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 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,186 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 08:35:00,187 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 08:35:00,187 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 08:35:00,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:35:00,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:35:00,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:35:00,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:35:00,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... [2018-10-03 08:35:00,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:35:00,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:35:00,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:35:00,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:35:00,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:35:00,337 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-03 08:35:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-03 08:35:00,338 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-03 08:35:01,131 INFO L337 CfgBuilder]: Using library mode [2018-10-03 08:35:01,132 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:35:01 BoogieIcfgContainer [2018-10-03 08:35:01,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:35:01,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:35:01,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:35:01,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:35:01,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:35:00" (1/2) ... [2018-10-03 08:35:01,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371e3ef and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:35:01, skipping insertion in model container [2018-10-03 08:35:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:35:01" (2/2) ... [2018-10-03 08:35:01,140 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-03 08:35:01,148 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:35:01,157 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-03 08:35:01,206 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:35:01,207 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:35:01,207 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:35:01,207 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:35:01,208 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:35:01,208 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:35:01,208 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:35:01,208 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:35:01,208 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:35:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-03 08:35:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:35:01,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:01,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:01,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:01,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-03 08:35:01,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:01,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:01,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:01,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-10-03 08:35:01,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:01,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:35:01,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:35:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:35:01,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:35:01,608 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-03 08:35:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:03,406 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-03 08:35:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:35:03,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-03 08:35:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:03,426 INFO L225 Difference]: With dead ends: 163 [2018-10-03 08:35:03,426 INFO L226 Difference]: Without dead ends: 158 [2018-10-03 08:35:03,429 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-10-03 08:35:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-03 08:35:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-03 08:35:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-03 08:35:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-03 08:35:03,489 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-03 08:35:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:03,490 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-03 08:35:03,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:35:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-03 08:35:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-03 08:35:03,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:03,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:03,492 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:03,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-03 08:35:03,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:03,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:03,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-10-03 08:35:03,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:03,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:35:03,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:35:03,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:35:03,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:35:03,760 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-03 08:35:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:04,635 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-03 08:35:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:35:04,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-03 08:35:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:04,638 INFO L225 Difference]: With dead ends: 188 [2018-10-03 08:35:04,639 INFO L226 Difference]: Without dead ends: 183 [2018-10-03 08:35:04,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-03 08:35:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-03 08:35:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-03 08:35:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-03 08:35:04,681 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-03 08:35:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:04,681 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-03 08:35:04,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:35:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-03 08:35:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 08:35:04,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:04,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:04,685 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:04,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-03 08:35:04,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:04,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:04,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:04,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:04,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:04,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:04,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 08:35:04,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:35:04,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:35:04,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:35:04,799 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-03 08:35:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:06,213 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-03 08:35:06,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:35:06,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-03 08:35:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:06,217 INFO L225 Difference]: With dead ends: 283 [2018-10-03 08:35:06,217 INFO L226 Difference]: Without dead ends: 278 [2018-10-03 08:35:06,218 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-10-03 08:35:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-03 08:35:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-03 08:35:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-03 08:35:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-03 08:35:06,250 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-03 08:35:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:06,250 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-03 08:35:06,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:35:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-03 08:35:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 08:35:06,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:06,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:06,253 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:06,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-03 08:35:06,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:06,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:06,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:06,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:06,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:06,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:06,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 08:35:06,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 08:35:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 08:35:06,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:35:06,447 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-03 08:35:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:08,275 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-03 08:35:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 08:35:08,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-03 08:35:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:08,281 INFO L225 Difference]: With dead ends: 387 [2018-10-03 08:35:08,281 INFO L226 Difference]: Without dead ends: 375 [2018-10-03 08:35:08,282 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-10-03 08:35:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-03 08:35:08,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-03 08:35:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-03 08:35:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-03 08:35:08,324 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-03 08:35:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:08,324 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-03 08:35:08,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 08:35:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-03 08:35:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:08,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:08,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:08,328 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:08,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-03 08:35:08,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:08,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:08,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:08,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:08,438 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-03 08:35:09,760 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-03 08:35:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:13,538 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-03 08:35:13,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:35:13,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:13,545 INFO L225 Difference]: With dead ends: 725 [2018-10-03 08:35:13,545 INFO L226 Difference]: Without dead ends: 717 [2018-10-03 08:35:13,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-03 08:35:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-03 08:35:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-03 08:35:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-03 08:35:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-03 08:35:13,611 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-03 08:35:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:13,611 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-03 08:35:13,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-03 08:35:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:13,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:13,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:13,614 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:13,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-03 08:35:13,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:13,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:13,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:13,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:13,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:13,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:13,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:13,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:13,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:13,719 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-03 08:35:16,304 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-03 08:35:17,041 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-03 08:35:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:19,510 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-03 08:35:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:35:19,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:19,519 INFO L225 Difference]: With dead ends: 1008 [2018-10-03 08:35:19,519 INFO L226 Difference]: Without dead ends: 1000 [2018-10-03 08:35:19,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:35:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-03 08:35:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-03 08:35:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-03 08:35:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-03 08:35:19,591 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-03 08:35:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:19,591 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-03 08:35:19,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-03 08:35:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:19,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:19,593 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:19,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:19,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:19,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-03 08:35:19,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:19,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:19,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:19,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:19,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:19,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:19,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:19,717 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-03 08:35:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:22,216 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-03 08:35:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-03 08:35:22,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:22,224 INFO L225 Difference]: With dead ends: 924 [2018-10-03 08:35:22,224 INFO L226 Difference]: Without dead ends: 916 [2018-10-03 08:35:22,226 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-10-03 08:35:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-03 08:35:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-03 08:35:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-03 08:35:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-03 08:35:22,311 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-03 08:35:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:22,311 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-03 08:35:22,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-03 08:35:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:22,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:22,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:22,313 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:22,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-03 08:35:22,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:22,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:22,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:22,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:22,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:22,482 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-03 08:35:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:24,481 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-03 08:35:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:35:24,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:24,487 INFO L225 Difference]: With dead ends: 791 [2018-10-03 08:35:24,488 INFO L226 Difference]: Without dead ends: 783 [2018-10-03 08:35:24,489 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-10-03 08:35:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-03 08:35:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-03 08:35:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-03 08:35:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-03 08:35:24,575 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-03 08:35:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:24,576 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-03 08:35:24,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-03 08:35:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:24,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:24,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:24,578 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:24,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-03 08:35:24,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:24,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:24,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:24,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:24,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:24,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:24,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:24,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:24,672 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-03 08:35:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:26,898 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-03 08:35:26,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:35:26,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:26,906 INFO L225 Difference]: With dead ends: 1040 [2018-10-03 08:35:26,906 INFO L226 Difference]: Without dead ends: 1032 [2018-10-03 08:35:26,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-03 08:35:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-03 08:35:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-03 08:35:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-03 08:35:27,029 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-03 08:35:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:27,030 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-03 08:35:27,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-03 08:35:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:27,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:27,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:27,032 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:27,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-03 08:35:27,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:27,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:27,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:27,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:27,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:27,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:27,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:27,118 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-03 08:35:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:29,910 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-03 08:35:29,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-03 08:35:29,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:29,918 INFO L225 Difference]: With dead ends: 1166 [2018-10-03 08:35:29,918 INFO L226 Difference]: Without dead ends: 1158 [2018-10-03 08:35:29,919 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-10-03 08:35:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-03 08:35:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-03 08:35:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-03 08:35:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-03 08:35:30,088 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-03 08:35:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:30,088 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-03 08:35:30,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-03 08:35:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:30,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:30,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:30,090 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:30,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-03 08:35:30,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:30,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:30,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:30,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:30,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:30,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:30,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:30,347 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-03 08:35:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:32,892 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-03 08:35:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:35:32,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:32,900 INFO L225 Difference]: With dead ends: 1127 [2018-10-03 08:35:32,901 INFO L226 Difference]: Without dead ends: 1119 [2018-10-03 08:35:32,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:35:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-03 08:35:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-03 08:35:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-03 08:35:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-03 08:35:33,063 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-03 08:35:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:33,063 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-03 08:35:33,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-03 08:35:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:33,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:33,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:33,065 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:33,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-03 08:35:33,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:33,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:33,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:33,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:33,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:33,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:33,207 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-03 08:35:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:35,670 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-03 08:35:35,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:35,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:35,677 INFO L225 Difference]: With dead ends: 975 [2018-10-03 08:35:35,677 INFO L226 Difference]: Without dead ends: 967 [2018-10-03 08:35:35,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:35:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-03 08:35:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-03 08:35:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-03 08:35:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-03 08:35:35,832 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-03 08:35:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:35,834 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-03 08:35:35,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-03 08:35:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:35,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:35,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:35,836 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:35,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-03 08:35:35,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:35,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:35,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:35,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:35,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:35,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:35,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:35,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:35,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:35,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:35,941 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-03 08:35:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:38,561 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-03 08:35:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:35:38,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:38,567 INFO L225 Difference]: With dead ends: 1011 [2018-10-03 08:35:38,567 INFO L226 Difference]: Without dead ends: 1003 [2018-10-03 08:35:38,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-10-03 08:35:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-03 08:35:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-03 08:35:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-03 08:35:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-03 08:35:38,730 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-03 08:35:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:38,730 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-03 08:35:38,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-03 08:35:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:38,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:38,731 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:38,731 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:38,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-03 08:35:38,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:38,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:38,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:38,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:38,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:38,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:35:38,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:35:38,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:35:38,815 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-03 08:35:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:40,968 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-03 08:35:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:35:40,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-03 08:35:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:40,973 INFO L225 Difference]: With dead ends: 859 [2018-10-03 08:35:40,973 INFO L226 Difference]: Without dead ends: 851 [2018-10-03 08:35:40,974 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-10-03 08:35:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-03 08:35:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-03 08:35:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-03 08:35:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-03 08:35:41,157 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-03 08:35:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:41,157 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-03 08:35:41,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:35:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-03 08:35:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:41,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:41,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:41,159 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:41,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-03 08:35:41,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:41,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:41,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:41,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:41,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:41,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:41,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:41,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:41,233 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-03 08:35:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:43,465 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-03 08:35:43,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:35:43,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:43,471 INFO L225 Difference]: With dead ends: 962 [2018-10-03 08:35:43,471 INFO L226 Difference]: Without dead ends: 954 [2018-10-03 08:35:43,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:35:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-03 08:35:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-03 08:35:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-03 08:35:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-03 08:35:43,717 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-03 08:35:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:43,717 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-03 08:35:43,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-03 08:35:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:43,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:43,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:43,718 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:43,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-03 08:35:43,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:43,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:43,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:43,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:43,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:43,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:43,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:43,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:43,789 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-03 08:35:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:46,538 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-03 08:35:46,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:35:46,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:46,545 INFO L225 Difference]: With dead ends: 1064 [2018-10-03 08:35:46,545 INFO L226 Difference]: Without dead ends: 1056 [2018-10-03 08:35:46,546 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-10-03 08:35:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-03 08:35:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-03 08:35:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-03 08:35:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-03 08:35:46,854 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-03 08:35:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:46,854 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-03 08:35:46,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-03 08:35:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:46,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:46,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:46,856 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:46,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-03 08:35:46,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:46,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:46,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:46,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:46,961 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-03 08:35:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:50,163 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-03 08:35:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:35:50,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:50,170 INFO L225 Difference]: With dead ends: 1241 [2018-10-03 08:35:50,170 INFO L226 Difference]: Without dead ends: 1233 [2018-10-03 08:35:50,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-03 08:35:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-03 08:35:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-03 08:35:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-03 08:35:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-03 08:35:50,534 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-03 08:35:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:50,534 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-03 08:35:50,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-03 08:35:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:50,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:50,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:50,536 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:50,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-03 08:35:50,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:50,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:50,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:50,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:50,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:50,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:50,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:50,613 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-03 08:35:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:52,950 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-03 08:35:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:35:52,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:52,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:52,956 INFO L225 Difference]: With dead ends: 1139 [2018-10-03 08:35:52,956 INFO L226 Difference]: Without dead ends: 1131 [2018-10-03 08:35:52,957 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-10-03 08:35:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-03 08:35:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-03 08:35:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-03 08:35:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-03 08:35:53,295 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-03 08:35:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:53,295 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-03 08:35:53,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-03 08:35:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:53,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:53,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:53,297 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:53,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-03 08:35:53,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:53,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:53,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:53,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:53,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:53,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:53,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:53,394 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-03 08:35:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:35:56,469 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-03 08:35:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:35:56,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:35:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:35:56,475 INFO L225 Difference]: With dead ends: 1325 [2018-10-03 08:35:56,475 INFO L226 Difference]: Without dead ends: 1317 [2018-10-03 08:35:56,476 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-10-03 08:35:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-03 08:35:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-03 08:35:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-03 08:35:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-03 08:35:56,800 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-03 08:35:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:35:56,800 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-03 08:35:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:35:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-03 08:35:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:35:56,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:35:56,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:35:56,802 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:35:56,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:35:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-03 08:35:56,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:35:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:35:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:56,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:35:56,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:35:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:35:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:35:56,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:35:56,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:35:56,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:35:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:35:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:35:56,870 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-03 08:36:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:00,293 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-03 08:36:00,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:36:00,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:36:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:00,299 INFO L225 Difference]: With dead ends: 1334 [2018-10-03 08:36:00,299 INFO L226 Difference]: Without dead ends: 1326 [2018-10-03 08:36:00,300 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-10-03 08:36:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-03 08:36:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-03 08:36:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-03 08:36:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-03 08:36:00,646 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-03 08:36:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:00,646 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-03 08:36:00,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-03 08:36:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:36:00,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:00,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:00,647 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:00,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-03 08:36:00,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:00,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:00,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:00,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:00,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:00,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:00,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:00,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:00,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:00,723 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-03 08:36:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:02,731 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-03 08:36:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:36:02,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:36:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:02,736 INFO L225 Difference]: With dead ends: 919 [2018-10-03 08:36:02,736 INFO L226 Difference]: Without dead ends: 911 [2018-10-03 08:36:02,737 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-10-03 08:36:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-03 08:36:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-03 08:36:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-03 08:36:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-03 08:36:03,117 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-03 08:36:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:03,117 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-03 08:36:03,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-03 08:36:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:36:03,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:03,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:03,118 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:03,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-03 08:36:03,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:03,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:03,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:03,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:03,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:03,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:03,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:03,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:03,212 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-03 08:36:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:05,909 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-03 08:36:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:36:05,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:36:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:05,917 INFO L225 Difference]: With dead ends: 1095 [2018-10-03 08:36:05,917 INFO L226 Difference]: Without dead ends: 1087 [2018-10-03 08:36:05,918 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-10-03 08:36:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-03 08:36:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-03 08:36:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-03 08:36:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-03 08:36:06,277 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-03 08:36:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-03 08:36:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-03 08:36:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:36:06,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:06,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:06,279 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:06,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-03 08:36:06,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:06,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:06,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:06,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:06,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:06,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:06,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:06,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:06,377 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-03 08:36:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:10,192 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-03 08:36:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:36:10,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:36:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:10,197 INFO L225 Difference]: With dead ends: 1304 [2018-10-03 08:36:10,197 INFO L226 Difference]: Without dead ends: 1296 [2018-10-03 08:36:10,198 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-10-03 08:36:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-03 08:36:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-03 08:36:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-03 08:36:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-03 08:36:10,577 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-03 08:36:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:10,578 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-03 08:36:10,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-03 08:36:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:36:10,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:10,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:10,579 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:10,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:10,580 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-03 08:36:10,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:10,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:10,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:10,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:10,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:10,660 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-03 08:36:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:13,966 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-03 08:36:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:36:13,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:36:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:13,970 INFO L225 Difference]: With dead ends: 1192 [2018-10-03 08:36:13,970 INFO L226 Difference]: Without dead ends: 1184 [2018-10-03 08:36:13,971 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-10-03 08:36:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-03 08:36:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-03 08:36:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-03 08:36:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-03 08:36:14,472 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-03 08:36:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:14,472 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-03 08:36:14,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-03 08:36:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:36:14,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:14,473 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:14,473 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:14,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-03 08:36:14,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:14,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:14,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:14,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:14,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:14,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:14,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:36:14,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:36:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:36:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:36:14,530 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-03 08:36:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:15,334 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-03 08:36:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:36:15,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-03 08:36:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:15,336 INFO L225 Difference]: With dead ends: 1139 [2018-10-03 08:36:15,336 INFO L226 Difference]: Without dead ends: 625 [2018-10-03 08:36:15,339 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-10-03 08:36:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-03 08:36:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-03 08:36:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-03 08:36:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-03 08:36:15,827 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-03 08:36:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:15,827 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-03 08:36:15,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:36:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-03 08:36:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:36:15,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:15,829 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:15,829 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:15,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-03 08:36:15,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:15,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:15,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:15,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:15,917 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:15,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:15,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:16,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:16,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-03 08:36:16,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:36:16,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:36:16,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:36:16,882 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-03 08:36:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:20,566 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-03 08:36:20,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 08:36:20,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-03 08:36:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:20,568 INFO L225 Difference]: With dead ends: 794 [2018-10-03 08:36:20,569 INFO L226 Difference]: Without dead ends: 789 [2018-10-03 08:36:20,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-03 08:36:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-03 08:36:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-03 08:36:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-03 08:36:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-03 08:36:21,266 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-03 08:36:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:21,266 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-03 08:36:21,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:36:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-03 08:36:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-03 08:36:21,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:21,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:21,267 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:21,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-03 08:36:21,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:21,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:21,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:21,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 08:36:21,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:36:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:36:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:36:21,373 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-03 08:36:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:22,794 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-03 08:36:22,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:36:22,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-03 08:36:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:22,796 INFO L225 Difference]: With dead ends: 1317 [2018-10-03 08:36:22,796 INFO L226 Difference]: Without dead ends: 729 [2018-10-03 08:36:22,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-03 08:36:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-03 08:36:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-03 08:36:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-03 08:36:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-03 08:36:23,436 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-03 08:36:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:23,436 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-03 08:36:23,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:36:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-03 08:36:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:23,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:23,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:23,437 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:23,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-03 08:36:23,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:23,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:23,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:23,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:23,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:23,634 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-03 08:36:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:27,011 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-03 08:36:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-03 08:36:27,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:27,014 INFO L225 Difference]: With dead ends: 1435 [2018-10-03 08:36:27,014 INFO L226 Difference]: Without dead ends: 1427 [2018-10-03 08:36:27,015 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-10-03 08:36:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-03 08:36:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-03 08:36:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-03 08:36:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-03 08:36:27,817 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-03 08:36:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:27,817 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-03 08:36:27,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-03 08:36:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:27,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:27,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:27,819 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:27,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-03 08:36:27,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:27,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:27,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:28,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:28,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:28,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:28,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:28,019 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-03 08:36:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:31,654 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-03 08:36:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:36:31,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:31,658 INFO L225 Difference]: With dead ends: 1599 [2018-10-03 08:36:31,658 INFO L226 Difference]: Without dead ends: 1591 [2018-10-03 08:36:31,659 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-10-03 08:36:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-03 08:36:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-03 08:36:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-03 08:36:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-03 08:36:32,515 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-03 08:36:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:32,515 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-03 08:36:32,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-03 08:36:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:32,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:32,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:32,517 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:32,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-03 08:36:32,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:32,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:32,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:32,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:32,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:32,600 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-03 08:36:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:35,771 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-03 08:36:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:36:35,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:35,776 INFO L225 Difference]: With dead ends: 1411 [2018-10-03 08:36:35,776 INFO L226 Difference]: Without dead ends: 1403 [2018-10-03 08:36:35,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:36:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-03 08:36:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-03 08:36:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-03 08:36:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-03 08:36:36,638 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-03 08:36:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:36,638 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-03 08:36:36,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-03 08:36:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:36,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:36,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:36,640 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:36,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:36,640 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-03 08:36:36,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:36,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:36,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:36,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:36,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:36,737 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-03 08:36:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:40,259 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-03 08:36:40,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:36:40,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:40,262 INFO L225 Difference]: With dead ends: 1490 [2018-10-03 08:36:40,262 INFO L226 Difference]: Without dead ends: 1482 [2018-10-03 08:36:40,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:36:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-03 08:36:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-03 08:36:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-03 08:36:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-03 08:36:41,194 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-03 08:36:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:41,194 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-03 08:36:41,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-03 08:36:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:41,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:41,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:41,195 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:41,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-03 08:36:41,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:41,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:41,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:41,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:41,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:41,272 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-03 08:36:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:44,689 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-03 08:36:44,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:36:44,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:44,691 INFO L225 Difference]: With dead ends: 1427 [2018-10-03 08:36:44,691 INFO L226 Difference]: Without dead ends: 1419 [2018-10-03 08:36:44,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:36:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-03 08:36:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-03 08:36:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-03 08:36:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-03 08:36:45,625 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-03 08:36:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:45,625 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-03 08:36:45,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-03 08:36:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:45,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:45,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:45,626 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:45,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-03 08:36:45,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:45,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:45,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:45,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:45,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:36:45,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:36:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 08:36:45,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:45,734 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-03 08:36:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:48,946 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-03 08:36:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 08:36:48,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:48,948 INFO L225 Difference]: With dead ends: 1306 [2018-10-03 08:36:48,949 INFO L226 Difference]: Without dead ends: 1298 [2018-10-03 08:36:48,950 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-10-03 08:36:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-03 08:36:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-03 08:36:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-03 08:36:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-03 08:36:50,003 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-03 08:36:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:50,003 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-03 08:36:50,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-03 08:36:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:50,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:50,004 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:50,004 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:50,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:50,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-03 08:36:50,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:50,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:50,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:50,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:50,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:50,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:50,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:50,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:50,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:50,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:36:50,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:50,141 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-03 08:36:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:53,296 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-03 08:36:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-03 08:36:53,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:53,298 INFO L225 Difference]: With dead ends: 1285 [2018-10-03 08:36:53,298 INFO L226 Difference]: Without dead ends: 1277 [2018-10-03 08:36:53,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:36:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-03 08:36:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-03 08:36:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-03 08:36:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-03 08:36:54,368 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-03 08:36:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:54,369 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-03 08:36:54,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-03 08:36:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:54,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:54,369 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:54,370 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:54,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-03 08:36:54,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:54,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:54,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:54,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:54,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:54,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:54,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:54,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:36:54,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:54,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:54,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:54,506 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-03 08:36:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:36:58,263 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-03 08:36:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:36:58,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:36:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:36:58,265 INFO L225 Difference]: With dead ends: 1518 [2018-10-03 08:36:58,265 INFO L226 Difference]: Without dead ends: 1510 [2018-10-03 08:36:58,266 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-10-03 08:36:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-03 08:36:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-03 08:36:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-03 08:36:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-03 08:36:59,240 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-03 08:36:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:36:59,240 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-03 08:36:59,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:36:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-03 08:36:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:36:59,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:36:59,241 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:36:59,241 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:36:59,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:36:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-03 08:36:59,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:36:59,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:36:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:36:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:59,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:36:59,489 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:36:59,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:36:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:36:59,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:36:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:36:59,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:36:59,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:36:59,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:36:59,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:36:59,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:36:59,527 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-03 08:37:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:03,215 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-03 08:37:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:37:03,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:37:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:03,217 INFO L225 Difference]: With dead ends: 1448 [2018-10-03 08:37:03,217 INFO L226 Difference]: Without dead ends: 1440 [2018-10-03 08:37:03,217 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-10-03 08:37:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-03 08:37:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-03 08:37:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-03 08:37:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-03 08:37:04,175 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-03 08:37:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:04,176 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-03 08:37:04,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:37:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-03 08:37:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:04,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:04,177 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:04,177 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:04,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-03 08:37:04,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:04,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:04,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:37:04,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:04,790 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-10-03 08:37:04,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:04,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:37:04,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:04,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-03 08:37:04,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:37:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:37:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:37:04,868 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-03 08:37:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:08,131 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-03 08:37:08,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:37:08,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-03 08:37:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:08,133 INFO L225 Difference]: With dead ends: 1254 [2018-10-03 08:37:08,133 INFO L226 Difference]: Without dead ends: 1246 [2018-10-03 08:37:08,133 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-10-03 08:37:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-03 08:37:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-03 08:37:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-03 08:37:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-03 08:37:09,072 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-03 08:37:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:09,072 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-03 08:37:09,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:37:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-03 08:37:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:09,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:09,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:09,074 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:09,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-03 08:37:09,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:09,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:09,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:09,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:09,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:09,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:09,152 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-10-03 08:37:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:09,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:09,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:09,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:37:09,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:37:09,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:37:09,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:37:09,488 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-03 08:37:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:15,336 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-03 08:37:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-03 08:37:15,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:37:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:15,338 INFO L225 Difference]: With dead ends: 1278 [2018-10-03 08:37:15,338 INFO L226 Difference]: Without dead ends: 1270 [2018-10-03 08:37:15,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:37:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-03 08:37:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-03 08:37:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-03 08:37:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-03 08:37:16,349 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-03 08:37:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:16,349 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-03 08:37:16,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:37:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-03 08:37:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:16,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:16,349 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:16,350 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:16,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-03 08:37:16,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:16,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:16,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:16,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:16,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:16,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:37:16,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-03 08:37:16,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:37:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:37:16,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:37:16,527 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-03 08:37:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:19,829 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-03 08:37:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:37:19,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-03 08:37:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:19,831 INFO L225 Difference]: With dead ends: 1180 [2018-10-03 08:37:19,831 INFO L226 Difference]: Without dead ends: 1172 [2018-10-03 08:37:19,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:37:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-03 08:37:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-03 08:37:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-03 08:37:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-03 08:37:20,831 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-03 08:37:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:20,832 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-03 08:37:20,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:37:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-03 08:37:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:20,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:20,832 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:20,833 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:20,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-03 08:37:20,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:20,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:20,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:20,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:21,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:37:21,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-03 08:37:21,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:37:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:37:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:37:21,364 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-03 08:37:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:25,149 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-03 08:37:25,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:37:25,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-03 08:37:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:25,151 INFO L225 Difference]: With dead ends: 1233 [2018-10-03 08:37:25,151 INFO L226 Difference]: Without dead ends: 1225 [2018-10-03 08:37:25,152 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-10-03 08:37:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-03 08:37:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-03 08:37:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-03 08:37:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-03 08:37:26,303 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-03 08:37:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:26,304 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-03 08:37:26,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:37:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-03 08:37:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:26,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:26,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:26,305 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:26,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-03 08:37:26,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:26,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:26,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:37:26,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-03 08:37:26,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:37:26,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:37:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:37:26,376 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-03 08:37:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:30,810 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-03 08:37:30,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:37:30,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-03 08:37:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:30,812 INFO L225 Difference]: With dead ends: 1537 [2018-10-03 08:37:30,812 INFO L226 Difference]: Without dead ends: 1529 [2018-10-03 08:37:30,812 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-10-03 08:37:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-03 08:37:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-03 08:37:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-03 08:37:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-03 08:37:31,974 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-03 08:37:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:31,974 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-03 08:37:31,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:37:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-03 08:37:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:31,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:31,975 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:31,975 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:31,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-03 08:37:31,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:32,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:37:32,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-03 08:37:32,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:37:32,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:37:32,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:37:32,063 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-03 08:37:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:36,640 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-03 08:37:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:37:36,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-03 08:37:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:36,642 INFO L225 Difference]: With dead ends: 1590 [2018-10-03 08:37:36,642 INFO L226 Difference]: Without dead ends: 1582 [2018-10-03 08:37:36,643 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-10-03 08:37:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-03 08:37:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-03 08:37:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-03 08:37:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-03 08:37:37,848 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-03 08:37:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:37,848 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-03 08:37:37,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:37:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-03 08:37:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:37,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:37,849 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:37,849 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:37,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-03 08:37:37,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:37,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:37,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:37,942 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-10-03 08:37:37,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:37,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:38,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:38,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:37:38,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:37:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:37:38,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:37:38,081 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-03 08:37:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:47,861 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-03 08:37:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-03 08:37:47,862 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:37:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:47,864 INFO L225 Difference]: With dead ends: 1949 [2018-10-03 08:37:47,864 INFO L226 Difference]: Without dead ends: 1941 [2018-10-03 08:37:47,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-10-03 08:37:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-03 08:37:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-03 08:37:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-03 08:37:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-03 08:37:49,106 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-03 08:37:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:49,106 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-03 08:37:49,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:37:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-03 08:37:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:49,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:49,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:49,107 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:49,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-03 08:37:49,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:49,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:49,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:49,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:49,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:49,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:37:49,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-03 08:37:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 08:37:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 08:37:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:37:49,516 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-03 08:37:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:37:53,843 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-03 08:37:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 08:37:53,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-03 08:37:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:37:53,846 INFO L225 Difference]: With dead ends: 1420 [2018-10-03 08:37:53,846 INFO L226 Difference]: Without dead ends: 1412 [2018-10-03 08:37:53,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:37:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-03 08:37:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-03 08:37:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-03 08:37:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-03 08:37:55,094 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-03 08:37:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:37:55,094 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-03 08:37:55,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 08:37:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-03 08:37:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:37:55,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:37:55,095 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:37:55,095 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:37:55,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:37:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-03 08:37:55,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:37:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:37:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:37:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:55,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:37:55,173 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-10-03 08:37:55,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:37:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:37:55,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:37:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:37:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:37:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:37:55,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:37:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:37:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:37:55,331 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-03 08:38:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:08,458 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-03 08:38:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-03 08:38:08,458 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:38:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:08,461 INFO L225 Difference]: With dead ends: 2767 [2018-10-03 08:38:08,461 INFO L226 Difference]: Without dead ends: 2759 [2018-10-03 08:38:08,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-10-03 08:38:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-03 08:38:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-03 08:38:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-03 08:38:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-03 08:38:09,940 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-03 08:38:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:09,940 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-03 08:38:09,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:38:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-03 08:38:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:38:09,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:09,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:09,942 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:09,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-03 08:38:09,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:09,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:10,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:10,052 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-10-03 08:38:10,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:10,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:10,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-03 08:38:10,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 08:38:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 08:38:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-03 08:38:10,203 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-03 08:38:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:23,814 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-03 08:38:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-03 08:38:23,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-03 08:38:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:23,816 INFO L225 Difference]: With dead ends: 2361 [2018-10-03 08:38:23,817 INFO L226 Difference]: Without dead ends: 2353 [2018-10-03 08:38:23,820 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-10-03 08:38:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-03 08:38:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-03 08:38:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-03 08:38:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-03 08:38:25,340 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-03 08:38:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:25,340 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-03 08:38:25,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 08:38:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-03 08:38:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:38:25,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:25,341 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:25,341 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:25,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-03 08:38:25,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:25,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:25,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:25,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:25,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:25,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:25,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-03 08:38:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:25,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:25,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-03 08:38:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:38:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:38:25,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:38:25,576 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-03 08:38:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:28,422 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-03 08:38:28,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 08:38:28,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-03 08:38:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:28,424 INFO L225 Difference]: With dead ends: 1507 [2018-10-03 08:38:28,424 INFO L226 Difference]: Without dead ends: 1502 [2018-10-03 08:38:28,424 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-10-03 08:38:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-03 08:38:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-03 08:38:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-03 08:38:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-03 08:38:30,361 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-03 08:38:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:30,362 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-03 08:38:30,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:38:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-03 08:38:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-03 08:38:30,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:30,363 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:30,363 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:30,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-03 08:38:30,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:30,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:30,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:30,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:30,499 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-10-03 08:38:30,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:30,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:38:30,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:30,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-03 08:38:30,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 08:38:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 08:38:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:38:30,961 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-03 08:38:31,521 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-03 08:38:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:41,569 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-10-03 08:38:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-03 08:38:41,570 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-03 08:38:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:41,574 INFO L225 Difference]: With dead ends: 3654 [2018-10-03 08:38:41,574 INFO L226 Difference]: Without dead ends: 3646 [2018-10-03 08:38:41,575 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-10-03 08:38:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-10-03 08:38:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-10-03 08:38:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-03 08:38:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-03 08:38:44,461 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-03 08:38:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:44,461 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-03 08:38:44,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 08:38:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-03 08:38:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 08:38:44,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:44,462 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:44,462 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:44,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-03 08:38:44,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:44,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:44,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:44,578 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-10-03 08:38:44,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:44,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:44,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:44,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-03 08:38:44,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:38:44,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:38:44,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:38:44,642 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-03 08:38:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:38:50,282 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-03 08:38:50,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:38:50,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-03 08:38:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:38:50,285 INFO L225 Difference]: With dead ends: 2767 [2018-10-03 08:38:50,286 INFO L226 Difference]: Without dead ends: 2759 [2018-10-03 08:38:50,286 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-10-03 08:38:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-03 08:38:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-03 08:38:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-03 08:38:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-03 08:38:53,347 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-03 08:38:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:38:53,347 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-03 08:38:53,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:38:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-03 08:38:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 08:38:53,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:38:53,349 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:38:53,349 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:38:53,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:38:53,349 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-03 08:38:53,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:38:53,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:38:53,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:53,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:53,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:38:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:53,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:38:53,443 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-10-03 08:38:53,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:38:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:38:53,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:38:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:38:53,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:38:53,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-03 08:38:53,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:38:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:38:53,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:38:53,640 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-03 08:39:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:39:00,058 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-03 08:39:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 08:39:00,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-03 08:39:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:39:00,062 INFO L225 Difference]: With dead ends: 3146 [2018-10-03 08:39:00,062 INFO L226 Difference]: Without dead ends: 3138 [2018-10-03 08:39:00,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:39:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-03 08:39:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-03 08:39:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-03 08:39:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-03 08:39:03,168 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-03 08:39:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:39:03,168 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-03 08:39:03,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:39:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-03 08:39:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 08:39:03,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:39:03,169 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:39:03,170 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:39:03,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:39:03,170 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-03 08:39:03,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:39:03,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:39:03,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:03,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:03,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:39:03,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:39:03,250 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-10-03 08:39:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:03,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:39:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:39:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:39:03,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-03 08:39:03,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:39:03,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:39:03,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:39:03,312 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-03 08:39:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:39:10,065 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-03 08:39:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 08:39:10,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-03 08:39:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:39:10,069 INFO L225 Difference]: With dead ends: 3089 [2018-10-03 08:39:10,070 INFO L226 Difference]: Without dead ends: 3081 [2018-10-03 08:39:10,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:39:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-03 08:39:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-03 08:39:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-03 08:39:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-03 08:39:13,021 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-03 08:39:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:39:13,022 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-03 08:39:13,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 08:39:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-03 08:39:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 08:39:13,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:39:13,023 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-10-03 08:39:13,024 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:39:13,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:39:13,024 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-03 08:39:13,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:39:13,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:39:13,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:13,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:13,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:39:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:39:13,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:39:13,126 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-10-03 08:39:13,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:39:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:39:13,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:39:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 08:39:13,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:39:13,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-03 08:39:13,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 08:39:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 08:39:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-03 08:39:13,215 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. Received shutdown request... [2018-10-03 08:39:19,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:39:19,205 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-03 08:39:19,211 WARN L205 ceAbstractionStarter]: Timeout [2018-10-03 08:39:19,211 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:39:19 BoogieIcfgContainer [2018-10-03 08:39:19,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:39:19,212 INFO L168 Benchmark]: Toolchain (without parser) took 259086.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 663.2 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -98.2 MB). Peak memory consumption was 565.0 MB. Max. memory is 7.1 GB. [2018-10-03 08:39:19,212 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:19,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:19,213 INFO L168 Benchmark]: Boogie Preprocessor took 60.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:39:19,213 INFO L168 Benchmark]: RCFGBuilder took 877.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:39:19,214 INFO L168 Benchmark]: TraceAbstraction took 258077.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 663.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -129.9 MB). Peak memory consumption was 533.3 MB. Max. memory is 7.1 GB. [2018-10-03 08:39:19,217 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.16 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 61.05 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 60.97 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 877.75 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 258077.63 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 663.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -129.9 MB). Peak memory consumption was 533.3 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 (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (2456 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 258.0s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 206.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13606 SDtfs, 45631 SDslu, 46876 SDs, 0 SdLazy, 95842 SolverSat, 9988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 327 SyntacticMatches, 4 SemanticMatches, 1509 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25597 ImplicationChecksByTransitivity, 28.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 41.0s AutomataMinimizationTime, 51 MinimizatonAttempts, 27176 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 47980 SizeOfPredicates, 77 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 67 InterpolantComputations, 37 PerfectInterpolantSequences, 43/111 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-39-19-227.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-10-03_08-39-19-227.csv Completed graceful shutdown