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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:06:13,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:06:13,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:06:13,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:06:13,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:06:13,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:06:13,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:06:13,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:06:13,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:06:13,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:06:13,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:06:13,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:06:13,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:06:13,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:06:13,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:06:13,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:06:13,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:06:13,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:06:13,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:06:13,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:06:13,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:06:13,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:06:13,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:06:13,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:06:13,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:06:13,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:06:13,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:06:13,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:06:13,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:06:13,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:06:13,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:06:13,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:06:13,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:06:13,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:06:13,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:06:13,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:06:13,845 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:06:13,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:06:13,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:06:13,869 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:06:13,869 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:06:13,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:06:13,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:06:13,870 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:06:13,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:06:13,871 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:06:13,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:06:13,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:06:13,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:06:13,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:06:13,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:06:13,872 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:06:13,872 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:06:13,872 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:06:13,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:06:13,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:06:13,873 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:06:13,873 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:06:13,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:06:13,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:13,873 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:06:13,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:06:13,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:06:13,874 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:06:13,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:06:13,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:06:13,875 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:06:13,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:06:13,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:06:13,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:06:13,942 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:06:13,942 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:06:13,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-30 23:06:13,944 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-30 23:06:14,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:06:14,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:06:14,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:14,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:06:14,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:06:14,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,081 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 23:06:14,081 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 23:06:14,081 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 23:06:14,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:14,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:06:14,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:06:14,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:06:14,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... [2018-09-30 23:06:14,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:06:14,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:06:14,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:06:14,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:06:14,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:14,211 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 23:06:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 23:06:14,212 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 23:06:15,035 INFO L345 CfgBuilder]: Using library mode [2018-09-30 23:06:15,036 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:15 BoogieIcfgContainer [2018-09-30 23:06:15,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:06:15,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:06:15,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:06:15,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:06:15,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:14" (1/2) ... [2018-09-30 23:06:15,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d00785 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:06:15, skipping insertion in model container [2018-09-30 23:06:15,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:15" (2/2) ... [2018-09-30 23:06:15,044 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-30 23:06:15,053 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:06:15,062 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 23:06:15,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:06:15,114 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:06:15,114 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:06:15,114 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:06:15,115 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:06:15,115 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:06:15,115 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:06:15,115 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:06:15,115 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:06:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 23:06:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 23:06:15,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:15,144 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:15,146 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:15,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 23:06:15,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:15,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:15,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:15,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:15,509 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:15,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 23:06:15,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 23:06:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:06:15,533 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 23:06:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:17,330 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 23:06:17,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:06:17,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 23:06:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:17,349 INFO L225 Difference]: With dead ends: 163 [2018-09-30 23:06:17,349 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 23:06:17,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 23:06:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 23:06:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 23:06:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 23:06:17,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 23:06:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:17,413 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 23:06:17,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 23:06:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 23:06:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 23:06:17,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:17,415 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:17,416 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:17,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 23:06:17,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:17,553 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:17,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:17,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 23:06:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 23:06:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:06:17,555 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 23:06:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:18,518 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 23:06:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:06:18,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 23:06:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:18,527 INFO L225 Difference]: With dead ends: 188 [2018-09-30 23:06:18,529 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 23:06:18,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 23:06:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 23:06:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 23:06:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 23:06:18,572 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 23:06:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:18,573 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 23:06:18,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 23:06:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 23:06:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:06:18,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:18,575 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:18,575 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:18,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:18,576 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 23:06:18,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:18,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:18,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:18,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:18,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:06:18,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:06:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:06:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:06:18,695 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 23:06:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:20,420 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-30 23:06:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:06:20,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 23:06:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:20,425 INFO L225 Difference]: With dead ends: 361 [2018-09-30 23:06:20,426 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 23:06:20,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:06:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 23:06:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-30 23:06:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-30 23:06:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-30 23:06:20,464 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-30 23:06:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:20,465 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-30 23:06:20,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:06:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-30 23:06:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:06:20,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:20,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:20,467 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:20,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 23:06:20,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:20,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:20,575 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:20,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:06:20,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:06:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:06:20,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:06:20,576 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-30 23:06:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:21,812 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-30 23:06:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 23:06:21,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 23:06:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:21,817 INFO L225 Difference]: With dead ends: 307 [2018-09-30 23:06:21,817 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 23:06:21,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:06:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 23:06:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-30 23:06:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 23:06:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 23:06:21,859 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 23:06:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:21,859 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 23:06:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:06:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 23:06:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:21,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:21,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:21,862 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:21,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 23:06:21,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:21,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:22,561 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:22,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:22,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:22,563 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-30 23:06:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:27,315 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-30 23:06:27,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 23:06:27,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:27,322 INFO L225 Difference]: With dead ends: 741 [2018-09-30 23:06:27,322 INFO L226 Difference]: Without dead ends: 733 [2018-09-30 23:06:27,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-30 23:06:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-30 23:06:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-30 23:06:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-30 23:06:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-30 23:06:27,379 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-30 23:06:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:27,380 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-30 23:06:27,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-30 23:06:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:27,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:27,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:27,383 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:27,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 23:06:27,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:27,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:27,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:27,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:27,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:27,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:27,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:27,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:27,526 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-30 23:06:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:31,422 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-30 23:06:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 23:06:31,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:31,431 INFO L225 Difference]: With dead ends: 797 [2018-09-30 23:06:31,431 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 23:06:31,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-30 23:06:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 23:06:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-30 23:06:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-30 23:06:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-30 23:06:31,498 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-30 23:06:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:31,499 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-30 23:06:31,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-30 23:06:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:31,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:31,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:31,501 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:31,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 23:06:31,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:31,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:31,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:31,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:31,675 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:31,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:31,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:31,677 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-30 23:06:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:33,921 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-30 23:06:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:06:33,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:33,929 INFO L225 Difference]: With dead ends: 684 [2018-09-30 23:06:33,929 INFO L226 Difference]: Without dead ends: 676 [2018-09-30 23:06:33,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:06:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-30 23:06:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-30 23:06:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-30 23:06:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-30 23:06:33,997 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-30 23:06:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:33,997 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-30 23:06:33,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-30 23:06:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:33,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:33,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:33,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:33,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 23:06:34,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:34,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:34,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:34,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:34,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:34,106 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:34,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:34,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:34,107 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-30 23:06:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:35,452 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-30 23:06:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:06:35,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:35,457 INFO L225 Difference]: With dead ends: 605 [2018-09-30 23:06:35,458 INFO L226 Difference]: Without dead ends: 597 [2018-09-30 23:06:35,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:06:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-30 23:06:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-30 23:06:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-30 23:06:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-30 23:06:35,524 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-30 23:06:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:35,524 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-30 23:06:35,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-30 23:06:35,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:35,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:35,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:35,526 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:35,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:35,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-30 23:06:35,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:35,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:35,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:35,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:35,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:35,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:35,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:35,758 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-30 23:06:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:38,013 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-30 23:06:38,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:06:38,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:38,019 INFO L225 Difference]: With dead ends: 935 [2018-09-30 23:06:38,020 INFO L226 Difference]: Without dead ends: 927 [2018-09-30 23:06:38,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:06:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-30 23:06:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-30 23:06:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-30 23:06:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-30 23:06:38,111 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-30 23:06:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:38,111 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-30 23:06:38,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-30 23:06:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:38,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:38,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:38,113 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:38,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-30 23:06:38,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:38,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:38,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:38,191 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:38,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:38,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:38,192 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-30 23:06:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:40,351 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-30 23:06:40,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:06:40,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:40,358 INFO L225 Difference]: With dead ends: 923 [2018-09-30 23:06:40,358 INFO L226 Difference]: Without dead ends: 915 [2018-09-30 23:06:40,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:06:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-30 23:06:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-30 23:06:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 23:06:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-30 23:06:40,447 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-30 23:06:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:40,447 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-30 23:06:40,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-30 23:06:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:40,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:40,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:40,449 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:40,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-30 23:06:40,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:40,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:40,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:40,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:40,586 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:40,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:40,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:40,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:40,587 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-30 23:06:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:42,262 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-30 23:06:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:06:42,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:42,268 INFO L225 Difference]: With dead ends: 837 [2018-09-30 23:06:42,268 INFO L226 Difference]: Without dead ends: 829 [2018-09-30 23:06:42,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:06:42,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-30 23:06:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-30 23:06:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-30 23:06:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-30 23:06:42,379 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-30 23:06:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:42,380 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-30 23:06:42,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-30 23:06:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:42,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:42,381 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:42,382 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:42,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-30 23:06:42,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:42,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:42,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:42,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:42,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:42,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:42,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:42,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:42,674 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-30 23:06:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:45,186 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-30 23:06:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 23:06:45,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:45,196 INFO L225 Difference]: With dead ends: 996 [2018-09-30 23:06:45,196 INFO L226 Difference]: Without dead ends: 988 [2018-09-30 23:06:45,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 23:06:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-30 23:06:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-30 23:06:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 23:06:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 23:06:45,311 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 23:06:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:45,313 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 23:06:45,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 23:06:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:45,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:45,314 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:45,315 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:45,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-30 23:06:45,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:45,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:45,458 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:45,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:45,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:45,459 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 23:06:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:47,365 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-30 23:06:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 23:06:47,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:47,371 INFO L225 Difference]: With dead ends: 913 [2018-09-30 23:06:47,371 INFO L226 Difference]: Without dead ends: 905 [2018-09-30 23:06:47,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:06:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-30 23:06:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-30 23:06:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-30 23:06:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-30 23:06:47,498 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-30 23:06:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:47,498 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-30 23:06:47,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-30 23:06:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:47,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:47,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:47,500 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:47,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-30 23:06:47,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:47,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:47,579 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:47,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:47,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:47,580 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-30 23:06:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:49,427 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-30 23:06:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:06:49,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:06:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:49,434 INFO L225 Difference]: With dead ends: 886 [2018-09-30 23:06:49,434 INFO L226 Difference]: Without dead ends: 878 [2018-09-30 23:06:49,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:06:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-30 23:06:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-30 23:06:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-30 23:06:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-30 23:06:49,568 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-30 23:06:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:49,568 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-30 23:06:49,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-30 23:06:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:49,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:49,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:49,570 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:49,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 23:06:49,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:49,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:49,652 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:49,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:49,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:49,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:49,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:49,653 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-30 23:06:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:51,692 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-30 23:06:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:06:51,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:51,698 INFO L225 Difference]: With dead ends: 801 [2018-09-30 23:06:51,698 INFO L226 Difference]: Without dead ends: 793 [2018-09-30 23:06:51,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:06:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-30 23:06:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-30 23:06:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-30 23:06:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-30 23:06:51,846 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-30 23:06:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:51,846 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-30 23:06:51,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-30 23:06:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:51,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:51,847 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:51,848 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:51,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-30 23:06:51,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:51,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:51,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:51,943 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:51,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:51,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:51,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:51,945 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-30 23:06:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:54,602 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-30 23:06:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:06:54,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:54,609 INFO L225 Difference]: With dead ends: 962 [2018-09-30 23:06:54,609 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 23:06:54,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:06:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 23:06:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-30 23:06:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-30 23:06:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-30 23:06:54,846 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-30 23:06:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:54,847 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-30 23:06:54,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-30 23:06:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:54,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:54,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:54,849 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:54,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 23:06:54,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:54,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:55,142 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:55,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:55,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:55,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:55,144 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-30 23:06:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:57,557 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-30 23:06:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:06:57,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:57,563 INFO L225 Difference]: With dead ends: 1000 [2018-09-30 23:06:57,563 INFO L226 Difference]: Without dead ends: 992 [2018-09-30 23:06:57,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:06:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-30 23:06:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-30 23:06:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-30 23:06:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-30 23:06:57,748 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-30 23:06:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:57,749 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-30 23:06:57,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-30 23:06:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:57,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:57,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:57,750 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:57,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-30 23:06:57,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:57,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:57,832 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:57,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:57,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:57,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:57,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:57,833 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-30 23:07:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:00,716 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-30 23:07:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:07:00,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:00,722 INFO L225 Difference]: With dead ends: 1065 [2018-09-30 23:07:00,722 INFO L226 Difference]: Without dead ends: 1057 [2018-09-30 23:07:00,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:07:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-30 23:07:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-30 23:07:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-30 23:07:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-30 23:07:00,969 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-30 23:07:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:00,969 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-30 23:07:00,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-30 23:07:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:00,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:00,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:00,971 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:00,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-30 23:07:00,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:00,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:00,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:01,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:01,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:01,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:01,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:01,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:01,067 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-30 23:07:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:04,412 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-30 23:07:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 23:07:04,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:04,417 INFO L225 Difference]: With dead ends: 1227 [2018-09-30 23:07:04,417 INFO L226 Difference]: Without dead ends: 1219 [2018-09-30 23:07:04,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 23:07:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-30 23:07:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-30 23:07:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-30 23:07:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-30 23:07:04,617 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-30 23:07:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:04,617 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-30 23:07:04,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-30 23:07:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:04,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:04,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:04,618 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:04,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 23:07:04,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:04,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:04,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:04,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:04,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:04,707 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-30 23:07:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:07,610 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-30 23:07:07,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:07:07,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:07,615 INFO L225 Difference]: With dead ends: 1076 [2018-09-30 23:07:07,615 INFO L226 Difference]: Without dead ends: 1068 [2018-09-30 23:07:07,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:07:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-30 23:07:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-30 23:07:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 23:07:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-30 23:07:07,866 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-30 23:07:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:07,866 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-30 23:07:07,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-30 23:07:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:07,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:07,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:07,867 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:07,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-30 23:07:07,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:07,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:07,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:07,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:07,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:07,994 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-30 23:07:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:10,739 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-30 23:07:10,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:07:10,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:10,745 INFO L225 Difference]: With dead ends: 1111 [2018-09-30 23:07:10,745 INFO L226 Difference]: Without dead ends: 1103 [2018-09-30 23:07:10,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:07:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-30 23:07:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-30 23:07:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-30 23:07:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-30 23:07:11,052 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-30 23:07:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:11,052 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-30 23:07:11,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-30 23:07:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:11,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:11,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:11,054 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:11,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-30 23:07:11,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:11,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:11,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:11,132 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:11,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:11,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:11,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:11,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:11,133 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-30 23:07:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:14,654 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-30 23:07:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 23:07:14,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:14,663 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 23:07:14,663 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 23:07:14,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:07:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 23:07:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-30 23:07:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-30 23:07:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-30 23:07:15,003 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-30 23:07:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:15,004 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-30 23:07:15,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-30 23:07:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:15,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:15,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:15,005 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:15,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-30 23:07:15,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:15,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:15,101 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:15,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:15,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:15,102 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-30 23:07:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:18,941 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-30 23:07:18,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:07:18,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:18,951 INFO L225 Difference]: With dead ends: 1370 [2018-09-30 23:07:18,952 INFO L226 Difference]: Without dead ends: 1362 [2018-09-30 23:07:18,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:07:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-30 23:07:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-30 23:07:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-30 23:07:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-30 23:07:19,298 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-30 23:07:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:19,298 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-30 23:07:19,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-30 23:07:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:19,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:19,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:19,299 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:19,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 23:07:19,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:19,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:19,374 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:19,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:19,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:19,375 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-30 23:07:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:22,279 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-30 23:07:22,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:07:22,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:22,284 INFO L225 Difference]: With dead ends: 1298 [2018-09-30 23:07:22,284 INFO L226 Difference]: Without dead ends: 1290 [2018-09-30 23:07:22,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:07:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-30 23:07:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-30 23:07:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 23:07:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 23:07:22,710 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 23:07:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:22,710 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 23:07:22,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 23:07:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:07:22,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:22,711 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:22,711 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:22,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-30 23:07:22,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:22,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:22,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:22,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:07:22,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:07:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:07:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:07:22,902 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 23:07:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:23,784 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-30 23:07:23,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:07:23,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 23:07:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:23,787 INFO L225 Difference]: With dead ends: 1242 [2018-09-30 23:07:23,787 INFO L226 Difference]: Without dead ends: 673 [2018-09-30 23:07:23,790 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-09-30 23:07:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-30 23:07:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-30 23:07:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-30 23:07:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-30 23:07:24,252 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-30 23:07:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:24,253 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-30 23:07:24,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:07:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-30 23:07:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:07:24,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:24,254 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:24,254 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:24,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-30 23:07:24,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:24,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:24,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:24,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:24,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:24,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:07:24,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:07:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:24,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:07:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:25,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:07:25,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 23:07:25,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:07:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:07:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:07:25,166 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-30 23:07:26,318 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 23:07:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:29,677 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-30 23:07:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:07:29,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 23:07:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:29,680 INFO L225 Difference]: With dead ends: 854 [2018-09-30 23:07:29,680 INFO L226 Difference]: Without dead ends: 849 [2018-09-30 23:07:29,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:07:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-30 23:07:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-30 23:07:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 23:07:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-30 23:07:30,665 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-30 23:07:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:30,665 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-30 23:07:30,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:07:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-30 23:07:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:07:30,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:30,666 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:30,667 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:30,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-30 23:07:30,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:30,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:30,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:30,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:07:30,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:07:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:07:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:07:30,832 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-30 23:07:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:31,704 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-30 23:07:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:07:31,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 23:07:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:31,706 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 23:07:31,706 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 23:07:31,708 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-09-30 23:07:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 23:07:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-30 23:07:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 23:07:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 23:07:32,348 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 23:07:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:32,348 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 23:07:32,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:07:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 23:07:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:07:32,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:32,349 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:32,350 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:32,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-30 23:07:32,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:32,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:32,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:32,519 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:07:32,519 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:07:32,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:32,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:07:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:32,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:07:32,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:07:32,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:07:32,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:07:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:07:32,700 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-30 23:07:40,527 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-30 23:07:45,933 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-30 23:07:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:49,317 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-30 23:07:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 23:07:49,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:07:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:49,321 INFO L225 Difference]: With dead ends: 2011 [2018-09-30 23:07:49,321 INFO L226 Difference]: Without dead ends: 2003 [2018-09-30 23:07:49,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 23:07:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-30 23:07:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-30 23:07:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-30 23:07:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-30 23:07:50,520 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-30 23:07:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:50,521 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-30 23:07:50,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:07:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-30 23:07:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:07:50,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:50,522 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:50,522 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:50,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-30 23:07:50,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:50,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:50,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:50,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:07:50,609 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:07:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:50,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:07:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:50,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:07:50,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:07:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:07:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:07:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:07:50,802 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-30 23:08:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:03,684 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-30 23:08:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-30 23:08:03,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:08:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:03,691 INFO L225 Difference]: With dead ends: 2797 [2018-09-30 23:08:03,691 INFO L226 Difference]: Without dead ends: 2789 [2018-09-30 23:08:03,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 23:08:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-30 23:08:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-30 23:08:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-30 23:08:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-30 23:08:05,002 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-30 23:08:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:05,002 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-30 23:08:05,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:08:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-30 23:08:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:05,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:05,003 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:05,004 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:05,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-30 23:08:05,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:05,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:05,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:05,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:05,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:05,121 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:05,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:05,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:05,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:05,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:05,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:08:05,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:08:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:08:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:08:05,389 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-30 23:08:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:17,042 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-30 23:08:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-30 23:08:17,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:08:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:17,049 INFO L225 Difference]: With dead ends: 2492 [2018-09-30 23:08:17,049 INFO L226 Difference]: Without dead ends: 2484 [2018-09-30 23:08:17,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-09-30 23:08:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-30 23:08:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-30 23:08:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-30 23:08:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-30 23:08:18,773 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-30 23:08:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:18,774 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-30 23:08:18,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:08:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-30 23:08:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:18,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:18,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:18,775 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:18,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:18,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-30 23:08:18,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:18,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:18,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:18,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:18,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:18,858 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:18,858 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:18,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:18,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:19,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 23:08:19,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-30 23:08:19,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:08:19,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:08:19,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:08:19,056 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-30 23:08:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:35,823 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-30 23:08:35,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-30 23:08:35,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:08:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:35,830 INFO L225 Difference]: With dead ends: 3178 [2018-09-30 23:08:35,830 INFO L226 Difference]: Without dead ends: 3170 [2018-09-30 23:08:35,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-30 23:08:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-30 23:08:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-30 23:08:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-30 23:08:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-30 23:08:37,193 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-30 23:08:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:37,193 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-30 23:08:37,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:08:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-30 23:08:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:37,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:37,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:37,194 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:37,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-30 23:08:37,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:37,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:37,269 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:37,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:37,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:37,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 23:08:37,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-30 23:08:37,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:08:37,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:08:37,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:08:37,466 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-30 23:08:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:50,851 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-30 23:08:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-30 23:08:50,852 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:08:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:50,856 INFO L225 Difference]: With dead ends: 2638 [2018-09-30 23:08:50,857 INFO L226 Difference]: Without dead ends: 2630 [2018-09-30 23:08:50,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-30 23:08:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-30 23:08:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-30 23:08:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-30 23:08:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-30 23:08:52,495 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-30 23:08:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:52,495 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-30 23:08:52,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:08:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-30 23:08:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:52,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:52,496 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:52,497 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:52,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-30 23:08:52,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:52,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:52,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:52,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:52,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:52,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:52,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:52,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:52,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:08:52,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:08:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:08:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:08:52,794 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-30 23:09:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:06,242 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-30 23:09:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 23:09:06,243 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:09:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:06,246 INFO L225 Difference]: With dead ends: 2854 [2018-09-30 23:09:06,246 INFO L226 Difference]: Without dead ends: 2846 [2018-09-30 23:09:06,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 23:09:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-30 23:09:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-30 23:09:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-30 23:09:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-30 23:09:07,879 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-30 23:09:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:07,879 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-30 23:09:07,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:09:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-30 23:09:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:07,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:07,880 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:07,880 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:07,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-30 23:09:07,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:07,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:07,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:08,434 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:08,434 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:08,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:08,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:08,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:08,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:09:08,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:09:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:09:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:09:08,662 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-30 23:09:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:23,927 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-30 23:09:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-30 23:09:23,927 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:09:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:23,931 INFO L225 Difference]: With dead ends: 3363 [2018-09-30 23:09:23,931 INFO L226 Difference]: Without dead ends: 3355 [2018-09-30 23:09:23,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 23:09:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-30 23:09:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-30 23:09:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-30 23:09:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-30 23:09:25,694 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-30 23:09:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:25,694 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-30 23:09:25,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:09:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-30 23:09:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:25,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:25,695 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:25,695 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:25,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-30 23:09:25,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:25,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:25,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:25,999 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:25,999 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:26,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:26,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:26,172 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:26,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-30 23:09:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:09:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:09:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:09:26,173 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-30 23:09:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:42,739 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-30 23:09:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-30 23:09:42,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-30 23:09:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:42,743 INFO L225 Difference]: With dead ends: 2910 [2018-09-30 23:09:42,743 INFO L226 Difference]: Without dead ends: 2902 [2018-09-30 23:09:42,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 23:09:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-30 23:09:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-30 23:09:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-30 23:09:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-30 23:09:44,279 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-30 23:09:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:44,280 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-30 23:09:44,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 23:09:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-30 23:09:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:44,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:44,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:44,281 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:44,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-30 23:09:44,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:44,448 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:44,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:44,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:44,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:44,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:44,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:09:44,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:09:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:09:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:09:44,712 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-30 23:09:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:58,548 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-30 23:09:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 23:09:58,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:09:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:58,551 INFO L225 Difference]: With dead ends: 2474 [2018-09-30 23:09:58,551 INFO L226 Difference]: Without dead ends: 2466 [2018-09-30 23:09:58,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 23:09:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-30 23:09:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-30 23:09:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-30 23:09:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-30 23:09:59,853 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-30 23:09:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:59,853 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-30 23:09:59,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:09:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-30 23:09:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:59,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:59,854 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:59,855 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:59,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-30 23:09:59,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:59,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:59,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:09:59,935 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:59,935 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:59,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:09:59,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:59,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:09:59,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:09:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:09:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:09:59,974 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-30 23:10:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:03,497 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-30 23:10:03,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 23:10:03,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:03,500 INFO L225 Difference]: With dead ends: 1522 [2018-09-30 23:10:03,500 INFO L226 Difference]: Without dead ends: 1514 [2018-09-30 23:10:03,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:10:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-30 23:10:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-30 23:10:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-30 23:10:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-30 23:10:05,039 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-30 23:10:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:05,039 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-30 23:10:05,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-30 23:10:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:05,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:05,040 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:05,040 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:05,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-30 23:10:05,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:05,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:05,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:05,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:05,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:05,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:05,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:05,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:05,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:05,181 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-30 23:10:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:09,079 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-30 23:10:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:10:09,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:09,081 INFO L225 Difference]: With dead ends: 1661 [2018-09-30 23:10:09,081 INFO L226 Difference]: Without dead ends: 1653 [2018-09-30 23:10:09,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:10:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-30 23:10:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-30 23:10:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-30 23:10:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-30 23:10:10,548 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-30 23:10:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:10,548 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-30 23:10:10,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-30 23:10:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:10,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:10,549 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:10,549 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:10,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-30 23:10:10,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:10,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:10,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:10,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:10,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:11,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:11,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:11,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:11,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:11,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:11,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:11,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:11,257 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-30 23:10:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:16,015 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-30 23:10:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:10:16,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:16,018 INFO L225 Difference]: With dead ends: 1772 [2018-09-30 23:10:16,018 INFO L226 Difference]: Without dead ends: 1764 [2018-09-30 23:10:16,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:10:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-30 23:10:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-30 23:10:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-30 23:10:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-30 23:10:17,776 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-30 23:10:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:17,776 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-30 23:10:17,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-30 23:10:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:17,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:17,777 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:17,777 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:17,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-30 23:10:17,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:17,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:17,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:17,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:17,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:17,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:17,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:17,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:17,906 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-09-30 23:10:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:22,067 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-09-30 23:10:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:10:22,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:22,070 INFO L225 Difference]: With dead ends: 1789 [2018-09-30 23:10:22,070 INFO L226 Difference]: Without dead ends: 1781 [2018-09-30 23:10:22,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:10:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-09-30 23:10:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-09-30 23:10:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-09-30 23:10:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-09-30 23:10:23,796 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-09-30 23:10:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:23,796 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-09-30 23:10:23,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-09-30 23:10:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:23,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:23,797 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:23,797 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:23,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-09-30 23:10:23,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:23,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:23,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:23,878 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:23,878 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:23,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:23,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:23,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:23,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:23,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:23,917 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. [2018-09-30 23:10:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:28,920 INFO L93 Difference]: Finished difference Result 2013 states and 4457 transitions. [2018-09-30 23:10:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:10:28,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:28,923 INFO L225 Difference]: With dead ends: 2013 [2018-09-30 23:10:28,923 INFO L226 Difference]: Without dead ends: 2005 [2018-09-30 23:10:28,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:10:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-09-30 23:10:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1324. [2018-09-30 23:10:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-09-30 23:10:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3031 transitions. [2018-09-30 23:10:30,516 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3031 transitions. Word has length 16 [2018-09-30 23:10:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:30,516 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 3031 transitions. [2018-09-30 23:10:30,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3031 transitions. [2018-09-30 23:10:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:30,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:30,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:30,517 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:30,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-09-30 23:10:30,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:30,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:30,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:30,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:30,898 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:30,898 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:30,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:30,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:30,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:30,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:30,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:30,940 INFO L87 Difference]: Start difference. First operand 1324 states and 3031 transitions. Second operand 8 states. [2018-09-30 23:10:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:35,752 INFO L93 Difference]: Finished difference Result 1884 states and 4184 transitions. [2018-09-30 23:10:35,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:10:35,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:35,755 INFO L225 Difference]: With dead ends: 1884 [2018-09-30 23:10:35,755 INFO L226 Difference]: Without dead ends: 1876 [2018-09-30 23:10:35,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:10:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-09-30 23:10:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1338. [2018-09-30 23:10:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2018-09-30 23:10:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 3063 transitions. [2018-09-30 23:10:37,394 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 3063 transitions. Word has length 16 [2018-09-30 23:10:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:37,395 INFO L480 AbstractCegarLoop]: Abstraction has 1338 states and 3063 transitions. [2018-09-30 23:10:37,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 3063 transitions. [2018-09-30 23:10:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:37,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:37,395 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:37,396 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:37,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-09-30 23:10:37,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:37,462 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:37,462 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:37,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:37,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:37,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:37,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:37,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:37,504 INFO L87 Difference]: Start difference. First operand 1338 states and 3063 transitions. Second operand 8 states. [2018-09-30 23:10:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:41,201 INFO L93 Difference]: Finished difference Result 1644 states and 3666 transitions. [2018-09-30 23:10:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:10:41,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:41,203 INFO L225 Difference]: With dead ends: 1644 [2018-09-30 23:10:41,203 INFO L226 Difference]: Without dead ends: 1636 [2018-09-30 23:10:41,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:10:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2018-09-30 23:10:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1321. [2018-09-30 23:10:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2018-09-30 23:10:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 3020 transitions. [2018-09-30 23:10:42,846 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 3020 transitions. Word has length 16 [2018-09-30 23:10:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:42,846 INFO L480 AbstractCegarLoop]: Abstraction has 1321 states and 3020 transitions. [2018-09-30 23:10:42,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 3020 transitions. [2018-09-30 23:10:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:42,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:42,847 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:42,847 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:42,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-09-30 23:10:42,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:42,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:42,919 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:42,919 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:42,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:42,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:42,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:42,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:42,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:42,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:42,958 INFO L87 Difference]: Start difference. First operand 1321 states and 3020 transitions. Second operand 8 states. [2018-09-30 23:10:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:47,658 INFO L93 Difference]: Finished difference Result 1868 states and 4167 transitions. [2018-09-30 23:10:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:10:47,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:47,661 INFO L225 Difference]: With dead ends: 1868 [2018-09-30 23:10:47,661 INFO L226 Difference]: Without dead ends: 1860 [2018-09-30 23:10:47,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:10:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2018-09-30 23:10:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1300. [2018-09-30 23:10:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-09-30 23:10:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2975 transitions. [2018-09-30 23:10:49,266 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2975 transitions. Word has length 16 [2018-09-30 23:10:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:49,266 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 2975 transitions. [2018-09-30 23:10:49,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2975 transitions. [2018-09-30 23:10:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:49,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:49,267 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:49,267 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-09-30 23:10:49,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:49,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:49,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:49,388 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:49,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:49,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:49,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:49,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:49,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:49,446 INFO L87 Difference]: Start difference. First operand 1300 states and 2975 transitions. Second operand 8 states. [2018-09-30 23:10:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:54,415 INFO L93 Difference]: Finished difference Result 1963 states and 4379 transitions. [2018-09-30 23:10:54,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 23:10:54,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:54,418 INFO L225 Difference]: With dead ends: 1963 [2018-09-30 23:10:54,418 INFO L226 Difference]: Without dead ends: 1955 [2018-09-30 23:10:54,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-30 23:10:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-09-30 23:10:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1294. [2018-09-30 23:10:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2018-09-30 23:10:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2963 transitions. [2018-09-30 23:10:56,031 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2963 transitions. Word has length 16 [2018-09-30 23:10:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:56,031 INFO L480 AbstractCegarLoop]: Abstraction has 1294 states and 2963 transitions. [2018-09-30 23:10:56,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2963 transitions. [2018-09-30 23:10:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:10:56,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:56,032 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:56,032 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:56,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-09-30 23:10:56,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:56,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:56,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:56,092 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:56,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:56,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:56,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:56,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:56,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:10:56,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:56,131 INFO L87 Difference]: Start difference. First operand 1294 states and 2963 transitions. Second operand 8 states. [2018-09-30 23:10:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:59,923 INFO L93 Difference]: Finished difference Result 1586 states and 3547 transitions. [2018-09-30 23:10:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:10:59,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:10:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:59,925 INFO L225 Difference]: With dead ends: 1586 [2018-09-30 23:10:59,925 INFO L226 Difference]: Without dead ends: 1578 [2018-09-30 23:10:59,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:10:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2018-09-30 23:11:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1230. [2018-09-30 23:11:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-09-30 23:11:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2809 transitions. [2018-09-30 23:11:01,467 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2809 transitions. Word has length 16 [2018-09-30 23:11:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:01,468 INFO L480 AbstractCegarLoop]: Abstraction has 1230 states and 2809 transitions. [2018-09-30 23:11:01,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:11:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2809 transitions. [2018-09-30 23:11:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 23:11:01,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:01,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:01,469 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:01,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:01,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-09-30 23:11:01,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:01,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:01,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:01,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:01,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:01,592 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:01,592 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:01,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:01,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:01,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:01,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-30 23:11:01,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:11:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:11:01,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:11:01,748 INFO L87 Difference]: Start difference. First operand 1230 states and 2809 transitions. Second operand 18 states. [2018-09-30 23:11:01,909 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-09-30 23:11:02,601 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-30 23:11:02,947 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-09-30 23:11:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:15,709 INFO L93 Difference]: Finished difference Result 3844 states and 8615 transitions. [2018-09-30 23:11:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-30 23:11:15,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-30 23:11:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:15,713 INFO L225 Difference]: With dead ends: 3844 [2018-09-30 23:11:15,714 INFO L226 Difference]: Without dead ends: 3836 [2018-09-30 23:11:15,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1695, Invalid=5615, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 23:11:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2018-09-30 23:11:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 2181. [2018-09-30 23:11:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-09-30 23:11:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5032 transitions. [2018-09-30 23:11:18,926 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5032 transitions. Word has length 17 [2018-09-30 23:11:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:18,926 INFO L480 AbstractCegarLoop]: Abstraction has 2181 states and 5032 transitions. [2018-09-30 23:11:18,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 23:11:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5032 transitions. [2018-09-30 23:11:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:11:18,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:18,927 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:18,928 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:18,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 523391216, now seen corresponding path program 1 times [2018-09-30 23:11:18,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:19,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:19,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:19,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:19,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:19,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-09-30 23:11:19,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:11:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:11:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:11:19,202 INFO L87 Difference]: Start difference. First operand 2181 states and 5032 transitions. Second operand 14 states. [2018-09-30 23:11:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:34,811 INFO L93 Difference]: Finished difference Result 5886 states and 13337 transitions. [2018-09-30 23:11:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 23:11:34,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-30 23:11:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:34,817 INFO L225 Difference]: With dead ends: 5886 [2018-09-30 23:11:34,818 INFO L226 Difference]: Without dead ends: 5878 [2018-09-30 23:11:34,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=942, Invalid=3348, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 23:11:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2018-09-30 23:11:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 3157. [2018-09-30 23:11:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-09-30 23:11:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 7416 transitions. [2018-09-30 23:11:39,187 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 7416 transitions. Word has length 20 [2018-09-30 23:11:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:39,187 INFO L480 AbstractCegarLoop]: Abstraction has 3157 states and 7416 transitions. [2018-09-30 23:11:39,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:11:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 7416 transitions. [2018-09-30 23:11:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:11:39,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:39,188 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:39,188 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:39,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash 520590862, now seen corresponding path program 1 times [2018-09-30 23:11:39,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:39,299 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:39,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:39,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:39,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:39,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:39,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-09-30 23:11:39,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:11:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:11:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:11:39,409 INFO L87 Difference]: Start difference. First operand 3157 states and 7416 transitions. Second operand 14 states. [2018-09-30 23:11:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:55,541 INFO L93 Difference]: Finished difference Result 5901 states and 13371 transitions. [2018-09-30 23:11:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 23:11:55,541 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-30 23:11:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:55,547 INFO L225 Difference]: With dead ends: 5901 [2018-09-30 23:11:55,548 INFO L226 Difference]: Without dead ends: 5893 [2018-09-30 23:11:55,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=866, Invalid=2916, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 23:11:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-09-30 23:11:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3101. [2018-09-30 23:11:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2018-09-30 23:11:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7261 transitions. [2018-09-30 23:11:59,944 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7261 transitions. Word has length 20 [2018-09-30 23:11:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:59,944 INFO L480 AbstractCegarLoop]: Abstraction has 3101 states and 7261 transitions. [2018-09-30 23:11:59,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:11:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7261 transitions. [2018-09-30 23:11:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:11:59,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:59,945 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:59,946 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:59,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-09-30 23:11:59,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:59,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:59,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:59,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:00,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:12:00,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:12:00,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:00,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:12:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:12:00,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:12:00,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-09-30 23:12:00,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:12:00,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:12:00,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:12:00,135 INFO L87 Difference]: Start difference. First operand 3101 states and 7261 transitions. Second operand 14 states. [2018-09-30 23:12:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:14,602 INFO L93 Difference]: Finished difference Result 5075 states and 11387 transitions. [2018-09-30 23:12:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 23:12:14,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-30 23:12:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:14,608 INFO L225 Difference]: With dead ends: 5075 [2018-09-30 23:12:14,608 INFO L226 Difference]: Without dead ends: 5067 [2018-09-30 23:12:14,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=611, Invalid=1741, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 23:12:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-09-30 23:12:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 3178. [2018-09-30 23:12:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2018-09-30 23:12:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 7413 transitions. [2018-09-30 23:12:19,137 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 7413 transitions. Word has length 20 [2018-09-30 23:12:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:19,137 INFO L480 AbstractCegarLoop]: Abstraction has 3178 states and 7413 transitions. [2018-09-30 23:12:19,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:12:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 7413 transitions. [2018-09-30 23:12:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:12:19,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:19,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:19,139 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:19,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash -740478461, now seen corresponding path program 1 times [2018-09-30 23:12:19,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:19,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:19,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:12:19,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:12:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:19,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:12:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:12:19,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:12:19,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-09-30 23:12:19,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:12:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:12:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:12:19,375 INFO L87 Difference]: Start difference. First operand 3178 states and 7413 transitions. Second operand 14 states. [2018-09-30 23:12:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:34,920 INFO L93 Difference]: Finished difference Result 5795 states and 13131 transitions. [2018-09-30 23:12:34,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 23:12:34,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-30 23:12:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:34,927 INFO L225 Difference]: With dead ends: 5795 [2018-09-30 23:12:34,927 INFO L226 Difference]: Without dead ends: 5787 [2018-09-30 23:12:34,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=525, Invalid=2231, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 23:12:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2018-09-30 23:12:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 3418. [2018-09-30 23:12:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-09-30 23:12:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 7942 transitions. [2018-09-30 23:12:39,927 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 7942 transitions. Word has length 20 [2018-09-30 23:12:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:39,927 INFO L480 AbstractCegarLoop]: Abstraction has 3418 states and 7942 transitions. [2018-09-30 23:12:39,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:12:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 7942 transitions. [2018-09-30 23:12:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:12:39,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:39,930 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:39,930 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:39,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:39,930 INFO L82 PathProgramCache]: Analyzing trace with hash -743278815, now seen corresponding path program 1 times [2018-09-30 23:12:39,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:39,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:39,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:39,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:40,030 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:12:40,030 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:12:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:40,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:12:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:12:40,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:12:40,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-09-30 23:12:40,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:12:40,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:12:40,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:12:40,135 INFO L87 Difference]: Start difference. First operand 3418 states and 7942 transitions. Second operand 14 states. [2018-09-30 23:12:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:55,470 INFO L93 Difference]: Finished difference Result 5717 states and 12951 transitions. [2018-09-30 23:12:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 23:12:55,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-30 23:12:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:55,476 INFO L225 Difference]: With dead ends: 5717 [2018-09-30 23:12:55,476 INFO L226 Difference]: Without dead ends: 5709 [2018-09-30 23:12:55,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=501, Invalid=1949, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 23:12:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2018-09-30 23:13:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 3401. [2018-09-30 23:13:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-09-30 23:13:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 7902 transitions. [2018-09-30 23:13:00,573 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 7902 transitions. Word has length 20 [2018-09-30 23:13:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:00,573 INFO L480 AbstractCegarLoop]: Abstraction has 3401 states and 7902 transitions. [2018-09-30 23:13:00,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:13:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 7902 transitions. [2018-09-30 23:13:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:13:00,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:00,574 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:00,574 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:00,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:00,575 INFO L82 PathProgramCache]: Analyzing trace with hash -743176670, now seen corresponding path program 1 times [2018-09-30 23:13:00,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:00,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:00,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:00,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:00,666 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:00,666 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:00,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:00,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:00,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:00,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-09-30 23:13:00,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:13:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:13:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:13:00,790 INFO L87 Difference]: Start difference. First operand 3401 states and 7902 transitions. Second operand 14 states. [2018-09-30 23:13:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:13,983 INFO L93 Difference]: Finished difference Result 4907 states and 11065 transitions. [2018-09-30 23:13:13,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 23:13:13,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-09-30 23:13:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:13,989 INFO L225 Difference]: With dead ends: 4907 [2018-09-30 23:13:13,989 INFO L226 Difference]: Without dead ends: 4899 [2018-09-30 23:13:13,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1028, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 23:13:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2018-09-30 23:13:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3264. [2018-09-30 23:13:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2018-09-30 23:13:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 7570 transitions. [2018-09-30 23:13:19,019 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 7570 transitions. Word has length 20 [2018-09-30 23:13:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:19,020 INFO L480 AbstractCegarLoop]: Abstraction has 3264 states and 7570 transitions. [2018-09-30 23:13:19,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:13:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 7570 transitions. [2018-09-30 23:13:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:13:19,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:19,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:19,021 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:19,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash -245402134, now seen corresponding path program 1 times [2018-09-30 23:13:19,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:19,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:19,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:19,100 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:19,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:19,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:19,172 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:19,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:13:19,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:13:19,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:13:19,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:13:19,173 INFO L87 Difference]: Start difference. First operand 3264 states and 7570 transitions. Second operand 11 states. [2018-09-30 23:13:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:28,301 INFO L93 Difference]: Finished difference Result 3785 states and 8617 transitions. [2018-09-30 23:13:28,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:13:28,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:13:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:28,306 INFO L225 Difference]: With dead ends: 3785 [2018-09-30 23:13:28,306 INFO L226 Difference]: Without dead ends: 3777 [2018-09-30 23:13:28,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:13:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-09-30 23:13:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3318. [2018-09-30 23:13:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3318 states. [2018-09-30 23:13:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 7706 transitions. [2018-09-30 23:13:33,325 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 7706 transitions. Word has length 20 [2018-09-30 23:13:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:33,326 INFO L480 AbstractCegarLoop]: Abstraction has 3318 states and 7706 transitions. [2018-09-30 23:13:33,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:13:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 7706 transitions. [2018-09-30 23:13:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:13:33,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:33,327 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:33,327 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:33,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash -248202488, now seen corresponding path program 1 times [2018-09-30 23:13:33,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:33,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:33,457 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:33,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:33,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:33,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:33,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:33,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:13:33,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:13:33,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:13:33,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:13:33,532 INFO L87 Difference]: Start difference. First operand 3318 states and 7706 transitions. Second operand 11 states. [2018-09-30 23:13:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:43,315 INFO L93 Difference]: Finished difference Result 4067 states and 9262 transitions. [2018-09-30 23:13:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:13:43,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:13:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:43,320 INFO L225 Difference]: With dead ends: 4067 [2018-09-30 23:13:43,320 INFO L226 Difference]: Without dead ends: 4059 [2018-09-30 23:13:43,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:13:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2018-09-30 23:13:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3390. [2018-09-30 23:13:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-09-30 23:13:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 7874 transitions. [2018-09-30 23:13:48,654 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 7874 transitions. Word has length 20 [2018-09-30 23:13:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:48,654 INFO L480 AbstractCegarLoop]: Abstraction has 3390 states and 7874 transitions. [2018-09-30 23:13:48,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:13:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 7874 transitions. [2018-09-30 23:13:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:13:48,656 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:48,656 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:48,656 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:48,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash -248100343, now seen corresponding path program 1 times [2018-09-30 23:13:48,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:48,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:48,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:48,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:48,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:48,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:48,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:48,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:48,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:13:48,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:48,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:13:48,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:13:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:13:48,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:13:48,869 INFO L87 Difference]: Start difference. First operand 3390 states and 7874 transitions. Second operand 11 states. [2018-09-30 23:13:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:58,053 INFO L93 Difference]: Finished difference Result 3913 states and 8914 transitions. [2018-09-30 23:13:58,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:13:58,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:13:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:58,058 INFO L225 Difference]: With dead ends: 3913 [2018-09-30 23:13:58,058 INFO L226 Difference]: Without dead ends: 3905 [2018-09-30 23:13:58,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:13:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2018-09-30 23:14:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3398. [2018-09-30 23:14:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2018-09-30 23:14:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 7878 transitions. [2018-09-30 23:14:03,230 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 7878 transitions. Word has length 20 [2018-09-30 23:14:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:03,230 INFO L480 AbstractCegarLoop]: Abstraction has 3398 states and 7878 transitions. [2018-09-30 23:14:03,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:14:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 7878 transitions. [2018-09-30 23:14:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:14:03,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:03,231 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:03,232 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:03,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash 879416653, now seen corresponding path program 1 times [2018-09-30 23:14:03,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:03,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:03,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:03,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:14:03,760 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:14:03,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:14:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:03,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:14:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:14:04,076 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:14:04,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:14:04,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:14:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:14:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:14:04,077 INFO L87 Difference]: Start difference. First operand 3398 states and 7878 transitions. Second operand 11 states. [2018-09-30 23:14:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:13,779 INFO L93 Difference]: Finished difference Result 3927 states and 8941 transitions. [2018-09-30 23:14:13,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 23:14:13,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:14:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:13,784 INFO L225 Difference]: With dead ends: 3927 [2018-09-30 23:14:13,784 INFO L226 Difference]: Without dead ends: 3919 [2018-09-30 23:14:13,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:14:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-09-30 23:14:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3287. [2018-09-30 23:14:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3287 states. [2018-09-30 23:14:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 7609 transitions. [2018-09-30 23:14:18,991 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 7609 transitions. Word has length 20 [2018-09-30 23:14:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:18,991 INFO L480 AbstractCegarLoop]: Abstraction has 3287 states and 7609 transitions. [2018-09-30 23:14:18,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:14:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 7609 transitions. [2018-09-30 23:14:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:14:18,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:18,993 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:18,993 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:18,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash 879518798, now seen corresponding path program 1 times [2018-09-30 23:14:18,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:18,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:14:19,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:14:19,080 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:14:19,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:19,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:14:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:14:19,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:14:19,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:14:19,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:14:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:14:19,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:14:19,139 INFO L87 Difference]: Start difference. First operand 3287 states and 7609 transitions. Second operand 11 states. [2018-09-30 23:14:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:28,767 INFO L93 Difference]: Finished difference Result 3927 states and 8925 transitions. [2018-09-30 23:14:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:14:28,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:14:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:28,771 INFO L225 Difference]: With dead ends: 3927 [2018-09-30 23:14:28,772 INFO L226 Difference]: Without dead ends: 3919 [2018-09-30 23:14:28,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:14:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-09-30 23:14:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3255. [2018-09-30 23:14:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2018-09-30 23:14:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 7545 transitions. [2018-09-30 23:14:33,980 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 7545 transitions. Word has length 20 [2018-09-30 23:14:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:33,980 INFO L480 AbstractCegarLoop]: Abstraction has 3255 states and 7545 transitions. [2018-09-30 23:14:33,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:14:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 7545 transitions. [2018-09-30 23:14:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:14:33,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:33,981 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:33,981 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:33,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash 987368945, now seen corresponding path program 1 times [2018-09-30 23:14:33,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:33,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:14:34,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:14:34,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:14:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:34,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:14:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:14:34,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:14:34,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:14:34,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:14:34,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:14:34,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:14:34,237 INFO L87 Difference]: Start difference. First operand 3255 states and 7545 transitions. Second operand 11 states. [2018-09-30 23:14:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:43,546 INFO L93 Difference]: Finished difference Result 3749 states and 8537 transitions. [2018-09-30 23:14:43,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:14:43,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:14:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:43,550 INFO L225 Difference]: With dead ends: 3749 [2018-09-30 23:14:43,550 INFO L226 Difference]: Without dead ends: 3741 [2018-09-30 23:14:43,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:14:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2018-09-30 23:14:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3159. [2018-09-30 23:14:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2018-09-30 23:14:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 7307 transitions. [2018-09-30 23:14:48,707 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 7307 transitions. Word has length 20 [2018-09-30 23:14:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:48,708 INFO L480 AbstractCegarLoop]: Abstraction has 3159 states and 7307 transitions. [2018-09-30 23:14:48,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:14:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 7307 transitions. [2018-09-30 23:14:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 23:14:48,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:48,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:48,710 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:48,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 1 times [2018-09-30 23:14:48,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:48,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:48,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:48,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:48,853 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:14:48,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:14:48,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:48,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:14:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:48,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:14:48,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-09-30 23:14:48,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:14:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:14:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:14:48,976 INFO L87 Difference]: Start difference. First operand 3159 states and 7307 transitions. Second operand 16 states. [2018-09-30 23:15:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:15:12,085 INFO L93 Difference]: Finished difference Result 7375 states and 16617 transitions. [2018-09-30 23:15:12,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 23:15:12,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-09-30 23:15:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:15:12,092 INFO L225 Difference]: With dead ends: 7375 [2018-09-30 23:15:12,092 INFO L226 Difference]: Without dead ends: 7367 [2018-09-30 23:15:12,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=949, Invalid=4453, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 23:15:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2018-09-30 23:15:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 4599. [2018-09-30 23:15:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2018-09-30 23:15:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 10707 transitions. [2018-09-30 23:15:20,161 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 10707 transitions. Word has length 21 [2018-09-30 23:15:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:15:20,161 INFO L480 AbstractCegarLoop]: Abstraction has 4599 states and 10707 transitions. [2018-09-30 23:15:20,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:15:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 10707 transitions. [2018-09-30 23:15:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:15:20,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:15:20,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:15:20,163 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:15:20,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:15:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-09-30 23:15:20,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:15:20,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:15:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:20,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:15:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:15:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:15:20,319 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:15:20,319 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:15:20,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:15:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:15:20,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:15:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:15:20,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:15:20,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-09-30 23:15:20,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:15:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:15:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:15:20,491 INFO L87 Difference]: Start difference. First operand 4599 states and 10707 transitions. Second operand 18 states. [2018-09-30 23:15:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:15:52,352 INFO L93 Difference]: Finished difference Result 14286 states and 33130 transitions. [2018-09-30 23:15:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-30 23:15:52,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-09-30 23:15:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:15:52,363 INFO L225 Difference]: With dead ends: 14286 [2018-09-30 23:15:52,363 INFO L226 Difference]: Without dead ends: 9688 [2018-09-30 23:15:52,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4474 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1453, Invalid=11657, Unknown=0, NotChecked=0, Total=13110 [2018-09-30 23:15:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2018-09-30 23:16:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 5855. [2018-09-30 23:16:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5855 states. [2018-09-30 23:16:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 13668 transitions. [2018-09-30 23:16:03,501 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 13668 transitions. Word has length 24 [2018-09-30 23:16:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:03,501 INFO L480 AbstractCegarLoop]: Abstraction has 5855 states and 13668 transitions. [2018-09-30 23:16:03,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 23:16:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 13668 transitions. [2018-09-30 23:16:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:16:03,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:03,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:03,504 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:03,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 509499548, now seen corresponding path program 1 times [2018-09-30 23:16:03,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:03,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:03,935 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:16:03,935 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:16:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:03,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:16:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:04,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:16:04,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 23:16:04,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:16:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:16:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:16:04,135 INFO L87 Difference]: Start difference. First operand 5855 states and 13668 transitions. Second operand 19 states. [2018-09-30 23:16:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:16:39,847 INFO L93 Difference]: Finished difference Result 16129 states and 37112 transitions. [2018-09-30 23:16:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-30 23:16:39,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:16:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:16:39,859 INFO L225 Difference]: With dead ends: 16129 [2018-09-30 23:16:39,859 INFO L226 Difference]: Without dead ends: 10275 [2018-09-30 23:16:39,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3151 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1034, Invalid=9066, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 23:16:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-09-30 23:16:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 5769. [2018-09-30 23:16:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-09-30 23:16:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 13438 transitions. [2018-09-30 23:16:51,202 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 13438 transitions. Word has length 24 [2018-09-30 23:16:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:51,203 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 13438 transitions. [2018-09-30 23:16:51,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:16:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 13438 transitions. [2018-09-30 23:16:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:16:51,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:51,206 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:51,206 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:51,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1404455971, now seen corresponding path program 1 times [2018-09-30 23:16:51,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:51,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:51,329 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:16:51,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:16:51,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:51,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:16:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:51,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:16:51,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:16:51,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:16:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:16:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:16:51,530 INFO L87 Difference]: Start difference. First operand 5769 states and 13438 transitions. Second operand 19 states. [2018-09-30 23:17:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:17:22,666 INFO L93 Difference]: Finished difference Result 14938 states and 34438 transitions. [2018-09-30 23:17:22,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-30 23:17:22,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:17:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:17:22,677 INFO L225 Difference]: With dead ends: 14938 [2018-09-30 23:17:22,678 INFO L226 Difference]: Without dead ends: 9170 [2018-09-30 23:17:22,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=909, Invalid=7101, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 23:17:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9170 states. [2018-09-30 23:17:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9170 to 5949. [2018-09-30 23:17:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2018-09-30 23:17:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 13878 transitions. [2018-09-30 23:17:34,584 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 13878 transitions. Word has length 24 [2018-09-30 23:17:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:17:34,584 INFO L480 AbstractCegarLoop]: Abstraction has 5949 states and 13878 transitions. [2018-09-30 23:17:34,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:17:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 13878 transitions. [2018-09-30 23:17:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:17:34,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:17:34,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:17:34,587 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:17:34,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:17:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash -263596200, now seen corresponding path program 1 times [2018-09-30 23:17:34,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:17:34,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:17:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:34,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:17:35,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:17:35,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:17:35,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:35,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:17:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:17:35,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:17:35,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 23:17:35,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 23:17:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 23:17:35,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:17:35,346 INFO L87 Difference]: Start difference. First operand 5949 states and 13878 transitions. Second operand 20 states. [2018-09-30 23:18:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:18:03,687 INFO L93 Difference]: Finished difference Result 14210 states and 32884 transitions. [2018-09-30 23:18:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 23:18:03,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-09-30 23:18:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:18:03,697 INFO L225 Difference]: With dead ends: 14210 [2018-09-30 23:18:03,697 INFO L226 Difference]: Without dead ends: 8262 [2018-09-30 23:18:03,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=649, Invalid=4607, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 23:18:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8262 states. [2018-09-30 23:18:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8262 to 5994. [2018-09-30 23:18:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-09-30 23:18:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13948 transitions. [2018-09-30 23:18:15,590 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13948 transitions. Word has length 24 [2018-09-30 23:18:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:18:15,590 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13948 transitions. [2018-09-30 23:18:15,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 23:18:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13948 transitions. [2018-09-30 23:18:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:18:15,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:18:15,594 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:18:15,594 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:18:15,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:18:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash 792000147, now seen corresponding path program 1 times [2018-09-30 23:18:15,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:18:15,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:18:15,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:15,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:15,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:18:15,698 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:18:15,698 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:18:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:15,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:18:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:18:15,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:18:15,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:18:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:18:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:18:15,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:18:15,917 INFO L87 Difference]: Start difference. First operand 5994 states and 13948 transitions. Second operand 19 states. [2018-09-30 23:18:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:18:49,360 INFO L93 Difference]: Finished difference Result 17571 states and 41216 transitions. [2018-09-30 23:18:49,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 23:18:49,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:18:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:18:49,373 INFO L225 Difference]: With dead ends: 17571 [2018-09-30 23:18:49,373 INFO L226 Difference]: Without dead ends: 11578 [2018-09-30 23:18:49,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=619, Invalid=5387, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 23:18:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11578 states. [2018-09-30 23:19:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11578 to 6512. [2018-09-30 23:19:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2018-09-30 23:19:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 15245 transitions. [2018-09-30 23:19:02,043 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 15245 transitions. Word has length 24 [2018-09-30 23:19:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:19:02,043 INFO L480 AbstractCegarLoop]: Abstraction has 6512 states and 15245 transitions. [2018-09-30 23:19:02,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:19:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 15245 transitions. [2018-09-30 23:19:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:19:02,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:19:02,046 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:19:02,046 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:19:02,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:19:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2113109391, now seen corresponding path program 1 times [2018-09-30 23:19:02,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:19:02,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:19:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:02,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:02,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:19:02,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:19:02,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:02,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:19:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:02,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:19:02,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 23:19:02,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 23:19:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 23:19:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:19:02,389 INFO L87 Difference]: Start difference. First operand 6512 states and 15245 transitions. Second operand 20 states. [2018-09-30 23:19:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:19:42,538 INFO L93 Difference]: Finished difference Result 18960 states and 43981 transitions. [2018-09-30 23:19:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 23:19:42,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-09-30 23:19:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:19:42,552 INFO L225 Difference]: With dead ends: 18960 [2018-09-30 23:19:42,552 INFO L226 Difference]: Without dead ends: 12449 [2018-09-30 23:19:42,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=678, Invalid=5802, Unknown=0, NotChecked=0, Total=6480 [2018-09-30 23:19:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2018-09-30 23:19:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 6873. [2018-09-30 23:19:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6873 states. [2018-09-30 23:19:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6873 states to 6873 states and 16018 transitions. [2018-09-30 23:19:56,384 INFO L78 Accepts]: Start accepts. Automaton has 6873 states and 16018 transitions. Word has length 24 [2018-09-30 23:19:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:19:56,385 INFO L480 AbstractCegarLoop]: Abstraction has 6873 states and 16018 transitions. [2018-09-30 23:19:56,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 23:19:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6873 states and 16018 transitions. [2018-09-30 23:19:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:19:56,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:19:56,388 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:19:56,388 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:19:56,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:19:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1568457909, now seen corresponding path program 1 times [2018-09-30 23:19:56,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:19:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:19:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:19:56,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:19:56,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:19:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:56,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:19:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:56,809 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:19:56,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-09-30 23:19:56,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 23:19:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 23:19:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:19:56,810 INFO L87 Difference]: Start difference. First operand 6873 states and 16018 transitions. Second operand 18 states. Received shutdown request... [2018-09-30 23:20:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-30 23:20:08,109 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 23:20:08,114 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 23:20:08,115 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:20:08 BoogieIcfgContainer [2018-09-30 23:20:08,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:20:08,116 INFO L168 Benchmark]: Toolchain (without parser) took 834096.46 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -324.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-30 23:20:08,116 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:08,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.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-09-30 23:20:08,117 INFO L168 Benchmark]: Boogie Preprocessor took 43.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:08,117 INFO L168 Benchmark]: RCFGBuilder took 907.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 23:20:08,118 INFO L168 Benchmark]: TraceAbstraction took 833077.73 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -356.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-30 23:20:08,121 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.24 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.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 Preprocessor took 43.38 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 907.71 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 833077.73 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -356.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 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 (6873states) and FLOYD_HOARE automaton (currently 88 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (1163 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 833.0s OverallTime, 67 OverallIterations, 2 TraceHistogramMax, 636.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19417 SDtfs, 80818 SDslu, 91030 SDs, 0 SdLazy, 221667 SolverSat, 18076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 214.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3911 GetRequests, 833 SyntacticMatches, 23 SemanticMatches, 3055 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 78518 ImplicationChecksByTransitivity, 74.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6873occurred in iteration=66, 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: 178.9s AutomataMinimizationTime, 66 MinimizatonAttempts, 75758 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1824 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 1716 ConstructedInterpolants, 113 QuantifiedInterpolants, 155742 SizeOfPredicates, 235 NumberOfNonLiveVariables, 1883 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 108 InterpolantComputations, 28 PerfectInterpolantSequences, 95/307 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.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-20-08-420.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-20-08-420.csv Completed graceful shutdown