java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 22:01:15,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 22:01:15,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 22:01:15,147 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 22:01:15,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 22:01:15,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 22:01:15,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 22:01:15,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 22:01:15,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 22:01:15,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 22:01:15,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 22:01:15,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 22:01:15,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 22:01:15,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 22:01:15,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 22:01:15,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 22:01:15,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 22:01:15,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 22:01:15,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 22:01:15,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 22:01:15,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 22:01:15,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 22:01:15,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 22:01:15,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 22:01:15,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 22:01:15,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 22:01:15,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 22:01:15,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 22:01:15,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 22:01:15,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 22:01:15,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 22:01:15,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 22:01:15,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 22:01:15,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 22:01:15,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 22:01:15,186 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 22:01:15,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 22:01:15,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 22:01:15,202 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 22:01:15,203 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 22:01:15,203 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 22:01:15,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 22:01:15,204 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 22:01:15,204 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 22:01:15,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 22:01:15,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 22:01:15,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 22:01:15,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 22:01:15,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:01:15,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 22:01:15,206 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 22:01:15,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 22:01:15,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 22:01:15,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 22:01:15,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 22:01:15,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 22:01:15,207 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 22:01:15,208 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 22:01:15,208 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 22:01:15,244 INFO ]: Repository-Root is: /tmp [2018-06-24 22:01:15,260 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 22:01:15,265 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 22:01:15,267 INFO ]: Initializing SmtParser... [2018-06-24 22:01:15,267 INFO ]: SmtParser initialized [2018-06-24 22:01:15,268 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-24 22:01:15,269 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 22:01:15,357 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2df7752c [2018-06-24 22:01:15,678 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-24 22:01:15,683 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 22:01:15,689 INFO ]: Walking toolchain with 5 elements. [2018-06-24 22:01:15,690 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 22:01:15,690 INFO ]: Initializing ChcToBoogie... [2018-06-24 22:01:15,690 INFO ]: ChcToBoogie initialized [2018-06-24 22:01:15,693 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,754 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15 Unit [2018-06-24 22:01:15,754 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 22:01:15,754 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 22:01:15,754 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 22:01:15,754 INFO ]: Boogie Preprocessor initialized [2018-06-24 22:01:15,774 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,774 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,786 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,787 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,804 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,816 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,818 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... [2018-06-24 22:01:15,820 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 22:01:15,821 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 22:01:15,821 INFO ]: Initializing RCFGBuilder... [2018-06-24 22:01:15,821 INFO ]: RCFGBuilder initialized [2018-06-24 22:01:15,822 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 22:01:15,836 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 22:01:15,836 INFO ]: Found specification of procedure gotoProc [2018-06-24 22:01:15,836 INFO ]: Found implementation of procedure gotoProc [2018-06-24 22:01:15,836 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 22:01:15,836 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 22:01:15,836 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 22:01:16,483 INFO ]: Using library mode [2018-06-24 22:01:16,483 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:01:16 BoogieIcfgContainer [2018-06-24 22:01:16,483 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 22:01:16,484 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 22:01:16,484 INFO ]: Initializing BlockEncodingV2... [2018-06-24 22:01:16,484 INFO ]: BlockEncodingV2 initialized [2018-06-24 22:01:16,486 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:01:16" (1/1) ... [2018-06-24 22:01:16,514 INFO ]: Initial Icfg 58 locations, 101 edges [2018-06-24 22:01:16,516 INFO ]: Using Remove infeasible edges [2018-06-24 22:01:16,517 INFO ]: Using Maximize final states [2018-06-24 22:01:16,517 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 22:01:16,517 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 22:01:16,519 INFO ]: Using Remove sink states [2018-06-24 22:01:16,520 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 22:01:16,520 INFO ]: Using Use SBE [2018-06-24 22:01:16,530 INFO ]: SBE split 0 edges [2018-06-24 22:01:16,536 INFO ]: Removed 7 edges and 2 locations because of local infeasibility [2018-06-24 22:01:16,538 INFO ]: 0 new accepting states [2018-06-24 22:01:16,953 INFO ]: Removed 55 edges and 15 locations by large block encoding [2018-06-24 22:01:16,955 INFO ]: Removed 7 edges and 4 locations by removing sink states [2018-06-24 22:01:16,958 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:01:16,958 INFO ]: 0 new accepting states [2018-06-24 22:01:17,028 INFO ]: Removed 4 edges and 1 locations by large block encoding [2018-06-24 22:01:17,028 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:01:17,029 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 22:01:17,029 INFO ]: 0 new accepting states [2018-06-24 22:01:17,029 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 22:01:17,030 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 22:01:17,030 INFO ]: Encoded RCFG 36 locations, 76 edges [2018-06-24 22:01:17,031 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:01:17 BasicIcfg [2018-06-24 22:01:17,031 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 22:01:17,033 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 22:01:17,033 INFO ]: Initializing TraceAbstraction... [2018-06-24 22:01:17,036 INFO ]: TraceAbstraction initialized [2018-06-24 22:01:17,037 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 10:01:15" (1/4) ... [2018-06-24 22:01:17,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff3f639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 10:01:17, skipping insertion in model container [2018-06-24 22:01:17,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 10:01:15" (2/4) ... [2018-06-24 22:01:17,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff3f639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 10:01:17, skipping insertion in model container [2018-06-24 22:01:17,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 10:01:16" (3/4) ... [2018-06-24 22:01:17,039 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff3f639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:01:17, skipping insertion in model container [2018-06-24 22:01:17,039 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 10:01:17" (4/4) ... [2018-06-24 22:01:17,042 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 22:01:17,052 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 22:01:17,060 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 22:01:17,098 INFO ]: Using default assertion order modulation [2018-06-24 22:01:17,098 INFO ]: Interprodecural is true [2018-06-24 22:01:17,098 INFO ]: Hoare is false [2018-06-24 22:01:17,098 INFO ]: Compute interpolants for FPandBP [2018-06-24 22:01:17,098 INFO ]: Backedges is TWOTRACK [2018-06-24 22:01:17,098 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 22:01:17,098 INFO ]: Difference is false [2018-06-24 22:01:17,098 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 22:01:17,098 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 22:01:17,107 INFO ]: Start isEmpty. Operand 36 states. [2018-06-24 22:01:17,129 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:01:17,129 INFO ]: Found error trace [2018-06-24 22:01:17,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:01:17,130 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:17,135 INFO ]: Analyzing trace with hash -1392530936, now seen corresponding path program 1 times [2018-06-24 22:01:17,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:17,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:17,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:17,171 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:17,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:17,215 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:17,320 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:17,324 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:17,324 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:17,326 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:17,341 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:17,342 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:17,345 INFO ]: Start difference. First operand 36 states. Second operand 3 states. [2018-06-24 22:01:17,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:17,723 INFO ]: Finished difference Result 57 states and 125 transitions. [2018-06-24 22:01:17,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:17,724 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:01:17,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:17,738 INFO ]: With dead ends: 57 [2018-06-24 22:01:17,738 INFO ]: Without dead ends: 55 [2018-06-24 22:01:17,739 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:17,753 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 22:01:17,785 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-24 22:01:17,786 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 22:01:17,789 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2018-06-24 22:01:17,790 INFO ]: Start accepts. Automaton has 55 states and 119 transitions. Word has length 6 [2018-06-24 22:01:17,791 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:17,791 INFO ]: Abstraction has 55 states and 119 transitions. [2018-06-24 22:01:17,791 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:17,791 INFO ]: Start isEmpty. Operand 55 states and 119 transitions. [2018-06-24 22:01:17,797 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:01:17,797 INFO ]: Found error trace [2018-06-24 22:01:17,797 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:01:17,797 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:17,797 INFO ]: Analyzing trace with hash -1390743476, now seen corresponding path program 1 times [2018-06-24 22:01:17,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:17,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:17,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:17,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:17,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:17,808 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:17,876 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:17,876 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:17,876 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:17,878 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:17,878 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:17,878 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:17,878 INFO ]: Start difference. First operand 55 states and 119 transitions. Second operand 3 states. [2018-06-24 22:01:18,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:18,641 INFO ]: Finished difference Result 76 states and 170 transitions. [2018-06-24 22:01:18,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:18,642 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 22:01:18,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:18,646 INFO ]: With dead ends: 76 [2018-06-24 22:01:18,646 INFO ]: Without dead ends: 76 [2018-06-24 22:01:18,646 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:18,647 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 22:01:18,668 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-24 22:01:18,668 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-24 22:01:18,670 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 170 transitions. [2018-06-24 22:01:18,670 INFO ]: Start accepts. Automaton has 76 states and 170 transitions. Word has length 6 [2018-06-24 22:01:18,670 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:18,670 INFO ]: Abstraction has 76 states and 170 transitions. [2018-06-24 22:01:18,670 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:18,670 INFO ]: Start isEmpty. Operand 76 states and 170 transitions. [2018-06-24 22:01:18,676 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:01:18,676 INFO ]: Found error trace [2018-06-24 22:01:18,676 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:01:18,676 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:18,676 INFO ]: Analyzing trace with hash -1388896434, now seen corresponding path program 1 times [2018-06-24 22:01:18,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:18,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:18,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:18,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:18,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:18,706 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:18,767 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:18,767 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:18,767 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 22:01:18,767 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:01:18,767 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:01:18,767 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:18,768 INFO ]: Start difference. First operand 76 states and 170 transitions. Second operand 4 states. [2018-06-24 22:01:18,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:18,848 INFO ]: Finished difference Result 91 states and 218 transitions. [2018-06-24 22:01:18,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:01:18,848 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 22:01:18,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:18,855 INFO ]: With dead ends: 91 [2018-06-24 22:01:18,855 INFO ]: Without dead ends: 91 [2018-06-24 22:01:18,855 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:18,855 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-24 22:01:18,877 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-06-24 22:01:18,877 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 22:01:18,884 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 179 transitions. [2018-06-24 22:01:18,884 INFO ]: Start accepts. Automaton has 82 states and 179 transitions. Word has length 6 [2018-06-24 22:01:18,884 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:18,884 INFO ]: Abstraction has 82 states and 179 transitions. [2018-06-24 22:01:18,884 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:01:18,884 INFO ]: Start isEmpty. Operand 82 states and 179 transitions. [2018-06-24 22:01:18,890 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 22:01:18,891 INFO ]: Found error trace [2018-06-24 22:01:18,891 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 22:01:18,891 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:18,891 INFO ]: Analyzing trace with hash -1387972913, now seen corresponding path program 1 times [2018-06-24 22:01:18,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:18,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:18,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:18,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:18,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:18,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:18,962 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:18,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:18,962 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 22:01:18,962 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:01:18,962 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:01:18,962 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:18,963 INFO ]: Start difference. First operand 82 states and 179 transitions. Second operand 4 states. [2018-06-24 22:01:19,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:19,041 INFO ]: Finished difference Result 101 states and 232 transitions. [2018-06-24 22:01:19,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:01:19,042 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 22:01:19,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:19,046 INFO ]: With dead ends: 101 [2018-06-24 22:01:19,046 INFO ]: Without dead ends: 101 [2018-06-24 22:01:19,046 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:19,046 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-24 22:01:19,062 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 80. [2018-06-24 22:01:19,062 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-24 22:01:19,065 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 175 transitions. [2018-06-24 22:01:19,065 INFO ]: Start accepts. Automaton has 80 states and 175 transitions. Word has length 6 [2018-06-24 22:01:19,065 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:19,065 INFO ]: Abstraction has 80 states and 175 transitions. [2018-06-24 22:01:19,065 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:01:19,065 INFO ]: Start isEmpty. Operand 80 states and 175 transitions. [2018-06-24 22:01:19,068 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:01:19,068 INFO ]: Found error trace [2018-06-24 22:01:19,068 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:19,068 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:19,068 INFO ]: Analyzing trace with hash -107919536, now seen corresponding path program 1 times [2018-06-24 22:01:19,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:19,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:19,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:19,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:19,118 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:19,118 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:19,118 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 22:01:19,119 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:01:19,119 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:01:19,119 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:19,119 INFO ]: Start difference. First operand 80 states and 175 transitions. Second operand 5 states. [2018-06-24 22:01:19,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:19,222 INFO ]: Finished difference Result 101 states and 210 transitions. [2018-06-24 22:01:19,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 22:01:19,224 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 22:01:19,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:19,226 INFO ]: With dead ends: 101 [2018-06-24 22:01:19,226 INFO ]: Without dead ends: 92 [2018-06-24 22:01:19,226 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:01:19,227 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-24 22:01:19,252 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-06-24 22:01:19,252 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 22:01:19,254 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 183 transitions. [2018-06-24 22:01:19,254 INFO ]: Start accepts. Automaton has 87 states and 183 transitions. Word has length 7 [2018-06-24 22:01:19,254 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:19,254 INFO ]: Abstraction has 87 states and 183 transitions. [2018-06-24 22:01:19,254 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:01:19,254 INFO ]: Start isEmpty. Operand 87 states and 183 transitions. [2018-06-24 22:01:19,265 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 22:01:19,265 INFO ]: Found error trace [2018-06-24 22:01:19,266 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:19,266 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:19,266 INFO ]: Analyzing trace with hash -79290385, now seen corresponding path program 1 times [2018-06-24 22:01:19,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:19,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:19,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,266 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:19,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,284 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:19,444 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:19,444 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:19,444 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 22:01:19,444 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:01:19,444 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:01:19,444 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:19,444 INFO ]: Start difference. First operand 87 states and 183 transitions. Second operand 5 states. [2018-06-24 22:01:19,570 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:19,570 INFO ]: Finished difference Result 101 states and 206 transitions. [2018-06-24 22:01:19,571 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 22:01:19,571 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 22:01:19,571 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:19,573 INFO ]: With dead ends: 101 [2018-06-24 22:01:19,573 INFO ]: Without dead ends: 95 [2018-06-24 22:01:19,573 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:01:19,573 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-24 22:01:19,584 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-06-24 22:01:19,584 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 22:01:19,586 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 183 transitions. [2018-06-24 22:01:19,586 INFO ]: Start accepts. Automaton has 87 states and 183 transitions. Word has length 7 [2018-06-24 22:01:19,586 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:19,586 INFO ]: Abstraction has 87 states and 183 transitions. [2018-06-24 22:01:19,586 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:01:19,586 INFO ]: Start isEmpty. Operand 87 states and 183 transitions. [2018-06-24 22:01:19,589 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:01:19,589 INFO ]: Found error trace [2018-06-24 22:01:19,589 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:19,589 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:19,589 INFO ]: Analyzing trace with hash -458276086, now seen corresponding path program 1 times [2018-06-24 22:01:19,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:19,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:19,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:19,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,597 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:19,643 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:01:19,643 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:19,643 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 22:01:19,644 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:01:19,644 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:01:19,644 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:19,645 INFO ]: Start difference. First operand 87 states and 183 transitions. Second operand 4 states. [2018-06-24 22:01:19,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:19,704 INFO ]: Finished difference Result 102 states and 228 transitions. [2018-06-24 22:01:19,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:01:19,705 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 22:01:19,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:19,707 INFO ]: With dead ends: 102 [2018-06-24 22:01:19,707 INFO ]: Without dead ends: 102 [2018-06-24 22:01:19,708 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:19,708 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-24 22:01:19,720 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-06-24 22:01:19,720 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-24 22:01:19,721 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 189 transitions. [2018-06-24 22:01:19,721 INFO ]: Start accepts. Automaton has 93 states and 189 transitions. Word has length 9 [2018-06-24 22:01:19,721 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:19,721 INFO ]: Abstraction has 93 states and 189 transitions. [2018-06-24 22:01:19,721 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:01:19,721 INFO ]: Start isEmpty. Operand 93 states and 189 transitions. [2018-06-24 22:01:19,724 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 22:01:19,724 INFO ]: Found error trace [2018-06-24 22:01:19,724 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:19,724 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:19,724 INFO ]: Analyzing trace with hash 1284534249, now seen corresponding path program 1 times [2018-06-24 22:01:19,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:19,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:19,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:19,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:19,735 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:19,819 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:01:19,819 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:19,819 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 22:01:19,820 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:01:19,820 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:01:19,820 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:19,820 INFO ]: Start difference. First operand 93 states and 189 transitions. Second operand 4 states. [2018-06-24 22:01:20,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:20,021 INFO ]: Finished difference Result 108 states and 234 transitions. [2018-06-24 22:01:20,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:01:20,024 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-24 22:01:20,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:20,026 INFO ]: With dead ends: 108 [2018-06-24 22:01:20,026 INFO ]: Without dead ends: 108 [2018-06-24 22:01:20,026 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:20,026 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-24 22:01:20,050 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 90. [2018-06-24 22:01:20,050 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-24 22:01:20,051 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 186 transitions. [2018-06-24 22:01:20,051 INFO ]: Start accepts. Automaton has 90 states and 186 transitions. Word has length 9 [2018-06-24 22:01:20,051 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:20,051 INFO ]: Abstraction has 90 states and 186 transitions. [2018-06-24 22:01:20,052 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:01:20,052 INFO ]: Start isEmpty. Operand 90 states and 186 transitions. [2018-06-24 22:01:20,057 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 22:01:20,057 INFO ]: Found error trace [2018-06-24 22:01:20,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:20,057 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:20,058 INFO ]: Analyzing trace with hash 1370122062, now seen corresponding path program 1 times [2018-06-24 22:01:20,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:20,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:20,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:20,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:20,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:20,092 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:20,171 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 22:01:20,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:20,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:20,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:20,210 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:20,217 INFO ]: Computing forward predicates... [2018-06-24 22:01:20,432 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:01:20,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:20,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-24 22:01:20,461 INFO ]: Interpolant automaton has 9 states [2018-06-24 22:01:20,462 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 22:01:20,462 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 22:01:20,462 INFO ]: Start difference. First operand 90 states and 186 transitions. Second operand 9 states. [2018-06-24 22:01:20,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:20,935 INFO ]: Finished difference Result 144 states and 313 transitions. [2018-06-24 22:01:20,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 22:01:20,936 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 22:01:20,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:20,938 INFO ]: With dead ends: 144 [2018-06-24 22:01:20,938 INFO ]: Without dead ends: 132 [2018-06-24 22:01:20,939 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-06-24 22:01:20,939 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 22:01:20,954 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-06-24 22:01:20,955 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-24 22:01:20,956 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 201 transitions. [2018-06-24 22:01:20,956 INFO ]: Start accepts. Automaton has 102 states and 201 transitions. Word has length 10 [2018-06-24 22:01:20,956 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:20,956 INFO ]: Abstraction has 102 states and 201 transitions. [2018-06-24 22:01:20,956 INFO ]: Interpolant automaton has 9 states. [2018-06-24 22:01:20,956 INFO ]: Start isEmpty. Operand 102 states and 201 transitions. [2018-06-24 22:01:20,959 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:01:20,959 INFO ]: Found error trace [2018-06-24 22:01:20,959 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:20,959 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:20,959 INFO ]: Analyzing trace with hash -1982373712, now seen corresponding path program 1 times [2018-06-24 22:01:20,959 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:20,959 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:20,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:20,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:20,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:20,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:21,011 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:01:21,012 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:21,012 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:21,012 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:21,012 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:21,012 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:21,012 INFO ]: Start difference. First operand 102 states and 201 transitions. Second operand 3 states. [2018-06-24 22:01:21,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:21,159 INFO ]: Finished difference Result 131 states and 254 transitions. [2018-06-24 22:01:21,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:21,160 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 22:01:21,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:21,161 INFO ]: With dead ends: 131 [2018-06-24 22:01:21,161 INFO ]: Without dead ends: 131 [2018-06-24 22:01:21,162 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:21,162 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-24 22:01:21,169 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-06-24 22:01:21,169 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-24 22:01:21,171 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 254 transitions. [2018-06-24 22:01:21,171 INFO ]: Start accepts. Automaton has 131 states and 254 transitions. Word has length 11 [2018-06-24 22:01:21,171 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:21,171 INFO ]: Abstraction has 131 states and 254 transitions. [2018-06-24 22:01:21,171 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:21,171 INFO ]: Start isEmpty. Operand 131 states and 254 transitions. [2018-06-24 22:01:21,175 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:01:21,175 INFO ]: Found error trace [2018-06-24 22:01:21,175 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:21,175 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:21,175 INFO ]: Analyzing trace with hash -915700944, now seen corresponding path program 1 times [2018-06-24 22:01:21,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:21,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:21,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:21,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,185 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:21,216 INFO ]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:01:21,216 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:21,217 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:21,217 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:21,217 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:21,217 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:21,217 INFO ]: Start difference. First operand 131 states and 254 transitions. Second operand 3 states. [2018-06-24 22:01:21,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:21,321 INFO ]: Finished difference Result 136 states and 255 transitions. [2018-06-24 22:01:21,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:21,321 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 22:01:21,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:21,323 INFO ]: With dead ends: 136 [2018-06-24 22:01:21,323 INFO ]: Without dead ends: 132 [2018-06-24 22:01:21,323 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:21,323 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 22:01:21,334 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-06-24 22:01:21,335 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-24 22:01:21,336 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 247 transitions. [2018-06-24 22:01:21,336 INFO ]: Start accepts. Automaton has 128 states and 247 transitions. Word has length 11 [2018-06-24 22:01:21,336 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:21,336 INFO ]: Abstraction has 128 states and 247 transitions. [2018-06-24 22:01:21,336 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:21,336 INFO ]: Start isEmpty. Operand 128 states and 247 transitions. [2018-06-24 22:01:21,339 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:01:21,339 INFO ]: Found error trace [2018-06-24 22:01:21,339 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:21,339 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:21,340 INFO ]: Analyzing trace with hash 1977572482, now seen corresponding path program 1 times [2018-06-24 22:01:21,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:21,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:21,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:21,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:21,431 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:01:21,431 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:21,431 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 22:01:21,431 INFO ]: Interpolant automaton has 6 states [2018-06-24 22:01:21,431 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 22:01:21,431 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:01:21,432 INFO ]: Start difference. First operand 128 states and 247 transitions. Second operand 6 states. [2018-06-24 22:01:21,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:21,718 INFO ]: Finished difference Result 183 states and 332 transitions. [2018-06-24 22:01:21,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 22:01:21,719 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 22:01:21,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:21,720 INFO ]: With dead ends: 183 [2018-06-24 22:01:21,720 INFO ]: Without dead ends: 132 [2018-06-24 22:01:21,721 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-24 22:01:21,721 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 22:01:21,728 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-06-24 22:01:21,728 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-24 22:01:21,729 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 241 transitions. [2018-06-24 22:01:21,729 INFO ]: Start accepts. Automaton has 131 states and 241 transitions. Word has length 11 [2018-06-24 22:01:21,730 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:21,730 INFO ]: Abstraction has 131 states and 241 transitions. [2018-06-24 22:01:21,730 INFO ]: Interpolant automaton has 6 states. [2018-06-24 22:01:21,730 INFO ]: Start isEmpty. Operand 131 states and 241 transitions. [2018-06-24 22:01:21,732 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:01:21,732 INFO ]: Found error trace [2018-06-24 22:01:21,732 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:21,732 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:21,732 INFO ]: Analyzing trace with hash 615309679, now seen corresponding path program 1 times [2018-06-24 22:01:21,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:21,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:21,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:21,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,740 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:21,790 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 22:01:21,790 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:21,791 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 22:01:21,791 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:01:21,791 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:01:21,791 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:21,791 INFO ]: Start difference. First operand 131 states and 241 transitions. Second operand 4 states. [2018-06-24 22:01:21,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:21,816 INFO ]: Finished difference Result 135 states and 245 transitions. [2018-06-24 22:01:21,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:01:21,816 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-24 22:01:21,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:21,817 INFO ]: With dead ends: 135 [2018-06-24 22:01:21,817 INFO ]: Without dead ends: 123 [2018-06-24 22:01:21,817 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:21,817 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-24 22:01:21,822 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-06-24 22:01:21,822 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-24 22:01:21,823 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 221 transitions. [2018-06-24 22:01:21,823 INFO ]: Start accepts. Automaton has 123 states and 221 transitions. Word has length 11 [2018-06-24 22:01:21,823 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:21,823 INFO ]: Abstraction has 123 states and 221 transitions. [2018-06-24 22:01:21,823 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:01:21,823 INFO ]: Start isEmpty. Operand 123 states and 221 transitions. [2018-06-24 22:01:21,825 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 22:01:21,825 INFO ]: Found error trace [2018-06-24 22:01:21,825 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:21,826 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:21,826 INFO ]: Analyzing trace with hash -674205585, now seen corresponding path program 1 times [2018-06-24 22:01:21,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:21,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:21,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:21,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:21,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:22,064 INFO ]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:01:22,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:22,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-24 22:01:22,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:01:22,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:22,109 INFO ]: Computing forward predicates... [2018-06-24 22:01:22,241 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 22:01:22,268 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 22:01:22,271 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-24 22:01:22,271 INFO ]: Interpolant automaton has 6 states [2018-06-24 22:01:22,271 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 22:01:22,271 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:01:22,271 INFO ]: Start difference. First operand 123 states and 221 transitions. Second operand 6 states. [2018-06-24 22:01:22,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:22,316 INFO ]: Finished difference Result 145 states and 277 transitions. [2018-06-24 22:01:22,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 22:01:22,316 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-24 22:01:22,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:22,318 INFO ]: With dead ends: 145 [2018-06-24 22:01:22,318 INFO ]: Without dead ends: 133 [2018-06-24 22:01:22,319 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:01:22,319 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-24 22:01:22,327 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-06-24 22:01:22,327 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-24 22:01:22,329 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 213 transitions. [2018-06-24 22:01:22,329 INFO ]: Start accepts. Automaton has 119 states and 213 transitions. Word has length 11 [2018-06-24 22:01:22,329 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:22,329 INFO ]: Abstraction has 119 states and 213 transitions. [2018-06-24 22:01:22,329 INFO ]: Interpolant automaton has 6 states. [2018-06-24 22:01:22,329 INFO ]: Start isEmpty. Operand 119 states and 213 transitions. [2018-06-24 22:01:22,332 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 22:01:22,332 INFO ]: Found error trace [2018-06-24 22:01:22,332 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:22,332 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:22,332 INFO ]: Analyzing trace with hash -937121757, now seen corresponding path program 1 times [2018-06-24 22:01:22,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:22,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:22,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:22,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:22,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:22,350 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:22,508 INFO ]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:01:22,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:22,508 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 22:01:22,509 INFO ]: Interpolant automaton has 4 states [2018-06-24 22:01:22,509 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 22:01:22,509 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:22,509 INFO ]: Start difference. First operand 119 states and 213 transitions. Second operand 4 states. [2018-06-24 22:01:22,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:22,732 INFO ]: Finished difference Result 127 states and 221 transitions. [2018-06-24 22:01:22,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 22:01:22,732 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-24 22:01:22,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:22,734 INFO ]: With dead ends: 127 [2018-06-24 22:01:22,734 INFO ]: Without dead ends: 111 [2018-06-24 22:01:22,734 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 22:01:22,734 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-24 22:01:22,740 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-06-24 22:01:22,740 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-24 22:01:22,741 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 193 transitions. [2018-06-24 22:01:22,741 INFO ]: Start accepts. Automaton has 111 states and 193 transitions. Word has length 14 [2018-06-24 22:01:22,741 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:22,741 INFO ]: Abstraction has 111 states and 193 transitions. [2018-06-24 22:01:22,741 INFO ]: Interpolant automaton has 4 states. [2018-06-24 22:01:22,741 INFO ]: Start isEmpty. Operand 111 states and 193 transitions. [2018-06-24 22:01:22,743 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 22:01:22,743 INFO ]: Found error trace [2018-06-24 22:01:22,743 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:22,743 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:22,743 INFO ]: Analyzing trace with hash -1265031118, now seen corresponding path program 1 times [2018-06-24 22:01:22,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:22,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:22,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:22,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:22,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:22,753 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:22,890 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:01:22,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:22,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:22,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:22,933 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:22,936 INFO ]: Computing forward predicates... [2018-06-24 22:01:22,977 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:01:22,998 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:22,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 22:01:22,998 INFO ]: Interpolant automaton has 7 states [2018-06-24 22:01:22,998 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 22:01:22,998 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:01:22,998 INFO ]: Start difference. First operand 111 states and 193 transitions. Second operand 7 states. [2018-06-24 22:01:23,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:23,363 INFO ]: Finished difference Result 126 states and 233 transitions. [2018-06-24 22:01:23,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 22:01:23,363 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-24 22:01:23,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:23,364 INFO ]: With dead ends: 126 [2018-06-24 22:01:23,364 INFO ]: Without dead ends: 126 [2018-06-24 22:01:23,365 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-24 22:01:23,365 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-24 22:01:23,372 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-06-24 22:01:23,372 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-24 22:01:23,373 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 205 transitions. [2018-06-24 22:01:23,373 INFO ]: Start accepts. Automaton has 119 states and 205 transitions. Word has length 14 [2018-06-24 22:01:23,373 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:23,373 INFO ]: Abstraction has 119 states and 205 transitions. [2018-06-24 22:01:23,373 INFO ]: Interpolant automaton has 7 states. [2018-06-24 22:01:23,373 INFO ]: Start isEmpty. Operand 119 states and 205 transitions. [2018-06-24 22:01:23,375 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 22:01:23,375 INFO ]: Found error trace [2018-06-24 22:01:23,375 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:23,375 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:23,375 INFO ]: Analyzing trace with hash 1387032463, now seen corresponding path program 1 times [2018-06-24 22:01:23,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:23,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:23,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:23,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:23,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:23,385 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:23,456 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 22:01:23,456 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:23,456 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:23,456 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:23,456 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:23,456 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:23,456 INFO ]: Start difference. First operand 119 states and 205 transitions. Second operand 3 states. [2018-06-24 22:01:23,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:23,750 INFO ]: Finished difference Result 145 states and 241 transitions. [2018-06-24 22:01:23,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:23,750 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 22:01:23,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:23,751 INFO ]: With dead ends: 145 [2018-06-24 22:01:23,751 INFO ]: Without dead ends: 134 [2018-06-24 22:01:23,751 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:23,752 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 22:01:23,758 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-24 22:01:23,758 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 22:01:23,759 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 224 transitions. [2018-06-24 22:01:23,759 INFO ]: Start accepts. Automaton has 134 states and 224 transitions. Word has length 17 [2018-06-24 22:01:23,759 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:23,759 INFO ]: Abstraction has 134 states and 224 transitions. [2018-06-24 22:01:23,759 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:23,759 INFO ]: Start isEmpty. Operand 134 states and 224 transitions. [2018-06-24 22:01:23,760 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 22:01:23,760 INFO ]: Found error trace [2018-06-24 22:01:23,760 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:23,761 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:23,761 INFO ]: Analyzing trace with hash 2112086809, now seen corresponding path program 1 times [2018-06-24 22:01:23,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:23,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:23,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:23,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:23,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:23,772 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:23,846 INFO ]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:01:23,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:23,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:23,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:23,874 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:23,875 INFO ]: Computing forward predicates... [2018-06-24 22:01:24,093 INFO ]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 22:01:24,113 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:24,113 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-24 22:01:24,113 INFO ]: Interpolant automaton has 12 states [2018-06-24 22:01:24,113 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 22:01:24,113 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-24 22:01:24,114 INFO ]: Start difference. First operand 134 states and 224 transitions. Second operand 12 states. [2018-06-24 22:01:25,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:25,223 INFO ]: Finished difference Result 210 states and 406 transitions. [2018-06-24 22:01:25,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 22:01:25,224 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-24 22:01:25,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:25,225 INFO ]: With dead ends: 210 [2018-06-24 22:01:25,225 INFO ]: Without dead ends: 210 [2018-06-24 22:01:25,225 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=1162, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 22:01:25,226 INFO ]: Start minimizeSevpa. Operand 210 states. [2018-06-24 22:01:25,235 INFO ]: Finished minimizeSevpa. Reduced states from 210 to 134. [2018-06-24 22:01:25,236 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 22:01:25,237 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 232 transitions. [2018-06-24 22:01:25,237 INFO ]: Start accepts. Automaton has 134 states and 232 transitions. Word has length 17 [2018-06-24 22:01:25,237 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:25,237 INFO ]: Abstraction has 134 states and 232 transitions. [2018-06-24 22:01:25,237 INFO ]: Interpolant automaton has 12 states. [2018-06-24 22:01:25,237 INFO ]: Start isEmpty. Operand 134 states and 232 transitions. [2018-06-24 22:01:25,238 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 22:01:25,238 INFO ]: Found error trace [2018-06-24 22:01:25,238 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:25,238 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:25,239 INFO ]: Analyzing trace with hash 86750044, now seen corresponding path program 1 times [2018-06-24 22:01:25,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:25,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:25,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:25,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:25,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:25,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:25,355 INFO ]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:01:25,355 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:25,355 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:25,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:25,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:25,400 INFO ]: Computing forward predicates... [2018-06-24 22:01:25,606 INFO ]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:01:25,625 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:25,625 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-24 22:01:25,625 INFO ]: Interpolant automaton has 13 states [2018-06-24 22:01:25,625 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 22:01:25,625 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-24 22:01:25,625 INFO ]: Start difference. First operand 134 states and 232 transitions. Second operand 13 states. [2018-06-24 22:01:26,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:26,161 INFO ]: Finished difference Result 213 states and 388 transitions. [2018-06-24 22:01:26,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 22:01:26,161 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-24 22:01:26,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:26,163 INFO ]: With dead ends: 213 [2018-06-24 22:01:26,163 INFO ]: Without dead ends: 197 [2018-06-24 22:01:26,163 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2018-06-24 22:01:26,163 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-24 22:01:26,173 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 159. [2018-06-24 22:01:26,173 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-24 22:01:26,174 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 270 transitions. [2018-06-24 22:01:26,174 INFO ]: Start accepts. Automaton has 159 states and 270 transitions. Word has length 18 [2018-06-24 22:01:26,174 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:26,175 INFO ]: Abstraction has 159 states and 270 transitions. [2018-06-24 22:01:26,175 INFO ]: Interpolant automaton has 13 states. [2018-06-24 22:01:26,175 INFO ]: Start isEmpty. Operand 159 states and 270 transitions. [2018-06-24 22:01:26,176 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 22:01:26,176 INFO ]: Found error trace [2018-06-24 22:01:26,176 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:26,176 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:26,176 INFO ]: Analyzing trace with hash 995735637, now seen corresponding path program 2 times [2018-06-24 22:01:26,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:26,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:26,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:26,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:26,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:26,188 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:26,732 INFO ]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:01:26,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:26,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:26,747 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:01:26,806 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:01:26,806 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:26,809 INFO ]: Computing forward predicates... [2018-06-24 22:01:26,932 INFO ]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:01:26,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:26,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-24 22:01:26,951 INFO ]: Interpolant automaton has 14 states [2018-06-24 22:01:26,952 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 22:01:26,952 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 22:01:26,952 INFO ]: Start difference. First operand 159 states and 270 transitions. Second operand 14 states. [2018-06-24 22:01:27,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:27,373 INFO ]: Finished difference Result 212 states and 359 transitions. [2018-06-24 22:01:27,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 22:01:27,393 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-24 22:01:27,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:27,395 INFO ]: With dead ends: 212 [2018-06-24 22:01:27,395 INFO ]: Without dead ends: 194 [2018-06-24 22:01:27,396 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2018-06-24 22:01:27,396 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-24 22:01:27,404 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 176. [2018-06-24 22:01:27,404 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-24 22:01:27,406 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 301 transitions. [2018-06-24 22:01:27,406 INFO ]: Start accepts. Automaton has 176 states and 301 transitions. Word has length 19 [2018-06-24 22:01:27,406 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:27,406 INFO ]: Abstraction has 176 states and 301 transitions. [2018-06-24 22:01:27,406 INFO ]: Interpolant automaton has 14 states. [2018-06-24 22:01:27,406 INFO ]: Start isEmpty. Operand 176 states and 301 transitions. [2018-06-24 22:01:27,408 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 22:01:27,408 INFO ]: Found error trace [2018-06-24 22:01:27,408 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:27,408 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:27,408 INFO ]: Analyzing trace with hash -1181715870, now seen corresponding path program 2 times [2018-06-24 22:01:27,408 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:27,408 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:27,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:27,409 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:27,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:27,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:27,484 INFO ]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 22:01:27,484 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:27,484 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 22:01:27,485 INFO ]: Interpolant automaton has 7 states [2018-06-24 22:01:27,485 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 22:01:27,485 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:01:27,485 INFO ]: Start difference. First operand 176 states and 301 transitions. Second operand 7 states. [2018-06-24 22:01:27,713 WARN ]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 22:01:28,036 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 22:01:28,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:28,316 INFO ]: Finished difference Result 222 states and 372 transitions. [2018-06-24 22:01:28,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 22:01:28,317 INFO ]: Start accepts. Automaton has 7 states. Word has length 19 [2018-06-24 22:01:28,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:28,319 INFO ]: With dead ends: 222 [2018-06-24 22:01:28,319 INFO ]: Without dead ends: 204 [2018-06-24 22:01:28,319 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-24 22:01:28,319 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-24 22:01:28,327 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 176. [2018-06-24 22:01:28,327 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-24 22:01:28,329 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 301 transitions. [2018-06-24 22:01:28,329 INFO ]: Start accepts. Automaton has 176 states and 301 transitions. Word has length 19 [2018-06-24 22:01:28,329 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:28,329 INFO ]: Abstraction has 176 states and 301 transitions. [2018-06-24 22:01:28,329 INFO ]: Interpolant automaton has 7 states. [2018-06-24 22:01:28,329 INFO ]: Start isEmpty. Operand 176 states and 301 transitions. [2018-06-24 22:01:28,332 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 22:01:28,332 INFO ]: Found error trace [2018-06-24 22:01:28,332 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:28,332 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:28,332 INFO ]: Analyzing trace with hash -378596926, now seen corresponding path program 1 times [2018-06-24 22:01:28,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:28,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:28,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:28,333 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:28,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:28,346 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:28,419 INFO ]: Checked inductivity of 21 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 22:01:28,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:28,419 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:28,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:28,464 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:28,466 INFO ]: Computing forward predicates... [2018-06-24 22:01:28,623 INFO ]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 22:01:28,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:28,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 22:01:28,642 INFO ]: Interpolant automaton has 15 states [2018-06-24 22:01:28,642 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 22:01:28,642 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-24 22:01:28,642 INFO ]: Start difference. First operand 176 states and 301 transitions. Second operand 15 states. [2018-06-24 22:01:29,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:29,886 INFO ]: Finished difference Result 309 states and 584 transitions. [2018-06-24 22:01:29,889 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 22:01:29,889 INFO ]: Start accepts. Automaton has 15 states. Word has length 20 [2018-06-24 22:01:29,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:29,892 INFO ]: With dead ends: 309 [2018-06-24 22:01:29,892 INFO ]: Without dead ends: 301 [2018-06-24 22:01:29,892 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 22:01:29,893 INFO ]: Start minimizeSevpa. Operand 301 states. [2018-06-24 22:01:29,907 INFO ]: Finished minimizeSevpa. Reduced states from 301 to 216. [2018-06-24 22:01:29,907 INFO ]: Start removeUnreachable. Operand 216 states. [2018-06-24 22:01:29,908 INFO ]: Finished removeUnreachable. Reduced from 216 states to 216 states and 371 transitions. [2018-06-24 22:01:29,909 INFO ]: Start accepts. Automaton has 216 states and 371 transitions. Word has length 20 [2018-06-24 22:01:29,909 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:29,909 INFO ]: Abstraction has 216 states and 371 transitions. [2018-06-24 22:01:29,909 INFO ]: Interpolant automaton has 15 states. [2018-06-24 22:01:29,909 INFO ]: Start isEmpty. Operand 216 states and 371 transitions. [2018-06-24 22:01:29,911 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 22:01:29,911 INFO ]: Found error trace [2018-06-24 22:01:29,911 INFO ]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:29,911 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:29,912 INFO ]: Analyzing trace with hash 2123933139, now seen corresponding path program 1 times [2018-06-24 22:01:29,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:29,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:29,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:29,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:29,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:29,923 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:30,294 INFO ]: Checked inductivity of 30 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 22:01:30,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:30,294 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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) [2018-06-24 22:01:30,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 22:01:30,357 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:30,359 INFO ]: Computing forward predicates... [2018-06-24 22:01:30,640 INFO ]: Checked inductivity of 30 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 22:01:30,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:30,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2018-06-24 22:01:30,663 INFO ]: Interpolant automaton has 14 states [2018-06-24 22:01:30,663 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 22:01:30,663 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 22:01:30,664 INFO ]: Start difference. First operand 216 states and 371 transitions. Second operand 14 states. [2018-06-24 22:01:31,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:31,036 INFO ]: Finished difference Result 281 states and 515 transitions. [2018-06-24 22:01:31,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 22:01:31,036 INFO ]: Start accepts. Automaton has 14 states. Word has length 23 [2018-06-24 22:01:31,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:31,038 INFO ]: With dead ends: 281 [2018-06-24 22:01:31,038 INFO ]: Without dead ends: 281 [2018-06-24 22:01:31,038 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2018-06-24 22:01:31,039 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-24 22:01:31,051 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 250. [2018-06-24 22:01:31,051 INFO ]: Start removeUnreachable. Operand 250 states. [2018-06-24 22:01:31,054 INFO ]: Finished removeUnreachable. Reduced from 250 states to 250 states and 423 transitions. [2018-06-24 22:01:31,054 INFO ]: Start accepts. Automaton has 250 states and 423 transitions. Word has length 23 [2018-06-24 22:01:31,054 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:31,054 INFO ]: Abstraction has 250 states and 423 transitions. [2018-06-24 22:01:31,054 INFO ]: Interpolant automaton has 14 states. [2018-06-24 22:01:31,054 INFO ]: Start isEmpty. Operand 250 states and 423 transitions. [2018-06-24 22:01:31,056 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 22:01:31,056 INFO ]: Found error trace [2018-06-24 22:01:31,056 INFO ]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:31,056 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:31,056 INFO ]: Analyzing trace with hash 122019132, now seen corresponding path program 1 times [2018-06-24 22:01:31,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:31,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:31,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:31,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:31,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:31,070 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:31,120 INFO ]: Checked inductivity of 30 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 22:01:31,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:31,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:31,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:31,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:31,173 INFO ]: Computing forward predicates... [2018-06-24 22:01:31,551 INFO ]: Checked inductivity of 30 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 22:01:31,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:31,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-24 22:01:31,581 INFO ]: Interpolant automaton has 16 states [2018-06-24 22:01:31,581 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 22:01:31,581 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-24 22:01:31,581 INFO ]: Start difference. First operand 250 states and 423 transitions. Second operand 16 states. [2018-06-24 22:01:32,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:32,048 INFO ]: Finished difference Result 292 states and 513 transitions. [2018-06-24 22:01:32,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 22:01:32,048 INFO ]: Start accepts. Automaton has 16 states. Word has length 23 [2018-06-24 22:01:32,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:32,051 INFO ]: With dead ends: 292 [2018-06-24 22:01:32,051 INFO ]: Without dead ends: 292 [2018-06-24 22:01:32,052 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-06-24 22:01:32,052 INFO ]: Start minimizeSevpa. Operand 292 states. [2018-06-24 22:01:32,067 INFO ]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-06-24 22:01:32,067 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-24 22:01:32,069 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 456 transitions. [2018-06-24 22:01:32,069 INFO ]: Start accepts. Automaton has 269 states and 456 transitions. Word has length 23 [2018-06-24 22:01:32,069 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:32,069 INFO ]: Abstraction has 269 states and 456 transitions. [2018-06-24 22:01:32,069 INFO ]: Interpolant automaton has 16 states. [2018-06-24 22:01:32,069 INFO ]: Start isEmpty. Operand 269 states and 456 transitions. [2018-06-24 22:01:32,071 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 22:01:32,071 INFO ]: Found error trace [2018-06-24 22:01:32,071 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:32,072 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:32,072 INFO ]: Analyzing trace with hash 1403435969, now seen corresponding path program 1 times [2018-06-24 22:01:32,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:32,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:32,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:32,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:32,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:32,083 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:32,333 INFO ]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 22:01:32,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:32,334 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 22:01:32,334 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:01:32,334 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:01:32,334 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:32,334 INFO ]: Start difference. First operand 269 states and 456 transitions. Second operand 5 states. [2018-06-24 22:01:32,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:32,654 INFO ]: Finished difference Result 311 states and 557 transitions. [2018-06-24 22:01:32,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 22:01:32,655 INFO ]: Start accepts. Automaton has 5 states. Word has length 25 [2018-06-24 22:01:32,655 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:32,658 INFO ]: With dead ends: 311 [2018-06-24 22:01:32,658 INFO ]: Without dead ends: 311 [2018-06-24 22:01:32,658 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:01:32,658 INFO ]: Start minimizeSevpa. Operand 311 states. [2018-06-24 22:01:32,671 INFO ]: Finished minimizeSevpa. Reduced states from 311 to 269. [2018-06-24 22:01:32,671 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-24 22:01:32,673 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 456 transitions. [2018-06-24 22:01:32,674 INFO ]: Start accepts. Automaton has 269 states and 456 transitions. Word has length 25 [2018-06-24 22:01:32,674 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:32,674 INFO ]: Abstraction has 269 states and 456 transitions. [2018-06-24 22:01:32,674 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:01:32,674 INFO ]: Start isEmpty. Operand 269 states and 456 transitions. [2018-06-24 22:01:32,676 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 22:01:32,676 INFO ]: Found error trace [2018-06-24 22:01:32,676 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:32,676 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:32,677 INFO ]: Analyzing trace with hash -1665000371, now seen corresponding path program 2 times [2018-06-24 22:01:32,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:32,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:32,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:32,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:32,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:32,689 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:32,850 INFO ]: Checked inductivity of 30 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 22:01:32,850 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:32,850 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:32,863 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:01:32,896 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:01:32,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:32,898 INFO ]: Computing forward predicates... [2018-06-24 22:01:32,907 INFO ]: Checked inductivity of 30 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 22:01:32,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:32,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 22:01:32,930 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:01:32,930 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:01:32,930 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:32,930 INFO ]: Start difference. First operand 269 states and 456 transitions. Second operand 5 states. [2018-06-24 22:01:33,022 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:33,022 INFO ]: Finished difference Result 291 states and 487 transitions. [2018-06-24 22:01:33,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:01:33,023 INFO ]: Start accepts. Automaton has 5 states. Word has length 26 [2018-06-24 22:01:33,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:33,026 INFO ]: With dead ends: 291 [2018-06-24 22:01:33,026 INFO ]: Without dead ends: 291 [2018-06-24 22:01:33,026 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:33,026 INFO ]: Start minimizeSevpa. Operand 291 states. [2018-06-24 22:01:33,037 INFO ]: Finished minimizeSevpa. Reduced states from 291 to 285. [2018-06-24 22:01:33,037 INFO ]: Start removeUnreachable. Operand 285 states. [2018-06-24 22:01:33,040 INFO ]: Finished removeUnreachable. Reduced from 285 states to 285 states and 481 transitions. [2018-06-24 22:01:33,040 INFO ]: Start accepts. Automaton has 285 states and 481 transitions. Word has length 26 [2018-06-24 22:01:33,040 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:33,040 INFO ]: Abstraction has 285 states and 481 transitions. [2018-06-24 22:01:33,040 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:01:33,040 INFO ]: Start isEmpty. Operand 285 states and 481 transitions. [2018-06-24 22:01:33,043 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 22:01:33,043 INFO ]: Found error trace [2018-06-24 22:01:33,043 INFO ]: trace histogram [5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:33,043 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:33,043 INFO ]: Analyzing trace with hash 1666920597, now seen corresponding path program 2 times [2018-06-24 22:01:33,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:33,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:33,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:33,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:33,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:33,056 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:33,513 INFO ]: Checked inductivity of 41 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 22:01:33,513 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:33,513 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 22:01:33,513 INFO ]: Interpolant automaton has 7 states [2018-06-24 22:01:33,513 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 22:01:33,513 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:01:33,513 INFO ]: Start difference. First operand 285 states and 481 transitions. Second operand 7 states. [2018-06-24 22:01:33,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:33,608 INFO ]: Finished difference Result 381 states and 662 transitions. [2018-06-24 22:01:33,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 22:01:33,608 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-24 22:01:33,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:33,611 INFO ]: With dead ends: 381 [2018-06-24 22:01:33,611 INFO ]: Without dead ends: 381 [2018-06-24 22:01:33,611 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 22:01:33,611 INFO ]: Start minimizeSevpa. Operand 381 states. [2018-06-24 22:01:33,626 INFO ]: Finished minimizeSevpa. Reduced states from 381 to 313. [2018-06-24 22:01:33,626 INFO ]: Start removeUnreachable. Operand 313 states. [2018-06-24 22:01:33,628 INFO ]: Finished removeUnreachable. Reduced from 313 states to 313 states and 529 transitions. [2018-06-24 22:01:33,629 INFO ]: Start accepts. Automaton has 313 states and 529 transitions. Word has length 25 [2018-06-24 22:01:33,629 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:33,629 INFO ]: Abstraction has 313 states and 529 transitions. [2018-06-24 22:01:33,629 INFO ]: Interpolant automaton has 7 states. [2018-06-24 22:01:33,629 INFO ]: Start isEmpty. Operand 313 states and 529 transitions. [2018-06-24 22:01:33,633 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 22:01:33,633 INFO ]: Found error trace [2018-06-24 22:01:33,633 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:33,634 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:33,634 INFO ]: Analyzing trace with hash 1018382018, now seen corresponding path program 2 times [2018-06-24 22:01:33,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:33,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:33,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:33,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:33,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:33,647 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:33,765 INFO ]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 22:01:33,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:33,765 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:33,772 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 22:01:33,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 22:01:33,822 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:33,825 INFO ]: Computing forward predicates... [2018-06-24 22:01:33,958 INFO ]: Checked inductivity of 38 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 22:01:33,977 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:33,977 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-06-24 22:01:33,977 INFO ]: Interpolant automaton has 17 states [2018-06-24 22:01:33,977 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 22:01:33,977 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-24 22:01:33,977 INFO ]: Start difference. First operand 313 states and 529 transitions. Second operand 17 states. [2018-06-24 22:01:35,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:35,771 INFO ]: Finished difference Result 406 states and 765 transitions. [2018-06-24 22:01:35,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-24 22:01:35,771 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-24 22:01:35,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:35,774 INFO ]: With dead ends: 406 [2018-06-24 22:01:35,774 INFO ]: Without dead ends: 406 [2018-06-24 22:01:35,775 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=597, Invalid=2709, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 22:01:35,775 INFO ]: Start minimizeSevpa. Operand 406 states. [2018-06-24 22:01:35,791 INFO ]: Finished minimizeSevpa. Reduced states from 406 to 332. [2018-06-24 22:01:35,792 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-24 22:01:35,794 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 580 transitions. [2018-06-24 22:01:35,794 INFO ]: Start accepts. Automaton has 332 states and 580 transitions. Word has length 25 [2018-06-24 22:01:35,794 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:35,794 INFO ]: Abstraction has 332 states and 580 transitions. [2018-06-24 22:01:35,794 INFO ]: Interpolant automaton has 17 states. [2018-06-24 22:01:35,794 INFO ]: Start isEmpty. Operand 332 states and 580 transitions. [2018-06-24 22:01:35,797 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 22:01:35,797 INFO ]: Found error trace [2018-06-24 22:01:35,797 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:35,798 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:35,798 INFO ]: Analyzing trace with hash -77206991, now seen corresponding path program 3 times [2018-06-24 22:01:35,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:35,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:35,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:35,798 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:35,798 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:35,814 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:35,942 INFO ]: Checked inductivity of 36 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 22:01:35,942 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:35,942 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:35,947 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 22:01:35,979 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 22:01:35,979 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:35,981 INFO ]: Computing forward predicates... [2018-06-24 22:01:36,039 INFO ]: Checked inductivity of 36 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 22:01:36,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:36,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-06-24 22:01:36,059 INFO ]: Interpolant automaton has 12 states [2018-06-24 22:01:36,059 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 22:01:36,059 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-24 22:01:36,059 INFO ]: Start difference. First operand 332 states and 580 transitions. Second operand 12 states. [2018-06-24 22:01:37,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:37,166 INFO ]: Finished difference Result 465 states and 824 transitions. [2018-06-24 22:01:37,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 22:01:37,166 INFO ]: Start accepts. Automaton has 12 states. Word has length 27 [2018-06-24 22:01:37,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:37,169 INFO ]: With dead ends: 465 [2018-06-24 22:01:37,169 INFO ]: Without dead ends: 415 [2018-06-24 22:01:37,169 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 22:01:37,169 INFO ]: Start minimizeSevpa. Operand 415 states. [2018-06-24 22:01:37,185 INFO ]: Finished minimizeSevpa. Reduced states from 415 to 384. [2018-06-24 22:01:37,185 INFO ]: Start removeUnreachable. Operand 384 states. [2018-06-24 22:01:37,193 INFO ]: Finished removeUnreachable. Reduced from 384 states to 384 states and 692 transitions. [2018-06-24 22:01:37,193 INFO ]: Start accepts. Automaton has 384 states and 692 transitions. Word has length 27 [2018-06-24 22:01:37,193 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:37,193 INFO ]: Abstraction has 384 states and 692 transitions. [2018-06-24 22:01:37,193 INFO ]: Interpolant automaton has 12 states. [2018-06-24 22:01:37,193 INFO ]: Start isEmpty. Operand 384 states and 692 transitions. [2018-06-24 22:01:37,201 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 22:01:37,201 INFO ]: Found error trace [2018-06-24 22:01:37,201 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:37,201 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:37,201 INFO ]: Analyzing trace with hash -643976981, now seen corresponding path program 3 times [2018-06-24 22:01:37,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:37,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:37,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:37,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:37,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:37,213 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:37,496 INFO ]: Checked inductivity of 44 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 22:01:37,496 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:37,496 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:37,502 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 22:01:37,526 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 22:01:37,526 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:37,528 INFO ]: Computing forward predicates... [2018-06-24 22:01:37,584 INFO ]: Checked inductivity of 44 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 22:01:37,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:37,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 22:01:37,604 INFO ]: Interpolant automaton has 14 states [2018-06-24 22:01:37,604 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 22:01:37,604 INFO ]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-24 22:01:37,605 INFO ]: Start difference. First operand 384 states and 692 transitions. Second operand 14 states. [2018-06-24 22:01:38,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:38,576 INFO ]: Finished difference Result 638 states and 1249 transitions. [2018-06-24 22:01:38,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 22:01:38,576 INFO ]: Start accepts. Automaton has 14 states. Word has length 26 [2018-06-24 22:01:38,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:38,581 INFO ]: With dead ends: 638 [2018-06-24 22:01:38,581 INFO ]: Without dead ends: 638 [2018-06-24 22:01:38,583 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1796, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 22:01:38,584 INFO ]: Start minimizeSevpa. Operand 638 states. [2018-06-24 22:01:38,609 INFO ]: Finished minimizeSevpa. Reduced states from 638 to 419. [2018-06-24 22:01:38,609 INFO ]: Start removeUnreachable. Operand 419 states. [2018-06-24 22:01:38,611 INFO ]: Finished removeUnreachable. Reduced from 419 states to 419 states and 718 transitions. [2018-06-24 22:01:38,612 INFO ]: Start accepts. Automaton has 419 states and 718 transitions. Word has length 26 [2018-06-24 22:01:38,612 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:38,612 INFO ]: Abstraction has 419 states and 718 transitions. [2018-06-24 22:01:38,612 INFO ]: Interpolant automaton has 14 states. [2018-06-24 22:01:38,612 INFO ]: Start isEmpty. Operand 419 states and 718 transitions. [2018-06-24 22:01:38,616 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 22:01:38,616 INFO ]: Found error trace [2018-06-24 22:01:38,616 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:38,616 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:38,616 INFO ]: Analyzing trace with hash -1361822648, now seen corresponding path program 1 times [2018-06-24 22:01:38,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:38,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:38,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:38,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:38,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:38,623 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:38,685 INFO ]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 22:01:38,686 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:38,686 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:38,686 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:38,686 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:38,686 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:38,686 INFO ]: Start difference. First operand 419 states and 718 transitions. Second operand 3 states. [2018-06-24 22:01:39,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:39,123 INFO ]: Finished difference Result 447 states and 715 transitions. [2018-06-24 22:01:39,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:39,123 INFO ]: Start accepts. Automaton has 3 states. Word has length 26 [2018-06-24 22:01:39,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:39,125 INFO ]: With dead ends: 447 [2018-06-24 22:01:39,125 INFO ]: Without dead ends: 396 [2018-06-24 22:01:39,125 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:39,125 INFO ]: Start minimizeSevpa. Operand 396 states. [2018-06-24 22:01:39,137 INFO ]: Finished minimizeSevpa. Reduced states from 396 to 384. [2018-06-24 22:01:39,137 INFO ]: Start removeUnreachable. Operand 384 states. [2018-06-24 22:01:39,138 INFO ]: Finished removeUnreachable. Reduced from 384 states to 384 states and 618 transitions. [2018-06-24 22:01:39,139 INFO ]: Start accepts. Automaton has 384 states and 618 transitions. Word has length 26 [2018-06-24 22:01:39,139 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:39,139 INFO ]: Abstraction has 384 states and 618 transitions. [2018-06-24 22:01:39,139 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:39,139 INFO ]: Start isEmpty. Operand 384 states and 618 transitions. [2018-06-24 22:01:39,142 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 22:01:39,142 INFO ]: Found error trace [2018-06-24 22:01:39,142 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:39,142 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:39,142 INFO ]: Analyzing trace with hash -1336438776, now seen corresponding path program 3 times [2018-06-24 22:01:39,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:39,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:39,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:39,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:39,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:39,157 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:39,809 INFO ]: Checked inductivity of 50 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 22:01:39,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:39,809 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:39,814 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 22:01:39,843 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 22:01:39,843 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:39,844 INFO ]: Computing forward predicates... [2018-06-24 22:01:39,884 INFO ]: Checked inductivity of 50 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 22:01:39,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:39,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-06-24 22:01:39,903 INFO ]: Interpolant automaton has 16 states [2018-06-24 22:01:39,903 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 22:01:39,903 INFO ]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-06-24 22:01:39,903 INFO ]: Start difference. First operand 384 states and 618 transitions. Second operand 16 states. [2018-06-24 22:01:40,448 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:40,448 INFO ]: Finished difference Result 482 states and 825 transitions. [2018-06-24 22:01:40,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 22:01:40,449 INFO ]: Start accepts. Automaton has 16 states. Word has length 27 [2018-06-24 22:01:40,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:40,451 INFO ]: With dead ends: 482 [2018-06-24 22:01:40,451 INFO ]: Without dead ends: 474 [2018-06-24 22:01:40,452 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 22:01:40,452 INFO ]: Start minimizeSevpa. Operand 474 states. [2018-06-24 22:01:40,469 INFO ]: Finished minimizeSevpa. Reduced states from 474 to 353. [2018-06-24 22:01:40,469 INFO ]: Start removeUnreachable. Operand 353 states. [2018-06-24 22:01:40,472 INFO ]: Finished removeUnreachable. Reduced from 353 states to 353 states and 579 transitions. [2018-06-24 22:01:40,472 INFO ]: Start accepts. Automaton has 353 states and 579 transitions. Word has length 27 [2018-06-24 22:01:40,472 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:40,472 INFO ]: Abstraction has 353 states and 579 transitions. [2018-06-24 22:01:40,472 INFO ]: Interpolant automaton has 16 states. [2018-06-24 22:01:40,472 INFO ]: Start isEmpty. Operand 353 states and 579 transitions. [2018-06-24 22:01:40,475 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 22:01:40,475 INFO ]: Found error trace [2018-06-24 22:01:40,475 INFO ]: trace histogram [6, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:40,475 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:40,475 INFO ]: Analyzing trace with hash 1530876889, now seen corresponding path program 4 times [2018-06-24 22:01:40,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:40,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:40,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:40,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:40,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:40,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:40,562 INFO ]: Checked inductivity of 64 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 22:01:40,562 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 22:01:40,562 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-24 22:01:40,568 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 22:01:40,603 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 22:01:40,603 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:40,605 INFO ]: Computing forward predicates... [2018-06-24 22:01:40,611 INFO ]: Checked inductivity of 64 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 22:01:40,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 22:01:40,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 22:01:40,631 INFO ]: Interpolant automaton has 7 states [2018-06-24 22:01:40,632 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 22:01:40,632 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 22:01:40,632 INFO ]: Start difference. First operand 353 states and 579 transitions. Second operand 7 states. [2018-06-24 22:01:40,701 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:40,701 INFO ]: Finished difference Result 425 states and 719 transitions. [2018-06-24 22:01:40,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 22:01:40,701 INFO ]: Start accepts. Automaton has 7 states. Word has length 29 [2018-06-24 22:01:40,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:40,703 INFO ]: With dead ends: 425 [2018-06-24 22:01:40,703 INFO ]: Without dead ends: 384 [2018-06-24 22:01:40,703 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 22:01:40,703 INFO ]: Start minimizeSevpa. Operand 384 states. [2018-06-24 22:01:40,715 INFO ]: Finished minimizeSevpa. Reduced states from 384 to 339. [2018-06-24 22:01:40,715 INFO ]: Start removeUnreachable. Operand 339 states. [2018-06-24 22:01:40,717 INFO ]: Finished removeUnreachable. Reduced from 339 states to 339 states and 549 transitions. [2018-06-24 22:01:40,717 INFO ]: Start accepts. Automaton has 339 states and 549 transitions. Word has length 29 [2018-06-24 22:01:40,717 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:40,717 INFO ]: Abstraction has 339 states and 549 transitions. [2018-06-24 22:01:40,717 INFO ]: Interpolant automaton has 7 states. [2018-06-24 22:01:40,717 INFO ]: Start isEmpty. Operand 339 states and 549 transitions. [2018-06-24 22:01:40,720 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 22:01:40,720 INFO ]: Found error trace [2018-06-24 22:01:40,720 INFO ]: trace histogram [7, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:40,720 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:40,720 INFO ]: Analyzing trace with hash -1148693301, now seen corresponding path program 1 times [2018-06-24 22:01:40,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:40,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:40,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:40,720 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 22:01:40,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:40,730 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:40,786 INFO ]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 22:01:40,786 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:40,787 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 22:01:40,787 INFO ]: Interpolant automaton has 3 states [2018-06-24 22:01:40,787 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 22:01:40,787 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:40,787 INFO ]: Start difference. First operand 339 states and 549 transitions. Second operand 3 states. [2018-06-24 22:01:40,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:40,817 INFO ]: Finished difference Result 339 states and 533 transitions. [2018-06-24 22:01:40,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 22:01:40,817 INFO ]: Start accepts. Automaton has 3 states. Word has length 31 [2018-06-24 22:01:40,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:40,819 INFO ]: With dead ends: 339 [2018-06-24 22:01:40,819 INFO ]: Without dead ends: 338 [2018-06-24 22:01:40,819 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 22:01:40,819 INFO ]: Start minimizeSevpa. Operand 338 states. [2018-06-24 22:01:40,828 INFO ]: Finished minimizeSevpa. Reduced states from 338 to 334. [2018-06-24 22:01:40,828 INFO ]: Start removeUnreachable. Operand 334 states. [2018-06-24 22:01:40,829 INFO ]: Finished removeUnreachable. Reduced from 334 states to 334 states and 524 transitions. [2018-06-24 22:01:40,829 INFO ]: Start accepts. Automaton has 334 states and 524 transitions. Word has length 31 [2018-06-24 22:01:40,829 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:40,829 INFO ]: Abstraction has 334 states and 524 transitions. [2018-06-24 22:01:40,829 INFO ]: Interpolant automaton has 3 states. [2018-06-24 22:01:40,829 INFO ]: Start isEmpty. Operand 334 states and 524 transitions. [2018-06-24 22:01:40,832 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 22:01:40,832 INFO ]: Found error trace [2018-06-24 22:01:40,832 INFO ]: trace histogram [6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 22:01:40,832 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 22:01:40,832 INFO ]: Analyzing trace with hash 538341170, now seen corresponding path program 1 times [2018-06-24 22:01:40,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 22:01:40,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 22:01:40,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:40,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 22:01:40,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 22:01:40,848 INFO ]: Conjunction of SSA is unsat [2018-06-24 22:01:40,952 INFO ]: Checked inductivity of 91 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-24 22:01:40,952 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 22:01:40,952 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 22:01:40,952 INFO ]: Interpolant automaton has 5 states [2018-06-24 22:01:40,952 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 22:01:40,952 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 22:01:40,952 INFO ]: Start difference. First operand 334 states and 524 transitions. Second operand 5 states. [2018-06-24 22:01:41,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 22:01:41,003 INFO ]: Finished difference Result 152 states and 235 transitions. [2018-06-24 22:01:41,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 22:01:41,004 INFO ]: Start accepts. Automaton has 5 states. Word has length 40 [2018-06-24 22:01:41,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 22:01:41,004 INFO ]: With dead ends: 152 [2018-06-24 22:01:41,004 INFO ]: Without dead ends: 0 [2018-06-24 22:01:41,004 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 22:01:41,004 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 22:01:41,004 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 22:01:41,004 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 22:01:41,004 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 22:01:41,004 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-06-24 22:01:41,004 INFO ]: Finished accepts. word is rejected. [2018-06-24 22:01:41,004 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 22:01:41,004 INFO ]: Interpolant automaton has 5 states. [2018-06-24 22:01:41,004 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 22:01:41,004 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 22:01:41,006 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 22:01:41,007 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 10:01:41 BasicIcfg [2018-06-24 22:01:41,007 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 22:01:41,008 INFO ]: Toolchain (without parser) took 25324.32 ms. Allocated memory was 305.1 MB in the beginning and 635.4 MB in the end (delta: 330.3 MB). Free memory was 256.7 MB in the beginning and 557.2 MB in the end (delta: -300.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:41,008 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:01:41,009 INFO ]: ChcToBoogie took 64.49 ms. Allocated memory is still 305.1 MB. Free memory was 256.7 MB in the beginning and 254.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:41,009 INFO ]: Boogie Preprocessor took 66.17 ms. Allocated memory is still 305.1 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:41,009 INFO ]: RCFGBuilder took 662.29 ms. Allocated memory is still 305.1 MB. Free memory was 252.6 MB in the beginning and 229.6 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:41,010 INFO ]: BlockEncodingV2 took 547.40 ms. Allocated memory is still 305.1 MB. Free memory was 229.6 MB in the beginning and 212.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-24 22:01:41,010 INFO ]: TraceAbstraction took 23973.76 ms. Allocated memory was 305.1 MB in the beginning and 635.4 MB in the end (delta: 330.3 MB). Free memory was 212.5 MB in the beginning and 557.2 MB in the end (delta: -344.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 22:01:41,013 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 58 locations, 101 edges - StatisticsResult: Encoded RCFG 36 locations, 76 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.49 ms. Allocated memory is still 305.1 MB. Free memory was 256.7 MB in the beginning and 254.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 66.17 ms. Allocated memory is still 305.1 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 662.29 ms. Allocated memory is still 305.1 MB. Free memory was 252.6 MB in the beginning and 229.6 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 547.40 ms. Allocated memory is still 305.1 MB. Free memory was 229.6 MB in the beginning and 212.5 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 23973.76 ms. Allocated memory was 305.1 MB in the beginning and 635.4 MB in the end (delta: 330.3 MB). Free memory was 212.5 MB in the beginning and 557.2 MB in the end (delta: -344.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. SAFE Result, 23.9s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2314 SDtfs, 1027 SDslu, 7512 SDs, 0 SdLazy, 7365 SolverSat, 795 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 311 SyntacticMatches, 9 SemanticMatches, 450 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2933 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=419occurred in iteration=30, 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: 0.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 1047 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 927 NumberOfCodeBlocks, 911 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 42825 SizeOfPredicates, 85 NumberOfNonLiveVariables, 3557 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 50 InterpolantComputations, 21 PerfectInterpolantSequences, 1030/1112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_22-01-41-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_22-01-41-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_22-01-41-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_22-01-41-023.csv Received shutdown request...