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/loop__barthe2-big.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:40:05,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:40:05,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:40:05,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:40:05,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:40:05,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:40:05,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:40:05,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:40:05,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:40:05,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:40:05,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:40:05,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:40:05,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:40:05,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:40:05,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:40:05,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:40:05,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:40:05,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:40:05,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:40:05,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:40:05,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:40:05,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:40:05,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:40:05,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:40:05,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:40:05,637 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:40:05,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:40:05,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:40:05,644 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:40:05,644 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:40:05,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:40:05,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:40:05,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:40:05,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:40:05,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:40:05,650 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:40:05,673 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:40:05,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:40:05,673 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:40:05,674 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:40:05,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:40:05,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:40:05,675 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:40:05,675 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:40:05,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:40:05,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:40:05,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:40:05,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:40:05,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:40:05,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:40:05,680 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:40:05,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:40:05,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:40:05,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:40:05,680 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:40:05,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:40:05,681 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:40:05,682 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:40:05,682 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:40:05,729 INFO ]: Repository-Root is: /tmp [2018-06-24 21:40:05,741 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:40:05,744 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:40:05,745 INFO ]: Initializing SmtParser... [2018-06-24 21:40:05,746 INFO ]: SmtParser initialized [2018-06-24 21:40:05,746 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-24 21:40:05,747 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 21:40:05,841 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@5a4bc256 [2018-06-24 21:40:06,111 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2-big.smt2 [2018-06-24 21:40:06,116 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:40:06,122 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:40:06,122 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:40:06,122 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:40:06,122 INFO ]: ChcToBoogie initialized [2018-06-24 21:40:06,125 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,184 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06 Unit [2018-06-24 21:40:06,184 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:40:06,185 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:40:06,185 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:40:06,185 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:40:06,205 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,206 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,213 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,213 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,216 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,218 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,219 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,221 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:40:06,221 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:40:06,221 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:40:06,221 INFO ]: RCFGBuilder initialized [2018-06-24 21:40:06,222 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:40:06,239 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:40:06,239 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:40:06,240 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:40:06,240 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:40:06,240 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:40:06,240 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 21:40:06,513 INFO ]: Using library mode [2018-06-24 21:40:06,513 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:40:06 BoogieIcfgContainer [2018-06-24 21:40:06,513 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:40:06,514 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:40:06,514 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:40:06,515 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:40:06,515 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:40:06" (1/1) ... [2018-06-24 21:40:06,532 INFO ]: Initial Icfg 11 locations, 16 edges [2018-06-24 21:40:06,533 INFO ]: Using Remove infeasible edges [2018-06-24 21:40:06,534 INFO ]: Using Maximize final states [2018-06-24 21:40:06,534 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:40:06,534 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:40:06,536 INFO ]: Using Remove sink states [2018-06-24 21:40:06,537 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:40:06,537 INFO ]: Using Use SBE [2018-06-24 21:40:06,543 INFO ]: SBE split 0 edges [2018-06-24 21:40:06,549 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:40:06,550 INFO ]: 0 new accepting states [2018-06-24 21:40:06,577 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:40:06,579 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:40:06,584 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:40:06,584 INFO ]: 0 new accepting states [2018-06-24 21:40:06,584 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:40:06,585 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:40:06,585 INFO ]: Encoded RCFG 7 locations, 12 edges [2018-06-24 21:40:06,585 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:40:06 BasicIcfg [2018-06-24 21:40:06,585 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:40:06,589 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:40:06,589 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:40:06,596 INFO ]: TraceAbstraction initialized [2018-06-24 21:40:06,596 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:40:06" (1/4) ... [2018-06-24 21:40:06,597 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74016ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:40:06, skipping insertion in model container [2018-06-24 21:40:06,597 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:40:06" (2/4) ... [2018-06-24 21:40:06,597 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74016ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:40:06, skipping insertion in model container [2018-06-24 21:40:06,598 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:40:06" (3/4) ... [2018-06-24 21:40:06,598 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74016ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:40:06, skipping insertion in model container [2018-06-24 21:40:06,598 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:40:06" (4/4) ... [2018-06-24 21:40:06,601 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:40:06,611 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:40:06,619 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:40:06,668 INFO ]: Using default assertion order modulation [2018-06-24 21:40:06,669 INFO ]: Interprodecural is true [2018-06-24 21:40:06,669 INFO ]: Hoare is false [2018-06-24 21:40:06,669 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:40:06,669 INFO ]: Backedges is TWOTRACK [2018-06-24 21:40:06,669 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:40:06,669 INFO ]: Difference is false [2018-06-24 21:40:06,669 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:40:06,669 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:40:06,678 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 21:40:06,687 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:40:06,687 INFO ]: Found error trace [2018-06-24 21:40:06,688 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:40:06,688 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:06,697 INFO ]: Analyzing trace with hash 1274475792, now seen corresponding path program 1 times [2018-06-24 21:40:06,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:06,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:06,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:06,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:06,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:06,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:06,865 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:06,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:40:06,867 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:40:06,868 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:40:06,879 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:40:06,880 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:40:06,883 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-24 21:40:07,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:07,036 INFO ]: Finished difference Result 11 states and 24 transitions. [2018-06-24 21:40:07,037 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:40:07,038 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:40:07,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:07,047 INFO ]: With dead ends: 11 [2018-06-24 21:40:07,047 INFO ]: Without dead ends: 11 [2018-06-24 21:40:07,049 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 21:40:07,063 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:40:07,099 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:40:07,100 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:40:07,101 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-06-24 21:40:07,102 INFO ]: Start accepts. Automaton has 9 states and 19 transitions. Word has length 6 [2018-06-24 21:40:07,103 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:07,103 INFO ]: Abstraction has 9 states and 19 transitions. [2018-06-24 21:40:07,103 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:40:07,103 INFO ]: Start isEmpty. Operand 9 states and 19 transitions. [2018-06-24 21:40:07,103 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:40:07,103 INFO ]: Found error trace [2018-06-24 21:40:07,103 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:07,103 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:07,104 INFO ]: Analyzing trace with hash 853688483, now seen corresponding path program 1 times [2018-06-24 21:40:07,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:07,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:07,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:07,105 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:07,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:07,121 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:07,458 WARN ]: Spent 174.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-06-24 21:40:07,590 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:07,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:07,590 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 21:40:07,603 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:07,640 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:07,649 INFO ]: Computing forward predicates... [2018-06-24 21:40:07,768 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:07,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:07,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 21:40:07,789 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:40:07,789 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:40:07,789 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:40:07,789 INFO ]: Start difference. First operand 9 states and 19 transitions. Second operand 7 states. [2018-06-24 21:40:08,013 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:40:08,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:08,117 INFO ]: Finished difference Result 14 states and 34 transitions. [2018-06-24 21:40:08,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:40:08,118 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:40:08,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:08,118 INFO ]: With dead ends: 14 [2018-06-24 21:40:08,118 INFO ]: Without dead ends: 12 [2018-06-24 21:40:08,119 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:08,119 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:40:08,121 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 21:40:08,121 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:40:08,122 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-24 21:40:08,122 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 7 [2018-06-24 21:40:08,122 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:08,122 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-24 21:40:08,122 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:40:08,122 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-24 21:40:08,122 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:40:08,123 INFO ]: Found error trace [2018-06-24 21:40:08,123 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:08,123 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:08,123 INFO ]: Analyzing trace with hash 853777856, now seen corresponding path program 1 times [2018-06-24 21:40:08,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:08,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:08,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:08,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:08,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:08,140 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:08,298 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:08,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:08,299 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 21:40:08,316 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 21:40:08,358 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:08,360 INFO ]: Computing forward predicates... [2018-06-24 21:40:08,504 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:08,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:08,523 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:40:08,523 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:40:08,524 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:40:08,524 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:08,524 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 8 states. [2018-06-24 21:40:09,126 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:09,126 INFO ]: Finished difference Result 18 states and 38 transitions. [2018-06-24 21:40:09,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:40:09,126 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:40:09,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:09,127 INFO ]: With dead ends: 18 [2018-06-24 21:40:09,127 INFO ]: Without dead ends: 14 [2018-06-24 21:40:09,127 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:40:09,127 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:40:09,129 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-24 21:40:09,129 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:40:09,130 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-06-24 21:40:09,130 INFO ]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 7 [2018-06-24 21:40:09,130 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:09,130 INFO ]: Abstraction has 12 states and 26 transitions. [2018-06-24 21:40:09,130 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:40:09,130 INFO ]: Start isEmpty. Operand 12 states and 26 transitions. [2018-06-24 21:40:09,130 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:40:09,130 INFO ]: Found error trace [2018-06-24 21:40:09,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:09,130 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:09,130 INFO ]: Analyzing trace with hash 854463049, now seen corresponding path program 1 times [2018-06-24 21:40:09,130 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:09,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:09,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:09,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,191 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:09,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:09,191 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 21:40:09,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:09,224 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,226 INFO ]: Computing forward predicates... [2018-06-24 21:40:09,339 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:09,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:09,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:40:09,359 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:40:09,359 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:40:09,359 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:40:09,359 INFO ]: Start difference. First operand 12 states and 26 transitions. Second operand 6 states. [2018-06-24 21:40:09,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:09,456 INFO ]: Finished difference Result 16 states and 34 transitions. [2018-06-24 21:40:09,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:40:09,456 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:40:09,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:09,457 INFO ]: With dead ends: 16 [2018-06-24 21:40:09,457 INFO ]: Without dead ends: 16 [2018-06-24 21:40:09,457 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:09,457 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:40:09,459 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-06-24 21:40:09,459 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:40:09,460 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-06-24 21:40:09,460 INFO ]: Start accepts. Automaton has 14 states and 31 transitions. Word has length 7 [2018-06-24 21:40:09,460 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:09,460 INFO ]: Abstraction has 14 states and 31 transitions. [2018-06-24 21:40:09,460 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:40:09,460 INFO ]: Start isEmpty. Operand 14 states and 31 transitions. [2018-06-24 21:40:09,460 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:40:09,460 INFO ]: Found error trace [2018-06-24 21:40:09,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:09,460 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:09,460 INFO ]: Analyzing trace with hash 855386570, now seen corresponding path program 1 times [2018-06-24 21:40:09,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:09,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:09,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,461 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:09,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,471 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,494 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:09,494 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:40:09,494 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:40:09,494 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:40:09,495 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:40:09,495 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:40:09,495 INFO ]: Start difference. First operand 14 states and 31 transitions. Second operand 4 states. [2018-06-24 21:40:09,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:09,521 INFO ]: Finished difference Result 16 states and 32 transitions. [2018-06-24 21:40:09,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:40:09,522 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:40:09,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:09,522 INFO ]: With dead ends: 16 [2018-06-24 21:40:09,522 INFO ]: Without dead ends: 15 [2018-06-24 21:40:09,523 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 21:40:09,523 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:40:09,524 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-24 21:40:09,524 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:40:09,525 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2018-06-24 21:40:09,525 INFO ]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 7 [2018-06-24 21:40:09,525 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:09,525 INFO ]: Abstraction has 14 states and 30 transitions. [2018-06-24 21:40:09,525 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:40:09,525 INFO ]: Start isEmpty. Operand 14 states and 30 transitions. [2018-06-24 21:40:09,525 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:09,525 INFO ]: Found error trace [2018-06-24 21:40:09,525 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:09,525 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:09,525 INFO ]: Analyzing trace with hash 718195338, now seen corresponding path program 1 times [2018-06-24 21:40:09,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:09,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:09,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:09,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,570 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:09,570 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:40:09,570 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:40:09,570 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:40:09,570 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:40:09,570 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:40:09,570 INFO ]: Start difference. First operand 14 states and 30 transitions. Second operand 3 states. [2018-06-24 21:40:09,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:09,580 INFO ]: Finished difference Result 17 states and 37 transitions. [2018-06-24 21:40:09,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:40:09,580 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 21:40:09,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:09,581 INFO ]: With dead ends: 17 [2018-06-24 21:40:09,581 INFO ]: Without dead ends: 15 [2018-06-24 21:40:09,581 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 21:40:09,581 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:40:09,583 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-24 21:40:09,583 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:40:09,583 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2018-06-24 21:40:09,583 INFO ]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 8 [2018-06-24 21:40:09,583 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:09,583 INFO ]: Abstraction has 14 states and 30 transitions. [2018-06-24 21:40:09,583 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:40:09,583 INFO ]: Start isEmpty. Operand 14 states and 30 transitions. [2018-06-24 21:40:09,584 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:09,584 INFO ]: Found error trace [2018-06-24 21:40:09,584 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:09,584 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:09,584 INFO ]: Analyzing trace with hash 718969904, now seen corresponding path program 2 times [2018-06-24 21:40:09,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:09,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:09,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:09,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,594 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,633 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:09,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:40:09,633 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:40:09,634 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:40:09,634 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:40:09,634 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:40:09,634 INFO ]: Start difference. First operand 14 states and 30 transitions. Second operand 5 states. [2018-06-24 21:40:09,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:09,725 INFO ]: Finished difference Result 20 states and 42 transitions. [2018-06-24 21:40:09,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:40:09,726 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 21:40:09,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:09,726 INFO ]: With dead ends: 20 [2018-06-24 21:40:09,726 INFO ]: Without dead ends: 19 [2018-06-24 21:40:09,726 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 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 21:40:09,726 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 21:40:09,729 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-24 21:40:09,729 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 21:40:09,729 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-06-24 21:40:09,729 INFO ]: Start accepts. Automaton has 14 states and 28 transitions. Word has length 8 [2018-06-24 21:40:09,729 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:09,729 INFO ]: Abstraction has 14 states and 28 transitions. [2018-06-24 21:40:09,729 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:40:09,729 INFO ]: Start isEmpty. Operand 14 states and 28 transitions. [2018-06-24 21:40:09,730 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:09,730 INFO ]: Found error trace [2018-06-24 21:40:09,730 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:09,730 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:09,730 INFO ]: Analyzing trace with hash 775513222, now seen corresponding path program 1 times [2018-06-24 21:40:09,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:09,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:09,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:09,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:09,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,836 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:09,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:09,837 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 21:40:09,845 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:09,859 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:09,860 INFO ]: Computing forward predicates... [2018-06-24 21:40:09,912 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:09,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:09,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 21:40:09,932 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:40:09,932 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:40:09,932 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:09,932 INFO ]: Start difference. First operand 14 states and 28 transitions. Second operand 8 states. [2018-06-24 21:40:10,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:10,038 INFO ]: Finished difference Result 19 states and 41 transitions. [2018-06-24 21:40:10,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:40:10,039 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-24 21:40:10,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:10,039 INFO ]: With dead ends: 19 [2018-06-24 21:40:10,039 INFO ]: Without dead ends: 17 [2018-06-24 21:40:10,040 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:40:10,040 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:40:10,042 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-24 21:40:10,042 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:40:10,042 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2018-06-24 21:40:10,042 INFO ]: Start accepts. Automaton has 15 states and 28 transitions. Word has length 8 [2018-06-24 21:40:10,043 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:10,043 INFO ]: Abstraction has 15 states and 28 transitions. [2018-06-24 21:40:10,043 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:40:10,043 INFO ]: Start isEmpty. Operand 15 states and 28 transitions. [2018-06-24 21:40:10,043 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:40:10,043 INFO ]: Found error trace [2018-06-24 21:40:10,043 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:10,043 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:10,043 INFO ]: Analyzing trace with hash 775543013, now seen corresponding path program 1 times [2018-06-24 21:40:10,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:10,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:10,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:10,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:10,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:10,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:10,098 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:10,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:40:10,098 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:40:10,098 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:40:10,098 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:40:10,098 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:40:10,098 INFO ]: Start difference. First operand 15 states and 28 transitions. Second operand 3 states. [2018-06-24 21:40:10,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:10,118 INFO ]: Finished difference Result 18 states and 36 transitions. [2018-06-24 21:40:10,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:40:10,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 21:40:10,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:10,119 INFO ]: With dead ends: 18 [2018-06-24 21:40:10,119 INFO ]: Without dead ends: 16 [2018-06-24 21:40:10,119 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 21:40:10,119 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:40:10,122 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 21:40:10,122 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:40:10,123 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-24 21:40:10,123 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 8 [2018-06-24 21:40:10,123 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:10,123 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-24 21:40:10,123 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:40:10,123 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-24 21:40:10,123 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:40:10,123 INFO ]: Found error trace [2018-06-24 21:40:10,123 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:10,123 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:10,123 INFO ]: Analyzing trace with hash 870193023, now seen corresponding path program 1 times [2018-06-24 21:40:10,123 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:10,123 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:10,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:10,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:10,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:10,139 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:10,342 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:10,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:10,342 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 21:40:10,348 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:10,365 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:10,367 INFO ]: Computing forward predicates... [2018-06-24 21:40:10,427 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:10,445 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:10,445 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-06-24 21:40:10,446 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:40:10,446 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:40:10,446 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:10,446 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 8 states. [2018-06-24 21:40:10,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:10,557 INFO ]: Finished difference Result 22 states and 47 transitions. [2018-06-24 21:40:10,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:40:10,559 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:40:10,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:10,559 INFO ]: With dead ends: 22 [2018-06-24 21:40:10,559 INFO ]: Without dead ends: 22 [2018-06-24 21:40:10,560 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:40:10,560 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:40:10,562 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 21:40:10,562 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:40:10,562 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-06-24 21:40:10,562 INFO ]: Start accepts. Automaton has 16 states and 30 transitions. Word has length 9 [2018-06-24 21:40:10,562 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:10,562 INFO ]: Abstraction has 16 states and 30 transitions. [2018-06-24 21:40:10,562 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:40:10,562 INFO ]: Start isEmpty. Operand 16 states and 30 transitions. [2018-06-24 21:40:10,564 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:40:10,564 INFO ]: Found error trace [2018-06-24 21:40:10,564 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:10,564 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:10,564 INFO ]: Analyzing trace with hash -1649766911, now seen corresponding path program 2 times [2018-06-24 21:40:10,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:10,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:10,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:10,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:10,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:10,574 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:10,614 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:10,615 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:10,615 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 21:40:10,621 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:10,637 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:10,637 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:10,638 INFO ]: Computing forward predicates... [2018-06-24 21:40:10,693 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:10,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:10,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:40:10,714 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:40:10,714 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:40:10,714 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:40:10,714 INFO ]: Start difference. First operand 16 states and 30 transitions. Second operand 10 states. [2018-06-24 21:40:11,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:11,085 INFO ]: Finished difference Result 39 states and 93 transitions. [2018-06-24 21:40:11,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:40:11,085 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-24 21:40:11,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:11,086 INFO ]: With dead ends: 39 [2018-06-24 21:40:11,086 INFO ]: Without dead ends: 31 [2018-06-24 21:40:11,086 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:40:11,086 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:40:11,088 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-24 21:40:11,088 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:40:11,090 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-24 21:40:11,090 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 9 [2018-06-24 21:40:11,090 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:11,090 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-24 21:40:11,090 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:40:11,090 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-24 21:40:11,091 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:40:11,091 INFO ]: Found error trace [2018-06-24 21:40:11,091 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:11,091 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:11,091 INFO ]: Analyzing trace with hash -489700442, now seen corresponding path program 2 times [2018-06-24 21:40:11,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:11,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:11,092 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:11,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:11,101 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:11,396 INFO ]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:11,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:11,396 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 21:40:11,402 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:11,440 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:11,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:11,442 INFO ]: Computing forward predicates... [2018-06-24 21:40:11,523 INFO ]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:11,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:11,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:40:11,542 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:40:11,542 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:40:11,542 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:40:11,542 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 12 states. [2018-06-24 21:40:11,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:11,726 INFO ]: Finished difference Result 36 states and 85 transitions. [2018-06-24 21:40:11,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:40:11,726 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-24 21:40:11,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:11,726 INFO ]: With dead ends: 36 [2018-06-24 21:40:11,726 INFO ]: Without dead ends: 31 [2018-06-24 21:40:11,727 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:40:11,727 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:40:11,729 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-06-24 21:40:11,729 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:40:11,729 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2018-06-24 21:40:11,729 INFO ]: Start accepts. Automaton has 19 states and 37 transitions. Word has length 10 [2018-06-24 21:40:11,729 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:11,729 INFO ]: Abstraction has 19 states and 37 transitions. [2018-06-24 21:40:11,729 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:40:11,729 INFO ]: Start isEmpty. Operand 19 states and 37 transitions. [2018-06-24 21:40:11,730 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:40:11,730 INFO ]: Found error trace [2018-06-24 21:40:11,730 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:11,730 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:11,730 INFO ]: Analyzing trace with hash 1206807635, now seen corresponding path program 1 times [2018-06-24 21:40:11,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:11,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:11,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:11,731 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:11,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:11,740 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:11,802 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:11,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:11,802 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:11,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:11,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:11,837 INFO ]: Computing forward predicates... [2018-06-24 21:40:11,862 INFO ]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:11,881 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:11,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 21:40:11,882 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:40:11,882 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:40:11,882 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:40:11,882 INFO ]: Start difference. First operand 19 states and 37 transitions. Second operand 8 states. [2018-06-24 21:40:11,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:11,998 INFO ]: Finished difference Result 28 states and 59 transitions. [2018-06-24 21:40:11,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:40:11,999 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 21:40:11,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:11,999 INFO ]: With dead ends: 28 [2018-06-24 21:40:11,999 INFO ]: Without dead ends: 22 [2018-06-24 21:40:12,000 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:40:12,000 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:40:12,004 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-24 21:40:12,004 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:40:12,004 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-24 21:40:12,004 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 10 [2018-06-24 21:40:12,004 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:12,004 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-24 21:40:12,004 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:40:12,004 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-24 21:40:12,005 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:40:12,005 INFO ]: Found error trace [2018-06-24 21:40:12,005 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:12,005 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:12,005 INFO ]: Analyzing trace with hash 1869571403, now seen corresponding path program 3 times [2018-06-24 21:40:12,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:12,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:12,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:12,006 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:12,006 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:12,016 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:12,131 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:12,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:12,132 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 21:40:12,138 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:12,159 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:40:12,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:12,161 INFO ]: Computing forward predicates... [2018-06-24 21:40:12,178 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:12,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:12,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:40:12,211 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:40:12,211 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:40:12,211 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:12,211 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 9 states. [2018-06-24 21:40:12,444 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:12,444 INFO ]: Finished difference Result 45 states and 102 transitions. [2018-06-24 21:40:12,445 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:40:12,445 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 21:40:12,445 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:12,445 INFO ]: With dead ends: 45 [2018-06-24 21:40:12,445 INFO ]: Without dead ends: 45 [2018-06-24 21:40:12,446 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:40:12,446 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:40:12,448 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-06-24 21:40:12,448 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:40:12,449 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2018-06-24 21:40:12,449 INFO ]: Start accepts. Automaton has 24 states and 48 transitions. Word has length 11 [2018-06-24 21:40:12,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:12,449 INFO ]: Abstraction has 24 states and 48 transitions. [2018-06-24 21:40:12,449 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:40:12,449 INFO ]: Start isEmpty. Operand 24 states and 48 transitions. [2018-06-24 21:40:12,449 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:40:12,449 INFO ]: Found error trace [2018-06-24 21:40:12,449 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:12,449 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:12,449 INFO ]: Analyzing trace with hash 1951152, now seen corresponding path program 3 times [2018-06-24 21:40:12,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:12,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:12,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:12,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:12,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:12,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:12,516 INFO ]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:12,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:12,516 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 21:40:12,523 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:12,560 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:40:12,560 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:12,562 INFO ]: Computing forward predicates... [2018-06-24 21:40:12,638 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:12,664 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:12,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 21:40:12,665 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:40:12,665 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:40:12,665 INFO ]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:40:12,665 INFO ]: Start difference. First operand 24 states and 48 transitions. Second operand 13 states. [2018-06-24 21:40:13,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:13,062 INFO ]: Finished difference Result 65 states and 165 transitions. [2018-06-24 21:40:13,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:40:13,064 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-24 21:40:13,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:13,065 INFO ]: With dead ends: 65 [2018-06-24 21:40:13,065 INFO ]: Without dead ends: 65 [2018-06-24 21:40:13,065 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:40:13,065 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 21:40:13,068 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 33. [2018-06-24 21:40:13,068 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:40:13,069 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 75 transitions. [2018-06-24 21:40:13,069 INFO ]: Start accepts. Automaton has 33 states and 75 transitions. Word has length 12 [2018-06-24 21:40:13,069 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:13,069 INFO ]: Abstraction has 33 states and 75 transitions. [2018-06-24 21:40:13,069 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:40:13,069 INFO ]: Start isEmpty. Operand 33 states and 75 transitions. [2018-06-24 21:40:13,070 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:40:13,070 INFO ]: Found error trace [2018-06-24 21:40:13,070 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:13,070 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:13,071 INFO ]: Analyzing trace with hash -1836432245, now seen corresponding path program 1 times [2018-06-24 21:40:13,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:13,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:13,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:13,071 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:13,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:13,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:13,170 INFO ]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:13,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:13,170 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 21:40:13,182 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:13,202 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:13,203 INFO ]: Computing forward predicates... [2018-06-24 21:40:13,212 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:40:13,232 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:40:13,232 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-06-24 21:40:13,232 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:40:13,232 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:40:13,232 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:13,232 INFO ]: Start difference. First operand 33 states and 75 transitions. Second operand 9 states. [2018-06-24 21:40:13,367 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:13,367 INFO ]: Finished difference Result 39 states and 76 transitions. [2018-06-24 21:40:13,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:40:13,367 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 21:40:13,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:13,368 INFO ]: With dead ends: 39 [2018-06-24 21:40:13,368 INFO ]: Without dead ends: 31 [2018-06-24 21:40:13,368 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:40:13,368 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 21:40:13,370 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-06-24 21:40:13,370 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:40:13,370 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2018-06-24 21:40:13,370 INFO ]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 12 [2018-06-24 21:40:13,370 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:13,370 INFO ]: Abstraction has 23 states and 34 transitions. [2018-06-24 21:40:13,370 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:40:13,370 INFO ]: Start isEmpty. Operand 23 states and 34 transitions. [2018-06-24 21:40:13,371 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:40:13,371 INFO ]: Found error trace [2018-06-24 21:40:13,371 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:13,371 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:13,371 INFO ]: Analyzing trace with hash -1751468313, now seen corresponding path program 2 times [2018-06-24 21:40:13,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:13,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:13,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:13,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:13,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:13,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:13,552 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:13,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:13,612 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 21:40:13,617 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:13,639 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:13,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:13,640 INFO ]: Computing forward predicates... [2018-06-24 21:40:13,653 INFO ]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:13,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:13,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:40:13,674 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:40:13,675 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:40:13,675 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:40:13,675 INFO ]: Start difference. First operand 23 states and 34 transitions. Second operand 10 states. [2018-06-24 21:40:13,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:13,741 INFO ]: Finished difference Result 42 states and 63 transitions. [2018-06-24 21:40:13,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:40:13,741 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 21:40:13,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:13,742 INFO ]: With dead ends: 42 [2018-06-24 21:40:13,742 INFO ]: Without dead ends: 28 [2018-06-24 21:40:13,742 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:40:13,742 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:40:13,744 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-24 21:40:13,744 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:40:13,744 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-06-24 21:40:13,744 INFO ]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 12 [2018-06-24 21:40:13,744 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:13,744 INFO ]: Abstraction has 20 states and 29 transitions. [2018-06-24 21:40:13,744 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:40:13,744 INFO ]: Start isEmpty. Operand 20 states and 29 transitions. [2018-06-24 21:40:13,745 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:40:13,745 INFO ]: Found error trace [2018-06-24 21:40:13,745 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:13,745 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:13,745 INFO ]: Analyzing trace with hash 2121842822, now seen corresponding path program 4 times [2018-06-24 21:40:13,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:13,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:13,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:13,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:13,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:13,764 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:13,917 INFO ]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:13,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:13,917 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 21:40:13,924 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:13,943 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:13,943 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:13,945 INFO ]: Computing forward predicates... [2018-06-24 21:40:13,969 INFO ]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:13,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:13,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-24 21:40:13,990 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:40:13,990 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:40:13,990 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:40:13,990 INFO ]: Start difference. First operand 20 states and 29 transitions. Second operand 12 states. [2018-06-24 21:40:14,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:14,146 INFO ]: Finished difference Result 32 states and 45 transitions. [2018-06-24 21:40:14,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:40:14,147 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 21:40:14,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:14,147 INFO ]: With dead ends: 32 [2018-06-24 21:40:14,147 INFO ]: Without dead ends: 29 [2018-06-24 21:40:14,147 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:40:14,147 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:40:14,149 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-06-24 21:40:14,149 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:40:14,149 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-06-24 21:40:14,149 INFO ]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 [2018-06-24 21:40:14,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:14,149 INFO ]: Abstraction has 22 states and 30 transitions. [2018-06-24 21:40:14,149 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:40:14,149 INFO ]: Start isEmpty. Operand 22 states and 30 transitions. [2018-06-24 21:40:14,150 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:40:14,150 INFO ]: Found error trace [2018-06-24 21:40:14,150 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:14,150 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:14,150 INFO ]: Analyzing trace with hash -2144495323, now seen corresponding path program 1 times [2018-06-24 21:40:14,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:14,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:14,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:14,151 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:14,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:14,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:14,348 INFO ]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:40:14,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:14,348 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 21:40:14,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:14,373 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:14,374 INFO ]: Computing forward predicates... [2018-06-24 21:40:14,475 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:40:14,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:14,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-06-24 21:40:14,499 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:40:14,499 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:40:14,499 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:40:14,499 INFO ]: Start difference. First operand 22 states and 30 transitions. Second operand 9 states. [2018-06-24 21:40:14,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:14,740 INFO ]: Finished difference Result 31 states and 41 transitions. [2018-06-24 21:40:14,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:40:14,740 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 21:40:14,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:14,740 INFO ]: With dead ends: 31 [2018-06-24 21:40:14,740 INFO ]: Without dead ends: 23 [2018-06-24 21:40:14,740 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:40:14,740 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 21:40:14,741 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-24 21:40:14,741 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:40:14,742 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-06-24 21:40:14,742 INFO ]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 12 [2018-06-24 21:40:14,742 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:14,742 INFO ]: Abstraction has 16 states and 21 transitions. [2018-06-24 21:40:14,742 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:40:14,742 INFO ]: Start isEmpty. Operand 16 states and 21 transitions. [2018-06-24 21:40:14,742 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:40:14,742 INFO ]: Found error trace [2018-06-24 21:40:14,742 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:14,742 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:14,742 INFO ]: Analyzing trace with hash -332837121, now seen corresponding path program 4 times [2018-06-24 21:40:14,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:14,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:14,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:14,743 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:14,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:14,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:15,155 INFO ]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:40:15,155 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:15,155 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 21:40:15,164 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:15,185 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:15,185 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:15,188 INFO ]: Computing forward predicates... [2018-06-24 21:40:15,291 INFO ]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:40:15,312 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:15,312 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-06-24 21:40:15,312 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:40:15,312 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:40:15,312 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:40:15,312 INFO ]: Start difference. First operand 16 states and 21 transitions. Second operand 10 states. [2018-06-24 21:40:15,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:15,447 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-24 21:40:15,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:40:15,447 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-24 21:40:15,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:15,447 INFO ]: With dead ends: 25 [2018-06-24 21:40:15,447 INFO ]: Without dead ends: 21 [2018-06-24 21:40:15,447 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:40:15,447 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:40:15,448 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-24 21:40:15,448 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:40:15,448 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-06-24 21:40:15,449 INFO ]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 13 [2018-06-24 21:40:15,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:15,449 INFO ]: Abstraction has 18 states and 24 transitions. [2018-06-24 21:40:15,449 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:40:15,449 INFO ]: Start isEmpty. Operand 18 states and 24 transitions. [2018-06-24 21:40:15,449 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:40:15,449 INFO ]: Found error trace [2018-06-24 21:40:15,449 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:15,449 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:15,449 INFO ]: Analyzing trace with hash 368227457, now seen corresponding path program 5 times [2018-06-24 21:40:15,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:15,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:15,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:15,450 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:15,450 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:15,459 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:15,536 INFO ]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:15,537 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:15,537 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:15,543 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:40:15,590 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 21:40:15,590 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:15,591 INFO ]: Computing forward predicates... [2018-06-24 21:40:15,614 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:15,636 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:15,636 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:40:15,636 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:40:15,637 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:40:15,637 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:40:15,637 INFO ]: Start difference. First operand 18 states and 24 transitions. Second operand 11 states. [2018-06-24 21:40:15,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:15,720 INFO ]: Finished difference Result 36 states and 47 transitions. [2018-06-24 21:40:15,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:40:15,721 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 21:40:15,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:15,722 INFO ]: With dead ends: 36 [2018-06-24 21:40:15,722 INFO ]: Without dead ends: 36 [2018-06-24 21:40:15,722 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:40:15,722 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 21:40:15,724 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-06-24 21:40:15,724 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:40:15,724 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-06-24 21:40:15,724 INFO ]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2018-06-24 21:40:15,724 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:15,724 INFO ]: Abstraction has 22 states and 29 transitions. [2018-06-24 21:40:15,724 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:40:15,724 INFO ]: Start isEmpty. Operand 22 states and 29 transitions. [2018-06-24 21:40:15,724 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:40:15,725 INFO ]: Found error trace [2018-06-24 21:40:15,725 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:15,725 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:15,725 INFO ]: Analyzing trace with hash 881495974, now seen corresponding path program 5 times [2018-06-24 21:40:15,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:15,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:15,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:15,725 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:15,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:15,735 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:16,894 INFO ]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:16,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:16,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:40:16,909 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:16,968 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:40:16,968 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:16,969 INFO ]: Computing forward predicates... [2018-06-24 21:40:17,022 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:17,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:17,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-24 21:40:17,042 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:40:17,042 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:40:17,042 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:40:17,042 INFO ]: Start difference. First operand 22 states and 29 transitions. Second operand 13 states. [2018-06-24 21:40:17,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:17,134 INFO ]: Finished difference Result 42 states and 54 transitions. [2018-06-24 21:40:17,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:40:17,135 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 21:40:17,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:17,136 INFO ]: With dead ends: 42 [2018-06-24 21:40:17,136 INFO ]: Without dead ends: 42 [2018-06-24 21:40:17,136 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:40:17,136 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 21:40:17,138 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 19. [2018-06-24 21:40:17,138 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:40:17,138 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-24 21:40:17,138 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-06-24 21:40:17,138 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:17,138 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-24 21:40:17,138 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:40:17,138 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-24 21:40:17,138 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:40:17,138 INFO ]: Found error trace [2018-06-24 21:40:17,138 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:17,139 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:17,139 INFO ]: Analyzing trace with hash -1470146544, now seen corresponding path program 6 times [2018-06-24 21:40:17,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:17,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:17,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:17,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:17,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:17,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:17,272 INFO ]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:17,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:17,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:17,278 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:17,305 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 21:40:17,305 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:17,307 INFO ]: Computing forward predicates... [2018-06-24 21:40:17,389 INFO ]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:40:17,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:17,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-06-24 21:40:17,421 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:40:17,421 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:40:17,421 INFO ]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:40:17,421 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 17 states. [2018-06-24 21:40:18,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:18,122 INFO ]: Finished difference Result 43 states and 56 transitions. [2018-06-24 21:40:18,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:40:18,123 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-24 21:40:18,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:18,123 INFO ]: With dead ends: 43 [2018-06-24 21:40:18,123 INFO ]: Without dead ends: 38 [2018-06-24 21:40:18,124 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:40:18,124 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 21:40:18,125 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 19. [2018-06-24 21:40:18,125 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:40:18,125 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-24 21:40:18,125 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2018-06-24 21:40:18,125 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:18,125 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-24 21:40:18,125 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:40:18,126 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-24 21:40:18,126 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:40:18,126 INFO ]: Found error trace [2018-06-24 21:40:18,126 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:18,126 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:18,126 INFO ]: Analyzing trace with hash 1556275595, now seen corresponding path program 6 times [2018-06-24 21:40:18,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:18,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:18,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:18,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:18,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:18,138 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:18,243 INFO ]: Checked inductivity of 25 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:18,243 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:18,243 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:18,249 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:18,299 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:40:18,299 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:18,302 INFO ]: Computing forward predicates... [2018-06-24 21:40:18,449 INFO ]: Checked inductivity of 25 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:40:18,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:18,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-06-24 21:40:18,480 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:40:18,480 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:40:18,480 INFO ]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:40:18,480 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 17 states. [2018-06-24 21:40:18,980 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-06-24 21:40:19,374 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 11 [2018-06-24 21:40:19,717 WARN ]: Spent 194.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 9 [2018-06-24 21:40:19,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:19,909 INFO ]: Finished difference Result 42 states and 55 transitions. [2018-06-24 21:40:19,910 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:40:19,910 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-24 21:40:19,910 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:19,910 INFO ]: With dead ends: 42 [2018-06-24 21:40:19,910 INFO ]: Without dead ends: 37 [2018-06-24 21:40:19,910 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:40:19,910 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:40:19,911 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-06-24 21:40:19,911 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:40:19,911 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-24 21:40:19,911 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2018-06-24 21:40:19,912 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:19,912 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-24 21:40:19,912 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:40:19,912 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-24 21:40:19,912 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:40:19,912 INFO ]: Found error trace [2018-06-24 21:40:19,912 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:19,912 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:19,912 INFO ]: Analyzing trace with hash 1227635019, now seen corresponding path program 7 times [2018-06-24 21:40:19,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:19,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:19,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:19,913 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:19,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:19,924 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:20,043 INFO ]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:20,043 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:20,043 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:20,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:20,074 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:20,076 INFO ]: Computing forward predicates... [2018-06-24 21:40:20,104 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:20,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:20,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 21:40:20,125 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:40:20,125 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:40:20,125 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:40:20,125 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 13 states. [2018-06-24 21:40:20,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:20,271 INFO ]: Finished difference Result 44 states and 56 transitions. [2018-06-24 21:40:20,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:40:20,272 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 21:40:20,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:20,272 INFO ]: With dead ends: 44 [2018-06-24 21:40:20,272 INFO ]: Without dead ends: 44 [2018-06-24 21:40:20,273 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:40:20,273 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:40:20,274 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 24. [2018-06-24 21:40:20,274 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:40:20,275 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-24 21:40:20,275 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2018-06-24 21:40:20,275 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:20,275 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-24 21:40:20,275 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:40:20,275 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-24 21:40:20,275 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:40:20,275 INFO ]: Found error trace [2018-06-24 21:40:20,275 INFO ]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:20,275 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:20,275 INFO ]: Analyzing trace with hash 557440816, now seen corresponding path program 7 times [2018-06-24 21:40:20,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:20,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:20,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:20,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:20,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:20,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:20,388 INFO ]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:20,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:20,388 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:20,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:20,422 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:20,424 INFO ]: Computing forward predicates... [2018-06-24 21:40:20,495 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:20,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:20,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-24 21:40:20,515 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:40:20,515 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:40:20,515 INFO ]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:40:20,515 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 15 states. [2018-06-24 21:40:20,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:20,641 INFO ]: Finished difference Result 51 states and 64 transitions. [2018-06-24 21:40:20,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:40:20,641 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 21:40:20,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:20,641 INFO ]: With dead ends: 51 [2018-06-24 21:40:20,641 INFO ]: Without dead ends: 51 [2018-06-24 21:40:20,642 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:40:20,642 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 21:40:20,643 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 20. [2018-06-24 21:40:20,643 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:40:20,643 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-24 21:40:20,644 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 [2018-06-24 21:40:20,644 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:20,644 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-24 21:40:20,644 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:40:20,644 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-24 21:40:20,644 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:40:20,644 INFO ]: Found error trace [2018-06-24 21:40:20,644 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:20,644 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:20,644 INFO ]: Analyzing trace with hash -598315898, now seen corresponding path program 8 times [2018-06-24 21:40:20,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:20,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:20,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:20,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:20,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:20,655 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:20,802 INFO ]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:20,802 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:20,802 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:20,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:20,845 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:20,846 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:20,848 INFO ]: Computing forward predicates... [2018-06-24 21:40:20,924 INFO ]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:40:20,955 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:20,955 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-06-24 21:40:20,955 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:40:20,955 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:40:20,955 INFO ]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:40:20,955 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 20 states. [2018-06-24 21:40:21,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:21,338 INFO ]: Finished difference Result 55 states and 70 transitions. [2018-06-24 21:40:21,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 21:40:21,339 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-24 21:40:21,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:21,339 INFO ]: With dead ends: 55 [2018-06-24 21:40:21,339 INFO ]: Without dead ends: 49 [2018-06-24 21:40:21,340 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:40:21,340 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:40:21,341 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 21. [2018-06-24 21:40:21,341 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 21:40:21,341 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-24 21:40:21,341 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2018-06-24 21:40:21,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:21,341 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-24 21:40:21,341 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:40:21,341 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-24 21:40:21,341 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:40:21,341 INFO ]: Found error trace [2018-06-24 21:40:21,342 INFO ]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:21,342 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:21,342 INFO ]: Analyzing trace with hash 100500289, now seen corresponding path program 8 times [2018-06-24 21:40:21,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:21,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:21,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:21,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:21,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:21,353 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:22,121 INFO ]: Checked inductivity of 36 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:22,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:22,121 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:22,128 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:22,157 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:22,157 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:22,159 INFO ]: Computing forward predicates... [2018-06-24 21:40:22,285 INFO ]: Checked inductivity of 36 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:40:22,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:22,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2018-06-24 21:40:22,317 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:40:22,317 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:40:22,317 INFO ]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:40:22,317 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 20 states. [2018-06-24 21:40:22,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:22,749 INFO ]: Finished difference Result 59 states and 74 transitions. [2018-06-24 21:40:22,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:40:22,749 INFO ]: Start accepts. Automaton has 20 states. Word has length 17 [2018-06-24 21:40:22,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:22,750 INFO ]: With dead ends: 59 [2018-06-24 21:40:22,750 INFO ]: Without dead ends: 53 [2018-06-24 21:40:22,750 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:40:22,750 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 21:40:22,752 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 20. [2018-06-24 21:40:22,752 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:40:22,752 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-24 21:40:22,752 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 17 [2018-06-24 21:40:22,752 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:22,752 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-24 21:40:22,752 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:40:22,752 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-24 21:40:22,752 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:40:22,752 INFO ]: Found error trace [2018-06-24 21:40:22,753 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:22,753 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:22,753 INFO ]: Analyzing trace with hash -910616961, now seen corresponding path program 9 times [2018-06-24 21:40:22,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:22,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:22,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:22,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:22,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:22,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:23,239 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:40:23,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:23,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:23,244 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:23,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:40:23,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:23,326 INFO ]: Computing forward predicates... [2018-06-24 21:40:23,458 INFO ]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:40:23,477 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:23,477 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-06-24 21:40:23,477 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:40:23,477 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:40:23,477 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:40:23,478 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 12 states. [2018-06-24 21:40:23,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:23,577 INFO ]: Finished difference Result 33 states and 41 transitions. [2018-06-24 21:40:23,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:40:23,577 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-24 21:40:23,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:23,578 INFO ]: With dead ends: 33 [2018-06-24 21:40:23,578 INFO ]: Without dead ends: 27 [2018-06-24 21:40:23,578 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:40:23,578 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:40:23,579 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-06-24 21:40:23,579 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 21:40:23,579 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-06-24 21:40:23,580 INFO ]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 17 [2018-06-24 21:40:23,580 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:23,580 INFO ]: Abstraction has 22 states and 28 transitions. [2018-06-24 21:40:23,580 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:40:23,580 INFO ]: Start isEmpty. Operand 22 states and 28 transitions. [2018-06-24 21:40:23,580 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:40:23,580 INFO ]: Found error trace [2018-06-24 21:40:23,580 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:23,580 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:23,580 INFO ]: Analyzing trace with hash 2104486657, now seen corresponding path program 9 times [2018-06-24 21:40:23,580 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:23,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:23,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:23,581 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:23,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:23,594 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:23,767 INFO ]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:23,767 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:23,767 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:23,772 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:23,818 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:40:23,818 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:23,821 INFO ]: Computing forward predicates... [2018-06-24 21:40:23,935 INFO ]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:40:23,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:23,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-06-24 21:40:23,954 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:40:23,954 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:40:23,954 INFO ]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:40:23,954 INFO ]: Start difference. First operand 22 states and 28 transitions. Second operand 22 states. [2018-06-24 21:40:24,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:24,886 INFO ]: Finished difference Result 68 states and 82 transitions. [2018-06-24 21:40:24,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-24 21:40:24,888 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-24 21:40:24,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:24,888 INFO ]: With dead ends: 68 [2018-06-24 21:40:24,888 INFO ]: Without dead ends: 61 [2018-06-24 21:40:24,889 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=747, Invalid=3035, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 21:40:24,889 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 21:40:24,890 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 28. [2018-06-24 21:40:24,890 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:40:24,891 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-06-24 21:40:24,891 INFO ]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2018-06-24 21:40:24,891 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:24,891 INFO ]: Abstraction has 28 states and 35 transitions. [2018-06-24 21:40:24,891 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:40:24,891 INFO ]: Start isEmpty. Operand 28 states and 35 transitions. [2018-06-24 21:40:24,891 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:40:24,891 INFO ]: Found error trace [2018-06-24 21:40:24,891 INFO ]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:24,891 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:24,892 INFO ]: Analyzing trace with hash -2002015322, now seen corresponding path program 10 times [2018-06-24 21:40:24,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:24,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:24,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:24,892 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:24,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:24,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:25,019 INFO ]: Checked inductivity of 43 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:25,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:25,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:25,026 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:25,086 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:25,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:25,089 INFO ]: Computing forward predicates... [2018-06-24 21:40:25,285 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:25,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:25,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-06-24 21:40:25,304 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:40:25,304 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:40:25,304 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:40:25,304 INFO ]: Start difference. First operand 28 states and 35 transitions. Second operand 17 states. [2018-06-24 21:40:25,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:25,407 INFO ]: Finished difference Result 55 states and 67 transitions. [2018-06-24 21:40:25,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:40:25,407 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 21:40:25,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:25,407 INFO ]: With dead ends: 55 [2018-06-24 21:40:25,407 INFO ]: Without dead ends: 55 [2018-06-24 21:40:25,408 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:40:25,408 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 21:40:25,409 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 23. [2018-06-24 21:40:25,409 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:40:25,409 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-24 21:40:25,409 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2018-06-24 21:40:25,409 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:25,409 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-24 21:40:25,409 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:40:25,409 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-24 21:40:25,410 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:40:25,410 INFO ]: Found error trace [2018-06-24 21:40:25,410 INFO ]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:25,410 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:25,410 INFO ]: Analyzing trace with hash -1933228661, now seen corresponding path program 11 times [2018-06-24 21:40:25,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:25,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:25,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:25,411 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:25,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:25,423 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:25,556 INFO ]: Checked inductivity of 49 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:25,556 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:25,556 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:25,569 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:40:25,621 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:40:25,621 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:25,624 INFO ]: Computing forward predicates... [2018-06-24 21:40:25,650 INFO ]: Checked inductivity of 49 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:25,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:25,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 21:40:25,668 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:40:25,668 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:40:25,669 INFO ]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:40:25,669 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 16 states. [2018-06-24 21:40:25,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:25,783 INFO ]: Finished difference Result 55 states and 67 transitions. [2018-06-24 21:40:25,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:40:25,783 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-24 21:40:25,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:25,783 INFO ]: With dead ends: 55 [2018-06-24 21:40:25,783 INFO ]: Without dead ends: 48 [2018-06-24 21:40:25,783 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:40:25,783 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 21:40:25,784 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 23. [2018-06-24 21:40:25,784 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:40:25,785 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-24 21:40:25,785 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2018-06-24 21:40:25,785 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:25,785 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-24 21:40:25,785 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:40:25,785 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-24 21:40:25,785 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:40:25,785 INFO ]: Found error trace [2018-06-24 21:40:25,785 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:25,785 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:25,785 INFO ]: Analyzing trace with hash -247677621, now seen corresponding path program 10 times [2018-06-24 21:40:25,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:25,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:25,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:25,786 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:25,786 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:25,798 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:25,969 INFO ]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:25,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:25,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:25,974 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:26,007 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:26,007 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:26,009 INFO ]: Computing forward predicates... [2018-06-24 21:40:26,033 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:26,057 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:26,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 21:40:26,057 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:40:26,057 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:40:26,057 INFO ]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:40:26,057 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 17 states. [2018-06-24 21:40:26,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:26,528 INFO ]: Finished difference Result 65 states and 79 transitions. [2018-06-24 21:40:26,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:40:26,529 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 21:40:26,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:26,529 INFO ]: With dead ends: 65 [2018-06-24 21:40:26,529 INFO ]: Without dead ends: 65 [2018-06-24 21:40:26,530 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:40:26,530 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 21:40:26,531 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 30. [2018-06-24 21:40:26,531 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:40:26,531 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-06-24 21:40:26,532 INFO ]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2018-06-24 21:40:26,532 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:26,532 INFO ]: Abstraction has 30 states and 37 transitions. [2018-06-24 21:40:26,532 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:40:26,532 INFO ]: Start isEmpty. Operand 30 states and 37 transitions. [2018-06-24 21:40:26,532 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:40:26,532 INFO ]: Found error trace [2018-06-24 21:40:26,532 INFO ]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:26,532 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:26,532 INFO ]: Analyzing trace with hash 478865584, now seen corresponding path program 12 times [2018-06-24 21:40:26,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:26,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:26,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:26,533 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:26,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:26,551 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:27,003 INFO ]: Checked inductivity of 57 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:27,003 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:27,003 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:27,008 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:27,063 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:40:27,063 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:27,066 INFO ]: Computing forward predicates... [2018-06-24 21:40:27,630 INFO ]: Checked inductivity of 57 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:40:27,661 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:27,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-06-24 21:40:27,662 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:40:27,662 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:40:27,662 INFO ]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:40:27,662 INFO ]: Start difference. First operand 30 states and 37 transitions. Second operand 27 states. [2018-06-24 21:40:28,817 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-24 21:40:28,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:28,921 INFO ]: Finished difference Result 75 states and 90 transitions. [2018-06-24 21:40:28,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-24 21:40:28,922 INFO ]: Start accepts. Automaton has 27 states. Word has length 20 [2018-06-24 21:40:28,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:28,922 INFO ]: With dead ends: 75 [2018-06-24 21:40:28,922 INFO ]: Without dead ends: 67 [2018-06-24 21:40:28,923 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=976, Invalid=3854, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 21:40:28,923 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 21:40:28,924 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 23. [2018-06-24 21:40:28,924 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 21:40:28,924 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-24 21:40:28,924 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 20 [2018-06-24 21:40:28,924 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:28,924 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-24 21:40:28,924 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:40:28,924 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-24 21:40:28,924 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:40:28,924 INFO ]: Found error trace [2018-06-24 21:40:28,924 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:28,925 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:28,925 INFO ]: Analyzing trace with hash 911632518, now seen corresponding path program 11 times [2018-06-24 21:40:28,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:28,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:28,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:28,925 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:28,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:28,937 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:29,171 INFO ]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:29,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:29,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:29,184 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:40:29,289 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:40:29,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:29,291 INFO ]: Computing forward predicates... [2018-06-24 21:40:29,337 INFO ]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:29,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:29,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-06-24 21:40:29,358 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:40:29,358 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:40:29,358 INFO ]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:40:29,358 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 20 states. [2018-06-24 21:40:29,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:29,494 INFO ]: Finished difference Result 66 states and 79 transitions. [2018-06-24 21:40:29,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:40:29,494 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-24 21:40:29,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:29,494 INFO ]: With dead ends: 66 [2018-06-24 21:40:29,494 INFO ]: Without dead ends: 58 [2018-06-24 21:40:29,495 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:40:29,495 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 21:40:29,496 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 24. [2018-06-24 21:40:29,496 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:40:29,496 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-06-24 21:40:29,496 INFO ]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 20 [2018-06-24 21:40:29,496 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:29,496 INFO ]: Abstraction has 24 states and 29 transitions. [2018-06-24 21:40:29,496 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:40:29,496 INFO ]: Start isEmpty. Operand 24 states and 29 transitions. [2018-06-24 21:40:29,496 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:40:29,497 INFO ]: Found error trace [2018-06-24 21:40:29,497 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:29,497 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:29,497 INFO ]: Analyzing trace with hash -34509313, now seen corresponding path program 13 times [2018-06-24 21:40:29,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:29,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:29,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:29,497 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:29,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:29,512 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:29,721 INFO ]: Checked inductivity of 64 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 21:40:29,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:29,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:29,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:29,763 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:29,767 INFO ]: Computing forward predicates... [2018-06-24 21:40:29,876 INFO ]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:40:29,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:29,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-06-24 21:40:29,894 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:40:29,894 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:40:29,894 INFO ]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:40:29,894 INFO ]: Start difference. First operand 24 states and 29 transitions. Second operand 14 states. [2018-06-24 21:40:30,046 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:30,046 INFO ]: Finished difference Result 41 states and 49 transitions. [2018-06-24 21:40:30,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 21:40:30,048 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-24 21:40:30,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:30,048 INFO ]: With dead ends: 41 [2018-06-24 21:40:30,048 INFO ]: Without dead ends: 33 [2018-06-24 21:40:30,048 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:40:30,048 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 21:40:30,049 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-06-24 21:40:30,049 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:40:30,050 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-06-24 21:40:30,050 INFO ]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 21 [2018-06-24 21:40:30,050 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:30,050 INFO ]: Abstraction has 26 states and 32 transitions. [2018-06-24 21:40:30,050 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:40:30,050 INFO ]: Start isEmpty. Operand 26 states and 32 transitions. [2018-06-24 21:40:30,050 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:40:30,050 INFO ]: Found error trace [2018-06-24 21:40:30,050 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:30,050 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:30,050 INFO ]: Analyzing trace with hash -1723453055, now seen corresponding path program 12 times [2018-06-24 21:40:30,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:30,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:30,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:30,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:30,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:30,063 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:30,304 INFO ]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:30,304 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:30,304 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:30,310 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:30,350 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 21:40:30,350 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:30,353 INFO ]: Computing forward predicates... [2018-06-24 21:40:30,552 INFO ]: Checked inductivity of 64 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:40:30,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:30,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2018-06-24 21:40:30,572 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:40:30,572 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:40:30,572 INFO ]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:40:30,572 INFO ]: Start difference. First operand 26 states and 32 transitions. Second operand 28 states. [2018-06-24 21:40:30,904 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-06-24 21:40:32,039 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 21:40:32,733 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:32,733 INFO ]: Finished difference Result 95 states and 111 transitions. [2018-06-24 21:40:32,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-06-24 21:40:32,733 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-24 21:40:32,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:32,733 INFO ]: With dead ends: 95 [2018-06-24 21:40:32,733 INFO ]: Without dead ends: 86 [2018-06-24 21:40:32,735 INFO ]: 0 DeclaredPredicates, 99 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1442, Invalid=6390, Unknown=0, NotChecked=0, Total=7832 [2018-06-24 21:40:32,735 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-24 21:40:32,736 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 34. [2018-06-24 21:40:32,736 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:40:32,736 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-06-24 21:40:32,736 INFO ]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2018-06-24 21:40:32,736 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:32,736 INFO ]: Abstraction has 34 states and 41 transitions. [2018-06-24 21:40:32,737 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:40:32,737 INFO ]: Start isEmpty. Operand 34 states and 41 transitions. [2018-06-24 21:40:32,737 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:40:32,737 INFO ]: Found error trace [2018-06-24 21:40:32,737 INFO ]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:32,737 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:32,737 INFO ]: Analyzing trace with hash 699864998, now seen corresponding path program 14 times [2018-06-24 21:40:32,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:32,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:32,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:32,738 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:32,738 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:32,753 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:32,984 INFO ]: Checked inductivity of 73 backedges. 37 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:32,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:32,984 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:32,990 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:33,028 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:33,028 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:33,031 INFO ]: Computing forward predicates... [2018-06-24 21:40:33,210 INFO ]: Checked inductivity of 73 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:40:33,229 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:33,229 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2018-06-24 21:40:33,229 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:40:33,230 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:40:33,230 INFO ]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:40:33,230 INFO ]: Start difference. First operand 34 states and 41 transitions. Second operand 30 states. [2018-06-24 21:40:34,138 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-06-24 21:40:34,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:34,614 INFO ]: Finished difference Result 79 states and 93 transitions. [2018-06-24 21:40:34,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 21:40:34,635 INFO ]: Start accepts. Automaton has 30 states. Word has length 22 [2018-06-24 21:40:34,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:34,635 INFO ]: With dead ends: 79 [2018-06-24 21:40:34,635 INFO ]: Without dead ends: 70 [2018-06-24 21:40:34,636 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1134, Invalid=4566, Unknown=0, NotChecked=0, Total=5700 [2018-06-24 21:40:34,636 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-24 21:40:34,637 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 27. [2018-06-24 21:40:34,637 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:40:34,637 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-06-24 21:40:34,637 INFO ]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2018-06-24 21:40:34,637 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:34,637 INFO ]: Abstraction has 27 states and 33 transitions. [2018-06-24 21:40:34,637 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:40:34,637 INFO ]: Start isEmpty. Operand 27 states and 33 transitions. [2018-06-24 21:40:34,637 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:40:34,637 INFO ]: Found error trace [2018-06-24 21:40:34,637 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:34,637 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:34,637 INFO ]: Analyzing trace with hash -174263989, now seen corresponding path program 13 times [2018-06-24 21:40:34,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:34,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:34,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:34,638 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:34,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:34,652 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:35,444 INFO ]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:35,444 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:35,444 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:35,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:35,492 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:35,495 INFO ]: Computing forward predicates... [2018-06-24 21:40:35,515 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:35,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:35,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 21:40:35,536 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:40:35,536 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:40:35,536 INFO ]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:40:35,536 INFO ]: Start difference. First operand 27 states and 33 transitions. Second operand 21 states. [2018-06-24 21:40:35,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:35,853 INFO ]: Finished difference Result 90 states and 106 transitions. [2018-06-24 21:40:35,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:40:35,854 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 21:40:35,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:35,854 INFO ]: With dead ends: 90 [2018-06-24 21:40:35,854 INFO ]: Without dead ends: 90 [2018-06-24 21:40:35,854 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=917, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:40:35,854 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-24 21:40:35,856 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 36. [2018-06-24 21:40:35,856 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:40:35,856 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-06-24 21:40:35,856 INFO ]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2018-06-24 21:40:35,856 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:35,856 INFO ]: Abstraction has 36 states and 43 transitions. [2018-06-24 21:40:35,856 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:40:35,856 INFO ]: Start isEmpty. Operand 36 states and 43 transitions. [2018-06-24 21:40:35,856 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:40:35,856 INFO ]: Found error trace [2018-06-24 21:40:35,857 INFO ]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:35,857 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:35,857 INFO ]: Analyzing trace with hash 762110512, now seen corresponding path program 15 times [2018-06-24 21:40:35,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:35,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:35,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:35,857 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:35,857 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:35,872 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:36,365 INFO ]: Checked inductivity of 91 backedges. 46 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:36,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:36,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:40:36,378 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:36,449 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:40:36,449 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:36,452 INFO ]: Computing forward predicates... [2018-06-24 21:40:36,623 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:36,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:36,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 21:40:36,641 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:40:36,642 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:40:36,642 INFO ]: CoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:40:36,642 INFO ]: Start difference. First operand 36 states and 43 transitions. Second operand 31 states. [2018-06-24 21:40:37,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:37,250 INFO ]: Finished difference Result 101 states and 118 transitions. [2018-06-24 21:40:37,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 21:40:37,251 INFO ]: Start accepts. Automaton has 31 states. Word has length 24 [2018-06-24 21:40:37,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:37,251 INFO ]: With dead ends: 101 [2018-06-24 21:40:37,251 INFO ]: Without dead ends: 101 [2018-06-24 21:40:37,251 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=616, Invalid=1640, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 21:40:37,252 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-24 21:40:37,252 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 28. [2018-06-24 21:40:37,252 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:40:37,253 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-06-24 21:40:37,253 INFO ]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2018-06-24 21:40:37,253 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:37,253 INFO ]: Abstraction has 28 states and 34 transitions. [2018-06-24 21:40:37,253 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:40:37,253 INFO ]: Start isEmpty. Operand 28 states and 34 transitions. [2018-06-24 21:40:37,253 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 21:40:37,253 INFO ]: Found error trace [2018-06-24 21:40:37,253 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:37,253 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:37,253 INFO ]: Analyzing trace with hash -1107512186, now seen corresponding path program 14 times [2018-06-24 21:40:37,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:37,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:37,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:37,254 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:37,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:37,270 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:37,544 INFO ]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:37,544 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:37,544 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:37,550 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:37,596 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:37,596 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:37,600 INFO ]: Computing forward predicates... [2018-06-24 21:40:37,786 INFO ]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 21:40:37,817 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:37,817 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 32 [2018-06-24 21:40:37,817 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:40:37,817 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:40:37,818 INFO ]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:40:37,818 INFO ]: Start difference. First operand 28 states and 34 transitions. Second operand 32 states. [2018-06-24 21:40:39,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:39,207 INFO ]: Finished difference Result 127 states and 150 transitions. [2018-06-24 21:40:39,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-06-24 21:40:39,207 INFO ]: Start accepts. Automaton has 32 states. Word has length 24 [2018-06-24 21:40:39,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:39,207 INFO ]: With dead ends: 127 [2018-06-24 21:40:39,207 INFO ]: Without dead ends: 117 [2018-06-24 21:40:39,208 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1401, Invalid=6081, Unknown=0, NotChecked=0, Total=7482 [2018-06-24 21:40:39,209 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-24 21:40:39,210 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 29. [2018-06-24 21:40:39,210 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:40:39,210 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-06-24 21:40:39,210 INFO ]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2018-06-24 21:40:39,210 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:39,210 INFO ]: Abstraction has 29 states and 35 transitions. [2018-06-24 21:40:39,210 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:40:39,210 INFO ]: Start isEmpty. Operand 29 states and 35 transitions. [2018-06-24 21:40:39,211 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:40:39,211 INFO ]: Found error trace [2018-06-24 21:40:39,211 INFO ]: trace histogram [9, 8, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:39,211 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:39,211 INFO ]: Analyzing trace with hash -2144673727, now seen corresponding path program 16 times [2018-06-24 21:40:39,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:39,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:39,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:39,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:39,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:39,228 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:39,625 INFO ]: Checked inductivity of 100 backedges. 46 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:39,625 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:39,692 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:39,698 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:39,742 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:39,742 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:39,744 INFO ]: Computing forward predicates... [2018-06-24 21:40:40,021 INFO ]: Checked inductivity of 100 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:40:40,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:40,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-24 21:40:40,040 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:40:40,040 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:40:40,040 INFO ]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:40:40,040 INFO ]: Start difference. First operand 29 states and 35 transitions. Second operand 30 states. [2018-06-24 21:40:40,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:40,254 INFO ]: Finished difference Result 99 states and 114 transitions. [2018-06-24 21:40:40,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:40:40,254 INFO ]: Start accepts. Automaton has 30 states. Word has length 25 [2018-06-24 21:40:40,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:40,255 INFO ]: With dead ends: 99 [2018-06-24 21:40:40,255 INFO ]: Without dead ends: 89 [2018-06-24 21:40:40,255 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=352, Invalid=1288, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:40:40,255 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 21:40:40,257 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 28. [2018-06-24 21:40:40,257 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:40:40,257 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-06-24 21:40:40,257 INFO ]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 25 [2018-06-24 21:40:40,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:40,257 INFO ]: Abstraction has 28 states and 33 transitions. [2018-06-24 21:40:40,257 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:40:40,257 INFO ]: Start isEmpty. Operand 28 states and 33 transitions. [2018-06-24 21:40:40,257 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:40:40,257 INFO ]: Found error trace [2018-06-24 21:40:40,257 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:40,258 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:40,258 INFO ]: Analyzing trace with hash -1925819009, now seen corresponding path program 17 times [2018-06-24 21:40:40,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:40,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:40,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:40,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:40,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:40,275 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:40,504 INFO ]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:40:40,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:40,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:40,509 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:40:40,559 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 21:40:40,559 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:40,564 INFO ]: Computing forward predicates... [2018-06-24 21:40:40,704 INFO ]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 21:40:40,726 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:40,726 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2018-06-24 21:40:40,726 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:40:40,726 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:40:40,726 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:40:40,726 INFO ]: Start difference. First operand 28 states and 33 transitions. Second operand 16 states. [2018-06-24 21:40:40,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:40,954 INFO ]: Finished difference Result 49 states and 57 transitions. [2018-06-24 21:40:40,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 21:40:40,954 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-24 21:40:40,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:40,954 INFO ]: With dead ends: 49 [2018-06-24 21:40:40,954 INFO ]: Without dead ends: 39 [2018-06-24 21:40:40,954 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:40:40,954 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 21:40:40,955 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-06-24 21:40:40,956 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:40:40,956 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-06-24 21:40:40,956 INFO ]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2018-06-24 21:40:40,956 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:40,956 INFO ]: Abstraction has 30 states and 36 transitions. [2018-06-24 21:40:40,956 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:40:40,956 INFO ]: Start isEmpty. Operand 30 states and 36 transitions. [2018-06-24 21:40:40,956 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:40:40,956 INFO ]: Found error trace [2018-06-24 21:40:40,956 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:40,956 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:40,956 INFO ]: Analyzing trace with hash 563709953, now seen corresponding path program 15 times [2018-06-24 21:40:40,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:40,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:40,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:40,957 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:40,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:40,971 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:41,774 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:41,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:41,774 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:41,779 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:41,829 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:40:41,829 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:41,832 INFO ]: Computing forward predicates... [2018-06-24 21:40:42,425 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:42,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:42,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-24 21:40:42,443 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:40:42,443 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:40:42,443 INFO ]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:40:42,443 INFO ]: Start difference. First operand 30 states and 36 transitions. Second operand 32 states. [2018-06-24 21:40:42,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:42,827 INFO ]: Finished difference Result 105 states and 122 transitions. [2018-06-24 21:40:42,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:40:42,827 INFO ]: Start accepts. Automaton has 32 states. Word has length 25 [2018-06-24 21:40:42,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:42,828 INFO ]: With dead ends: 105 [2018-06-24 21:40:42,828 INFO ]: Without dead ends: 105 [2018-06-24 21:40:42,829 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=760, Invalid=1790, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 21:40:42,829 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-24 21:40:42,832 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 40. [2018-06-24 21:40:42,832 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 21:40:42,832 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-06-24 21:40:42,832 INFO ]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 25 [2018-06-24 21:40:42,832 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:42,832 INFO ]: Abstraction has 40 states and 47 transitions. [2018-06-24 21:40:42,832 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:40:42,832 INFO ]: Start isEmpty. Operand 40 states and 47 transitions. [2018-06-24 21:40:42,832 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:40:42,832 INFO ]: Found error trace [2018-06-24 21:40:42,833 INFO ]: trace histogram [9, 9, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:42,833 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:42,833 INFO ]: Analyzing trace with hash -1523526746, now seen corresponding path program 18 times [2018-06-24 21:40:42,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:42,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:42,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:42,833 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:42,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:42,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:43,019 INFO ]: Checked inductivity of 111 backedges. 56 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:43,019 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:43,019 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:43,024 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:40:43,073 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:40:43,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:43,076 INFO ]: Computing forward predicates... [2018-06-24 21:40:43,110 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:43,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:43,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-24 21:40:43,128 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:40:43,128 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:40:43,128 INFO ]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:40:43,128 INFO ]: Start difference. First operand 40 states and 47 transitions. Second operand 25 states. [2018-06-24 21:40:43,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:43,420 INFO ]: Finished difference Result 117 states and 135 transitions. [2018-06-24 21:40:43,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 21:40:43,420 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 21:40:43,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:43,420 INFO ]: With dead ends: 117 [2018-06-24 21:40:43,420 INFO ]: Without dead ends: 117 [2018-06-24 21:40:43,421 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=660, Invalid=1232, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 21:40:43,421 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-24 21:40:43,422 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 31. [2018-06-24 21:40:43,422 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:40:43,422 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-24 21:40:43,422 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2018-06-24 21:40:43,422 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:43,422 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-24 21:40:43,422 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:40:43,422 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-24 21:40:43,423 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:40:43,423 INFO ]: Found error trace [2018-06-24 21:40:43,423 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:43,423 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:43,423 INFO ]: Analyzing trace with hash 294843536, now seen corresponding path program 16 times [2018-06-24 21:40:43,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:43,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:43,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:43,423 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:43,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:43,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:43,680 INFO ]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:43,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:43,680 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:43,688 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:40:43,737 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:40:43,737 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:43,740 INFO ]: Computing forward predicates... [2018-06-24 21:40:43,820 INFO ]: Checked inductivity of 110 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:43,840 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:43,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-24 21:40:43,840 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:40:43,840 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:40:43,840 INFO ]: CoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:40:43,840 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 26 states. [2018-06-24 21:40:44,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:44,067 INFO ]: Finished difference Result 97 states and 113 transitions. [2018-06-24 21:40:44,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:40:44,067 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-24 21:40:44,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:44,068 INFO ]: With dead ends: 97 [2018-06-24 21:40:44,068 INFO ]: Without dead ends: 86 [2018-06-24 21:40:44,068 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:40:44,068 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-24 21:40:44,069 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 31. [2018-06-24 21:40:44,069 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:40:44,069 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-24 21:40:44,069 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2018-06-24 21:40:44,070 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:44,070 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-24 21:40:44,070 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:40:44,070 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-24 21:40:44,070 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:40:44,070 INFO ]: Found error trace [2018-06-24 21:40:44,070 INFO ]: trace histogram [10, 9, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:44,070 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:44,070 INFO ]: Analyzing trace with hash 15015307, now seen corresponding path program 19 times [2018-06-24 21:40:44,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:44,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:44,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:44,070 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:44,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:44,085 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:44,495 INFO ]: Checked inductivity of 121 backedges. 65 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:40:44,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:44,495 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:44,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:44,558 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:44,562 INFO ]: Computing forward predicates... [2018-06-24 21:40:44,644 INFO ]: Checked inductivity of 121 backedges. 45 proven. 73 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:40:44,664 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:44,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 21:40:44,664 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:40:44,665 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:40:44,665 INFO ]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:40:44,665 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 24 states. [2018-06-24 21:40:44,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:44,859 INFO ]: Finished difference Result 105 states and 121 transitions. [2018-06-24 21:40:44,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:40:44,859 INFO ]: Start accepts. Automaton has 24 states. Word has length 27 [2018-06-24 21:40:44,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:44,860 INFO ]: With dead ends: 105 [2018-06-24 21:40:44,860 INFO ]: Without dead ends: 94 [2018-06-24 21:40:44,860 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:40:44,860 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-24 21:40:44,861 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 31. [2018-06-24 21:40:44,861 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:40:44,861 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-24 21:40:44,861 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 27 [2018-06-24 21:40:44,861 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:44,861 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-24 21:40:44,861 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:40:44,861 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-24 21:40:44,861 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:40:44,861 INFO ]: Found error trace [2018-06-24 21:40:44,861 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:44,861 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:44,861 INFO ]: Analyzing trace with hash 21550411, now seen corresponding path program 17 times [2018-06-24 21:40:44,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:44,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:44,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:44,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:40:44,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:44,873 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:45,229 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:45,229 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:45,229 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:45,235 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:40:45,296 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 21:40:45,296 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:45,300 INFO ]: Computing forward predicates... [2018-06-24 21:40:45,600 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 21:40:45,619 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:45,619 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-06-24 21:40:45,619 INFO ]: Interpolant automaton has 37 states [2018-06-24 21:40:45,619 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 21:40:45,619 INFO ]: CoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:40:45,619 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 37 states. [2018-06-24 21:40:48,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:48,227 INFO ]: Finished difference Result 142 states and 161 transitions. [2018-06-24 21:40:48,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-06-24 21:40:48,228 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-24 21:40:48,228 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:48,228 INFO ]: With dead ends: 142 [2018-06-24 21:40:48,228 INFO ]: Without dead ends: 130 [2018-06-24 21:40:48,230 INFO ]: 0 DeclaredPredicates, 150 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5440 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3202, Invalid=15430, Unknown=0, NotChecked=0, Total=18632 [2018-06-24 21:40:48,230 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-24 21:40:48,231 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 43. [2018-06-24 21:40:48,231 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 21:40:48,231 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-24 21:40:48,232 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 27 [2018-06-24 21:40:48,232 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:48,232 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-24 21:40:48,232 INFO ]: Interpolant automaton has 37 states. [2018-06-24 21:40:48,232 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-24 21:40:48,232 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 21:40:48,232 INFO ]: Found error trace [2018-06-24 21:40:48,232 INFO ]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:48,232 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:48,232 INFO ]: Analyzing trace with hash -63190096, now seen corresponding path program 20 times [2018-06-24 21:40:48,232 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:48,232 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:48,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,232 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:48,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:48,247 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:48,624 INFO ]: Checked inductivity of 133 backedges. 67 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:48,624 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:48,624 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:48,632 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:40:48,683 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:40:48,683 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:48,687 INFO ]: Computing forward predicates... [2018-06-24 21:40:48,966 INFO ]: Checked inductivity of 133 backedges. 3 proven. 75 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 21:40:48,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:48,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 39 [2018-06-24 21:40:48,985 INFO ]: Interpolant automaton has 39 states [2018-06-24 21:40:48,985 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 21:40:48,985 INFO ]: CoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:40:48,985 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 39 states. [2018-06-24 21:40:51,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:40:51,273 INFO ]: Finished difference Result 110 states and 127 transitions. [2018-06-24 21:40:51,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-06-24 21:40:51,273 INFO ]: Start accepts. Automaton has 39 states. Word has length 28 [2018-06-24 21:40:51,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:40:51,273 INFO ]: With dead ends: 110 [2018-06-24 21:40:51,273 INFO ]: Without dead ends: 98 [2018-06-24 21:40:51,274 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2539, Invalid=11267, Unknown=0, NotChecked=0, Total=13806 [2018-06-24 21:40:51,274 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-24 21:40:51,275 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 32. [2018-06-24 21:40:51,275 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:40:51,276 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-06-24 21:40:51,276 INFO ]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2018-06-24 21:40:51,276 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:40:51,276 INFO ]: Abstraction has 32 states and 37 transitions. [2018-06-24 21:40:51,276 INFO ]: Interpolant automaton has 39 states. [2018-06-24 21:40:51,276 INFO ]: Start isEmpty. Operand 32 states and 37 transitions. [2018-06-24 21:40:51,276 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:40:51,276 INFO ]: Found error trace [2018-06-24 21:40:51,276 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:40:51,276 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:40:51,276 INFO ]: Analyzing trace with hash -1897149185, now seen corresponding path program 21 times [2018-06-24 21:40:51,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:40:51,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:40:51,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:51,277 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:40:51,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:40:51,294 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:51,635 INFO ]: Checked inductivity of 144 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 21:40:51,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:40:51,635 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:40:51,641 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:40:51,711 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 21:40:51,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:40:51,718 INFO ]: Computing forward predicates... [2018-06-24 21:40:53,703 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:40:53,735 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:40:53,735 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27] total 42 [2018-06-24 21:40:53,736 INFO ]: Interpolant automaton has 42 states [2018-06-24 21:40:53,736 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 21:40:53,736 INFO ]: CoverageRelationStatistics Valid=108, Invalid=1614, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:40:53,736 INFO ]: Start difference. First operand 32 states and 37 transitions. Second operand 42 states. [2018-06-24 21:40:55,860 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-06-24 21:40:57,739 WARN ]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-06-24 21:40:58,697 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-06-24 21:41:00,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:00,490 INFO ]: Finished difference Result 57 states and 64 transitions. [2018-06-24 21:41:00,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:41:00,490 INFO ]: Start accepts. Automaton has 42 states. Word has length 29 [2018-06-24 21:41:00,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:00,490 INFO ]: With dead ends: 57 [2018-06-24 21:41:00,490 INFO ]: Without dead ends: 44 [2018-06-24 21:41:00,490 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=408, Invalid=3252, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 21:41:00,490 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:41:00,491 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-06-24 21:41:00,491 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:41:00,491 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-06-24 21:41:00,492 INFO ]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 29 [2018-06-24 21:41:00,492 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:00,492 INFO ]: Abstraction has 33 states and 39 transitions. [2018-06-24 21:41:00,492 INFO ]: Interpolant automaton has 42 states. [2018-06-24 21:41:00,492 INFO ]: Start isEmpty. Operand 33 states and 39 transitions. [2018-06-24 21:41:00,492 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:41:00,492 INFO ]: Found error trace [2018-06-24 21:41:00,492 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:00,492 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:00,492 INFO ]: Analyzing trace with hash 26078849, now seen corresponding path program 18 times [2018-06-24 21:41:00,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:00,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:00,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:00,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:00,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:00,506 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:00,744 INFO ]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:00,744 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:00,744 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:41:00,750 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:41:00,810 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:41:00,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:00,815 INFO ]: Computing forward predicates... [2018-06-24 21:41:01,109 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:01,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:01,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-06-24 21:41:01,144 INFO ]: Interpolant automaton has 39 states [2018-06-24 21:41:01,145 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 21:41:01,145 INFO ]: CoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:41:01,145 INFO ]: Start difference. First operand 33 states and 39 transitions. Second operand 39 states. [2018-06-24 21:41:01,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:01,732 INFO ]: Finished difference Result 135 states and 154 transitions. [2018-06-24 21:41:01,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:41:01,732 INFO ]: Start accepts. Automaton has 39 states. Word has length 29 [2018-06-24 21:41:01,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:01,732 INFO ]: With dead ends: 135 [2018-06-24 21:41:01,732 INFO ]: Without dead ends: 135 [2018-06-24 21:41:01,733 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1017, Invalid=2765, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 21:41:01,733 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-24 21:41:01,735 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 45. [2018-06-24 21:41:01,735 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 21:41:01,735 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-24 21:41:01,735 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 29 [2018-06-24 21:41:01,735 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:01,735 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-24 21:41:01,735 INFO ]: Interpolant automaton has 39 states. [2018-06-24 21:41:01,735 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-24 21:41:01,736 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:41:01,736 INFO ]: Found error trace [2018-06-24 21:41:01,736 INFO ]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:01,736 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:01,736 INFO ]: Analyzing trace with hash 194830246, now seen corresponding path program 22 times [2018-06-24 21:41:01,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:01,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:01,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:01,736 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:01,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:01,754 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:01,994 INFO ]: Checked inductivity of 157 backedges. 79 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:01,994 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:41:01,994 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:41:01,999 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:41:02,053 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:41:02,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:41:02,056 INFO ]: Computing forward predicates... [2018-06-24 21:41:02,100 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:41:02,118 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:41:02,118 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-24 21:41:02,118 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:41:02,118 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:41:02,118 INFO ]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:41:02,118 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 29 states. [2018-06-24 21:41:02,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:41:02,525 INFO ]: Finished difference Result 149 states and 169 transitions. [2018-06-24 21:41:02,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 21:41:02,525 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 21:41:02,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:41:02,526 INFO ]: With dead ends: 149 [2018-06-24 21:41:02,526 INFO ]: Without dead ends: 149 [2018-06-24 21:41:02,526 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=923, Invalid=1729, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 21:41:02,526 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-24 21:41:02,528 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 34. [2018-06-24 21:41:02,528 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:41:02,528 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-06-24 21:41:02,528 INFO ]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 30 [2018-06-24 21:41:02,528 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:41:02,528 INFO ]: Abstraction has 34 states and 40 transitions. [2018-06-24 21:41:02,528 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:41:02,528 INFO ]: Start isEmpty. Operand 34 states and 40 transitions. [2018-06-24 21:41:02,528 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 21:41:02,528 INFO ]: Found error trace [2018-06-24 21:41:02,528 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 21:41:02,528 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:41:02,528 INFO ]: Analyzing trace with hash 808148496, now seen corresponding path program 19 times [2018-06-24 21:41:02,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:41:02,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:41:02,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:02,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:41:02,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:41:02,547 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 21:41:02,793 WARN ]: Verification canceled [2018-06-24 21:41:02,794 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:41:02,795 WARN ]: Timeout [2018-06-24 21:41:02,795 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:41:02 BasicIcfg [2018-06-24 21:41:02,795 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:41:02,796 INFO ]: Toolchain (without parser) took 56679.70 ms. Allocated memory was 305.7 MB in the beginning and 802.7 MB in the end (delta: 497.0 MB). Free memory was 261.0 MB in the beginning and 540.0 MB in the end (delta: -279.0 MB). Peak memory consumption was 218.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:41:02,796 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:41:02,796 INFO ]: ChcToBoogie took 62.25 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:41:02,797 INFO ]: Boogie Preprocessor took 35.60 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:41:02,797 INFO ]: RCFGBuilder took 292.13 ms. Allocated memory is still 305.7 MB. Free memory was 257.0 MB in the beginning and 248.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:41:02,797 INFO ]: BlockEncodingV2 took 71.40 ms. Allocated memory is still 305.7 MB. Free memory was 247.0 MB in the beginning and 245.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:41:02,798 INFO ]: TraceAbstraction took 56206.15 ms. Allocated memory was 305.7 MB in the beginning and 802.7 MB in the end (delta: 497.0 MB). Free memory was 245.0 MB in the beginning and 540.0 MB in the end (delta: -295.1 MB). Peak memory consumption was 202.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:41:02,802 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 16 edges - StatisticsResult: Encoded RCFG 7 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.25 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.60 ms. Allocated memory is still 305.7 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 292.13 ms. Allocated memory is still 305.7 MB. Free memory was 257.0 MB in the beginning and 248.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 71.40 ms. Allocated memory is still 305.7 MB. Free memory was 247.0 MB in the beginning and 245.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56206.15 ms. Allocated memory was 305.7 MB in the beginning and 802.7 MB in the end (delta: 497.0 MB). Free memory was 245.0 MB in the beginning and 540.0 MB in the end (delta: -295.1 MB). Peak memory consumption was 202.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 31 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 56.1s OverallTime, 53 OverallIterations, 12 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 376 SDtfs, 624 SDslu, 2652 SDs, 0 SdLazy, 10181 SolverSat, 2550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2318 GetRequests, 665 SyntacticMatches, 38 SemanticMatches, 1615 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22815 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=51, 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.1s AutomataMinimizationTime, 52 MinimizatonAttempts, 1557 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 1703 NumberOfCodeBlocks, 1703 NumberOfCodeBlocksAsserted, 182 NumberOfCheckSat, 1604 ConstructedInterpolants, 18 QuantifiedInterpolants, 194133 SizeOfPredicates, 217 NumberOfNonLiveVariables, 14981 ConjunctsInSsa, 2915 ConjunctsInUnsatCore, 99 InterpolantComputations, 6 PerfectInterpolantSequences, 2246/4900 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-41-02-813.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-41-02-813.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-41-02-813.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2-big.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-41-02-813.csv Completed graceful shutdown