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/vmt-chc-benchmarks/conc/fib_bench_safe_v2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:12:08,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:12:08,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:12:08,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:12:08,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:12:08,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:12:08,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:12:08,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:12:08,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:12:08,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:12:08,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:12:08,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:12:08,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:12:08,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:12:08,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:12:08,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:12:08,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:12:08,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:12:08,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:12:08,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:12:08,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:12:08,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:12:08,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:12:08,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:12:08,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:12:08,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:12:08,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:12:08,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:12:08,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:12:08,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:12:08,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:12:08,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:12:08,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:12:08,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:12:08,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:12:08,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:12:08,636 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:12:08,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:12:08,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:12:08,649 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:12:08,650 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:12:08,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:12:08,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:12:08,651 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:12:08,651 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:12:08,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:12:08,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:12:08,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:12:08,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:12:08,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:12:08,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:12:08,653 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:12:08,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:12:08,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:12:08,653 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:12:08,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:12:08,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:12:08,654 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:12:08,655 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:12:08,655 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:12:08,699 INFO ]: Repository-Root is: /tmp [2018-06-26 21:12:08,719 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:12:08,722 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:12:08,724 INFO ]: Initializing SmtParser... [2018-06-26 21:12:08,724 INFO ]: SmtParser initialized [2018-06-26 21:12:08,725 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v2.smt2 [2018-06-26 21:12:08,726 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-26 21:12:08,812 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v2.smt2 unknown [2018-06-26 21:12:09,041 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/conc/fib_bench_safe_v2.smt2 [2018-06-26 21:12:09,047 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:12:09,052 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:12:09,052 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:12:09,052 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:12:09,056 INFO ]: ChcToBoogie initialized [2018-06-26 21:12:09,059 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,114 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09 Unit [2018-06-26 21:12:09,114 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:12:09,115 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:12:09,115 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:12:09,115 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:12:09,136 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,136 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,142 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,142 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,144 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,158 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,159 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,161 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:12:09,161 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:12:09,161 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:12:09,161 INFO ]: RCFGBuilder initialized [2018-06-26 21:12:09,162 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:12:09,186 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:12:09,186 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:12:09,186 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:12:09,187 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:12:09,187 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:12:09,187 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:12:09,363 INFO ]: Using library mode [2018-06-26 21:12:09,364 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:12:09 BoogieIcfgContainer [2018-06-26 21:12:09,364 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:12:09,364 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:12:09,364 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:12:09,365 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:12:09,366 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:12:09" (1/1) ... [2018-06-26 21:12:09,380 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:12:09,381 INFO ]: Using Remove infeasible edges [2018-06-26 21:12:09,382 INFO ]: Using Maximize final states [2018-06-26 21:12:09,382 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:12:09,382 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:12:09,384 INFO ]: Using Remove sink states [2018-06-26 21:12:09,385 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:12:09,385 INFO ]: Using Use SBE [2018-06-26 21:12:09,422 WARN ]: expecting exponential blowup for input size 19 [2018-06-26 21:12:29,146 INFO ]: SBE split 2 edges [2018-06-26 21:12:29,159 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:12:29,162 INFO ]: 0 new accepting states [2018-06-26 21:12:29,594 INFO ]: Removed 35 edges and 2 locations by large block encoding [2018-06-26 21:12:29,596 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:12:29,614 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:12:29,614 INFO ]: 0 new accepting states [2018-06-26 21:12:29,614 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:12:29,614 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:12:29,642 INFO ]: Encoded RCFG 6 locations, 200 edges [2018-06-26 21:12:29,642 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:12:29 BasicIcfg [2018-06-26 21:12:29,642 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:12:29,643 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:12:29,643 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:12:29,652 INFO ]: TraceAbstraction initialized [2018-06-26 21:12:29,652 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:12:09" (1/4) ... [2018-06-26 21:12:29,653 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9e4e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:12:29, skipping insertion in model container [2018-06-26 21:12:29,653 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:12:09" (2/4) ... [2018-06-26 21:12:29,653 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9e4e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:12:29, skipping insertion in model container [2018-06-26 21:12:29,653 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:12:09" (3/4) ... [2018-06-26 21:12:29,654 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9e4e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:12:29, skipping insertion in model container [2018-06-26 21:12:29,654 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:12:29" (4/4) ... [2018-06-26 21:12:29,655 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:12:29,665 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:12:29,670 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:12:29,712 INFO ]: Using default assertion order modulation [2018-06-26 21:12:29,712 INFO ]: Interprodecural is true [2018-06-26 21:12:29,712 INFO ]: Hoare is false [2018-06-26 21:12:29,712 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:12:29,712 INFO ]: Backedges is TWOTRACK [2018-06-26 21:12:29,712 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:12:29,712 INFO ]: Difference is false [2018-06-26 21:12:29,712 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:12:29,712 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:12:29,721 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:12:29,731 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:12:29,731 INFO ]: Found error trace [2018-06-26 21:12:29,731 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:12:29,732 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:29,736 INFO ]: Analyzing trace with hash 41459745, now seen corresponding path program 1 times [2018-06-26 21:12:29,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:29,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:29,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:29,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:29,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:29,803 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:29,851 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:29,852 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:29,853 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:29,854 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:29,865 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:29,865 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:29,868 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:12:31,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:31,085 INFO ]: Finished difference Result 7 states and 344 transitions. [2018-06-26 21:12:31,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:31,086 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:12:31,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:31,096 INFO ]: With dead ends: 7 [2018-06-26 21:12:31,096 INFO ]: Without dead ends: 7 [2018-06-26 21:12:31,098 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-26 21:12:31,114 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:12:31,150 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:12:31,151 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:12:31,153 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 344 transitions. [2018-06-26 21:12:31,156 INFO ]: Start accepts. Automaton has 7 states and 344 transitions. Word has length 5 [2018-06-26 21:12:31,157 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:31,157 INFO ]: Abstraction has 7 states and 344 transitions. [2018-06-26 21:12:31,157 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:31,157 INFO ]: Start isEmpty. Operand 7 states and 344 transitions. [2018-06-26 21:12:31,158 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:12:31,158 INFO ]: Found error trace [2018-06-26 21:12:31,158 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:12:31,158 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:31,158 INFO ]: Analyzing trace with hash 41519327, now seen corresponding path program 1 times [2018-06-26 21:12:31,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:31,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:31,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:31,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:31,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:31,167 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:31,241 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:31,242 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:31,242 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:31,243 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:31,243 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:31,243 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:31,243 INFO ]: Start difference. First operand 7 states and 344 transitions. Second operand 3 states. [2018-06-26 21:12:32,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:32,180 INFO ]: Finished difference Result 8 states and 485 transitions. [2018-06-26 21:12:32,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:32,180 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:12:32,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:32,181 INFO ]: With dead ends: 8 [2018-06-26 21:12:32,181 INFO ]: Without dead ends: 8 [2018-06-26 21:12:32,182 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-26 21:12:32,182 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 21:12:32,191 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 21:12:32,191 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:12:32,192 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 485 transitions. [2018-06-26 21:12:32,192 INFO ]: Start accepts. Automaton has 8 states and 485 transitions. Word has length 5 [2018-06-26 21:12:32,192 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:32,192 INFO ]: Abstraction has 8 states and 485 transitions. [2018-06-26 21:12:32,192 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:32,192 INFO ]: Start isEmpty. Operand 8 states and 485 transitions. [2018-06-26 21:12:32,193 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:12:32,193 INFO ]: Found error trace [2018-06-26 21:12:32,193 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:12:32,193 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:32,193 INFO ]: Analyzing trace with hash 1281718657, now seen corresponding path program 1 times [2018-06-26 21:12:32,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:32,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:32,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:32,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:32,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:32,202 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:32,219 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:32,219 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:32,219 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:32,219 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:32,219 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:32,219 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:32,219 INFO ]: Start difference. First operand 8 states and 485 transitions. Second operand 3 states. [2018-06-26 21:12:32,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:32,726 INFO ]: Finished difference Result 11 states and 673 transitions. [2018-06-26 21:12:32,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:32,726 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:12:32,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:32,727 INFO ]: With dead ends: 11 [2018-06-26 21:12:32,727 INFO ]: Without dead ends: 11 [2018-06-26 21:12:32,728 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-26 21:12:32,728 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 21:12:32,731 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 21:12:32,731 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 21:12:32,734 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 673 transitions. [2018-06-26 21:12:32,734 INFO ]: Start accepts. Automaton has 11 states and 673 transitions. Word has length 6 [2018-06-26 21:12:32,735 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:32,735 INFO ]: Abstraction has 11 states and 673 transitions. [2018-06-26 21:12:32,735 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:32,735 INFO ]: Start isEmpty. Operand 11 states and 673 transitions. [2018-06-26 21:12:32,735 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:12:32,735 INFO ]: Found error trace [2018-06-26 21:12:32,735 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:12:32,735 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:32,736 INFO ]: Analyzing trace with hash 1282642178, now seen corresponding path program 1 times [2018-06-26 21:12:32,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:32,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:32,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:32,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:32,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:32,750 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:32,782 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:32,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:32,782 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-26 21:12:32,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:32,857 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:32,863 INFO ]: Computing forward predicates... [2018-06-26 21:12:32,893 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:32,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:32,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:12:32,925 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:12:32,925 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:12:32,926 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:12:32,926 INFO ]: Start difference. First operand 11 states and 673 transitions. Second operand 5 states. [2018-06-26 21:12:35,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:35,461 INFO ]: Finished difference Result 23 states and 1967 transitions. [2018-06-26 21:12:35,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:12:35,462 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:12:35,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:35,464 INFO ]: With dead ends: 23 [2018-06-26 21:12:35,464 INFO ]: Without dead ends: 23 [2018-06-26 21:12:35,464 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:35,464 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 21:12:35,472 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-06-26 21:12:35,472 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 21:12:35,475 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1111 transitions. [2018-06-26 21:12:35,475 INFO ]: Start accepts. Automaton has 15 states and 1111 transitions. Word has length 6 [2018-06-26 21:12:35,475 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:35,475 INFO ]: Abstraction has 15 states and 1111 transitions. [2018-06-26 21:12:35,475 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:12:35,475 INFO ]: Start isEmpty. Operand 15 states and 1111 transitions. [2018-06-26 21:12:35,476 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:12:35,476 INFO ]: Found error trace [2018-06-26 21:12:35,476 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:12:35,477 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:35,477 INFO ]: Analyzing trace with hash 1281808030, now seen corresponding path program 1 times [2018-06-26 21:12:35,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:35,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:35,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:35,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:35,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:35,486 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:35,507 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:35,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:35,508 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:35,508 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:35,508 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:35,508 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:35,508 INFO ]: Start difference. First operand 15 states and 1111 transitions. Second operand 3 states. [2018-06-26 21:12:36,443 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:36,443 INFO ]: Finished difference Result 22 states and 1809 transitions. [2018-06-26 21:12:36,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:36,444 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:12:36,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:36,447 INFO ]: With dead ends: 22 [2018-06-26 21:12:36,447 INFO ]: Without dead ends: 22 [2018-06-26 21:12:36,447 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-26 21:12:36,447 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 21:12:36,457 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-26 21:12:36,458 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 21:12:36,459 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1686 transitions. [2018-06-26 21:12:36,459 INFO ]: Start accepts. Automaton has 20 states and 1686 transitions. Word has length 6 [2018-06-26 21:12:36,459 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:36,459 INFO ]: Abstraction has 20 states and 1686 transitions. [2018-06-26 21:12:36,459 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:36,459 INFO ]: Start isEmpty. Operand 20 states and 1686 transitions. [2018-06-26 21:12:36,461 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:12:36,461 INFO ]: Found error trace [2018-06-26 21:12:36,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:12:36,462 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:36,462 INFO ]: Analyzing trace with hash 1288272677, now seen corresponding path program 1 times [2018-06-26 21:12:36,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:36,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:36,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:36,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:36,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:36,477 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:36,511 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:36,511 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:36,512 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:36,512 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:36,512 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:36,512 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:36,512 INFO ]: Start difference. First operand 20 states and 1686 transitions. Second operand 3 states. [2018-06-26 21:12:36,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:36,870 INFO ]: Finished difference Result 29 states and 2015 transitions. [2018-06-26 21:12:36,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:36,872 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:12:36,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:36,876 INFO ]: With dead ends: 29 [2018-06-26 21:12:36,876 INFO ]: Without dead ends: 29 [2018-06-26 21:12:36,876 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-26 21:12:36,877 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 21:12:36,886 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 21:12:36,886 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 21:12:36,888 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2015 transitions. [2018-06-26 21:12:36,888 INFO ]: Start accepts. Automaton has 29 states and 2015 transitions. Word has length 6 [2018-06-26 21:12:36,888 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:36,888 INFO ]: Abstraction has 29 states and 2015 transitions. [2018-06-26 21:12:36,888 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:36,888 INFO ]: Start isEmpty. Operand 29 states and 2015 transitions. [2018-06-26 21:12:36,889 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:12:36,889 INFO ]: Found error trace [2018-06-26 21:12:36,889 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:12:36,889 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:36,890 INFO ]: Analyzing trace with hash 1291043240, now seen corresponding path program 1 times [2018-06-26 21:12:36,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:36,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:36,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:36,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:36,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:36,908 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:37,106 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:37,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:37,106 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-26 21:12:37,118 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-26 21:12:37,145 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:37,146 INFO ]: Computing forward predicates... [2018-06-26 21:12:37,243 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:37,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:37,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:12:37,273 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:12:37,273 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:12:37,273 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:12:37,273 INFO ]: Start difference. First operand 29 states and 2015 transitions. Second operand 5 states. [2018-06-26 21:12:38,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:38,915 INFO ]: Finished difference Result 47 states and 3511 transitions. [2018-06-26 21:12:38,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:12:38,945 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:12:38,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:38,955 INFO ]: With dead ends: 47 [2018-06-26 21:12:38,955 INFO ]: Without dead ends: 47 [2018-06-26 21:12:38,955 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:12:38,955 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 21:12:38,975 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-06-26 21:12:38,975 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 21:12:38,977 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2351 transitions. [2018-06-26 21:12:38,977 INFO ]: Start accepts. Automaton has 32 states and 2351 transitions. Word has length 6 [2018-06-26 21:12:38,977 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:38,977 INFO ]: Abstraction has 32 states and 2351 transitions. [2018-06-26 21:12:38,977 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:12:38,977 INFO ]: Start isEmpty. Operand 32 states and 2351 transitions. [2018-06-26 21:12:38,980 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:12:38,980 INFO ]: Found error trace [2018-06-26 21:12:38,980 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:12:38,980 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:38,980 INFO ]: Analyzing trace with hash 1103668416, now seen corresponding path program 2 times [2018-06-26 21:12:38,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:38,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:38,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:38,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:38,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:38,989 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:39,033 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:39,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:39,033 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:39,034 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:39,034 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:39,034 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:39,034 INFO ]: Start difference. First operand 32 states and 2351 transitions. Second operand 3 states. [2018-06-26 21:12:39,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:39,358 INFO ]: Finished difference Result 53 states and 3137 transitions. [2018-06-26 21:12:39,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:39,359 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 21:12:39,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:39,362 INFO ]: With dead ends: 53 [2018-06-26 21:12:39,363 INFO ]: Without dead ends: 53 [2018-06-26 21:12:39,363 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-26 21:12:39,363 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 21:12:39,378 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-26 21:12:39,379 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 21:12:39,382 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3137 transitions. [2018-06-26 21:12:39,382 INFO ]: Start accepts. Automaton has 53 states and 3137 transitions. Word has length 7 [2018-06-26 21:12:39,382 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:39,382 INFO ]: Abstraction has 53 states and 3137 transitions. [2018-06-26 21:12:39,382 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:39,382 INFO ]: Start isEmpty. Operand 53 states and 3137 transitions. [2018-06-26 21:12:39,384 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:12:39,384 INFO ]: Found error trace [2018-06-26 21:12:39,384 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:39,384 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:39,384 INFO ]: Analyzing trace with hash 1283844384, now seen corresponding path program 1 times [2018-06-26 21:12:39,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:39,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:39,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:39,385 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:12:39,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:39,390 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:39,428 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:39,428 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:12:39,428 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:12:39,428 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:12:39,428 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:12:39,428 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:12:39,429 INFO ]: Start difference. First operand 53 states and 3137 transitions. Second operand 3 states. [2018-06-26 21:12:39,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:39,674 INFO ]: Finished difference Result 53 states and 2338 transitions. [2018-06-26 21:12:39,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:12:39,674 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 21:12:39,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:39,676 INFO ]: With dead ends: 53 [2018-06-26 21:12:39,676 INFO ]: Without dead ends: 53 [2018-06-26 21:12:39,676 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-26 21:12:39,676 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 21:12:39,684 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-06-26 21:12:39,684 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 21:12:39,686 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2078 transitions. [2018-06-26 21:12:39,686 INFO ]: Start accepts. Automaton has 47 states and 2078 transitions. Word has length 7 [2018-06-26 21:12:39,686 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:39,686 INFO ]: Abstraction has 47 states and 2078 transitions. [2018-06-26 21:12:39,686 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:12:39,686 INFO ]: Start isEmpty. Operand 47 states and 2078 transitions. [2018-06-26 21:12:39,687 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:12:39,687 INFO ]: Found error trace [2018-06-26 21:12:39,687 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:39,688 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:39,689 INFO ]: Analyzing trace with hash 1776915225, now seen corresponding path program 1 times [2018-06-26 21:12:39,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:39,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:39,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:39,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:39,689 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:39,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:39,795 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:39,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:39,795 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-26 21:12:39,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:39,816 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:39,817 INFO ]: Computing forward predicates... [2018-06-26 21:12:39,825 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:39,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:39,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:12:39,844 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:12:39,844 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:12:39,844 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:12:39,844 INFO ]: Start difference. First operand 47 states and 2078 transitions. Second operand 5 states. [2018-06-26 21:12:41,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:41,006 INFO ]: Finished difference Result 65 states and 3008 transitions. [2018-06-26 21:12:41,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:12:41,006 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 21:12:41,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:41,008 INFO ]: With dead ends: 65 [2018-06-26 21:12:41,008 INFO ]: Without dead ends: 65 [2018-06-26 21:12:41,008 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:41,009 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 21:12:41,019 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-06-26 21:12:41,019 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 21:12:41,023 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 2698 transitions. [2018-06-26 21:12:41,023 INFO ]: Start accepts. Automaton has 59 states and 2698 transitions. Word has length 7 [2018-06-26 21:12:41,024 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:41,024 INFO ]: Abstraction has 59 states and 2698 transitions. [2018-06-26 21:12:41,024 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:12:41,024 INFO ]: Start isEmpty. Operand 59 states and 2698 transitions. [2018-06-26 21:12:41,027 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:12:41,027 INFO ]: Found error trace [2018-06-26 21:12:41,027 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:41,027 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:41,027 INFO ]: Analyzing trace with hash 1970944008, now seen corresponding path program 1 times [2018-06-26 21:12:41,027 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:41,027 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:41,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:41,028 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:41,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:41,042 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:41,110 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:41,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:41,110 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-26 21:12:41,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:41,180 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:41,181 INFO ]: Computing forward predicates... [2018-06-26 21:12:41,191 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:12:41,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:41,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:12:41,212 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:12:41,212 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:12:41,212 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:12:41,212 INFO ]: Start difference. First operand 59 states and 2698 transitions. Second operand 5 states. [2018-06-26 21:12:42,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:42,307 INFO ]: Finished difference Result 83 states and 3938 transitions. [2018-06-26 21:12:42,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:12:42,307 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 21:12:42,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:42,310 INFO ]: With dead ends: 83 [2018-06-26 21:12:42,310 INFO ]: Without dead ends: 83 [2018-06-26 21:12:42,310 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:12:42,310 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-26 21:12:42,318 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 59. [2018-06-26 21:12:42,318 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 21:12:42,320 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 2698 transitions. [2018-06-26 21:12:42,320 INFO ]: Start accepts. Automaton has 59 states and 2698 transitions. Word has length 7 [2018-06-26 21:12:42,320 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:42,320 INFO ]: Abstraction has 59 states and 2698 transitions. [2018-06-26 21:12:42,320 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:12:42,320 INFO ]: Start isEmpty. Operand 59 states and 2698 transitions. [2018-06-26 21:12:42,321 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:12:42,321 INFO ]: Found error trace [2018-06-26 21:12:42,322 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:42,322 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:42,322 INFO ]: Analyzing trace with hash -164327246, now seen corresponding path program 1 times [2018-06-26 21:12:42,322 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:42,322 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:42,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:42,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:42,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:42,330 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:42,406 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:42,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:42,406 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-26 21:12:42,412 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:42,445 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:42,446 INFO ]: Computing forward predicates... [2018-06-26 21:12:42,560 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:42,582 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:42,582 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 21:12:42,582 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:12:42,582 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:12:42,583 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:12:42,583 INFO ]: Start difference. First operand 59 states and 2698 transitions. Second operand 7 states. [2018-06-26 21:12:43,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:43,995 INFO ]: Finished difference Result 137 states and 6666 transitions. [2018-06-26 21:12:44,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 21:12:44,019 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 21:12:44,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:44,023 INFO ]: With dead ends: 137 [2018-06-26 21:12:44,023 INFO ]: Without dead ends: 137 [2018-06-26 21:12:44,024 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:12:44,024 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-26 21:12:44,033 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 71. [2018-06-26 21:12:44,033 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 21:12:44,036 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 3318 transitions. [2018-06-26 21:12:44,036 INFO ]: Start accepts. Automaton has 71 states and 3318 transitions. Word has length 8 [2018-06-26 21:12:44,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:44,036 INFO ]: Abstraction has 71 states and 3318 transitions. [2018-06-26 21:12:44,036 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:12:44,036 INFO ]: Start isEmpty. Operand 71 states and 3318 transitions. [2018-06-26 21:12:44,038 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:12:44,038 INFO ]: Found error trace [2018-06-26 21:12:44,038 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:44,038 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:44,038 INFO ]: Analyzing trace with hash -702916387, now seen corresponding path program 1 times [2018-06-26 21:12:44,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:44,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:44,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:44,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:44,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:44,045 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:44,244 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:44,244 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:44,244 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) [2018-06-26 21:12:44,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:12:44,293 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:44,294 INFO ]: Computing forward predicates... [2018-06-26 21:12:44,411 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:44,433 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:44,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 21:12:44,434 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:12:44,434 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:12:44,434 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:12:44,434 INFO ]: Start difference. First operand 71 states and 3318 transitions. Second operand 7 states. [2018-06-26 21:12:47,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:47,068 INFO ]: Finished difference Result 128 states and 6188 transitions. [2018-06-26 21:12:47,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 21:12:47,068 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 21:12:47,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:47,072 INFO ]: With dead ends: 128 [2018-06-26 21:12:47,072 INFO ]: Without dead ends: 128 [2018-06-26 21:12:47,072 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:12:47,072 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 21:12:47,086 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 86. [2018-06-26 21:12:47,086 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-26 21:12:47,089 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 4068 transitions. [2018-06-26 21:12:47,089 INFO ]: Start accepts. Automaton has 86 states and 4068 transitions. Word has length 8 [2018-06-26 21:12:47,089 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:47,089 INFO ]: Abstraction has 86 states and 4068 transitions. [2018-06-26 21:12:47,089 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:12:47,089 INFO ]: Start isEmpty. Operand 86 states and 4068 transitions. [2018-06-26 21:12:47,091 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:12:47,091 INFO ]: Found error trace [2018-06-26 21:12:47,091 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:47,091 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:47,091 INFO ]: Analyzing trace with hash -483293138, now seen corresponding path program 1 times [2018-06-26 21:12:47,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:47,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:47,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:47,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:47,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:47,103 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:47,169 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:47,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:47,169 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-26 21:12:47,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:47,210 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:47,212 INFO ]: Computing forward predicates... [2018-06-26 21:12:47,358 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:47,377 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:47,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:12:47,377 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:12:47,378 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:12:47,378 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:47,378 INFO ]: Start difference. First operand 86 states and 4068 transitions. Second operand 6 states. [2018-06-26 21:12:48,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:48,817 INFO ]: Finished difference Result 134 states and 6548 transitions. [2018-06-26 21:12:48,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:12:48,818 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 21:12:48,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:48,823 INFO ]: With dead ends: 134 [2018-06-26 21:12:48,823 INFO ]: Without dead ends: 134 [2018-06-26 21:12:48,824 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:12:48,824 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 21:12:48,841 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 104. [2018-06-26 21:12:48,841 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-26 21:12:48,846 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 4998 transitions. [2018-06-26 21:12:48,847 INFO ]: Start accepts. Automaton has 104 states and 4998 transitions. Word has length 9 [2018-06-26 21:12:48,847 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:48,847 INFO ]: Abstraction has 104 states and 4998 transitions. [2018-06-26 21:12:48,847 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:12:48,847 INFO ]: Start isEmpty. Operand 104 states and 4998 transitions. [2018-06-26 21:12:48,849 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:12:48,849 INFO ]: Found error trace [2018-06-26 21:12:48,849 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:48,849 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:48,849 INFO ]: Analyzing trace with hash -476917864, now seen corresponding path program 1 times [2018-06-26 21:12:48,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:48,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:48,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:48,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:48,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:48,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:48,946 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:48,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:48,946 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-26 21:12:48,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:48,969 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:48,970 INFO ]: Computing forward predicates... [2018-06-26 21:12:49,009 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:49,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:49,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:12:49,034 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:12:49,034 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:12:49,034 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:49,034 INFO ]: Start difference. First operand 104 states and 4998 transitions. Second operand 6 states. [2018-06-26 21:12:50,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:50,685 INFO ]: Finished difference Result 152 states and 7478 transitions. [2018-06-26 21:12:50,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:12:50,685 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 21:12:50,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:50,689 INFO ]: With dead ends: 152 [2018-06-26 21:12:50,689 INFO ]: Without dead ends: 152 [2018-06-26 21:12:50,689 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:12:50,689 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-26 21:12:50,698 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 110. [2018-06-26 21:12:50,699 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-26 21:12:50,702 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 5308 transitions. [2018-06-26 21:12:50,702 INFO ]: Start accepts. Automaton has 110 states and 5308 transitions. Word has length 9 [2018-06-26 21:12:50,702 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:50,702 INFO ]: Abstraction has 110 states and 5308 transitions. [2018-06-26 21:12:50,702 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:12:50,702 INFO ]: Start isEmpty. Operand 110 states and 5308 transitions. [2018-06-26 21:12:50,704 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:12:50,704 INFO ]: Found error trace [2018-06-26 21:12:50,704 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:50,704 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:50,704 INFO ]: Analyzing trace with hash -1909298935, now seen corresponding path program 1 times [2018-06-26 21:12:50,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:50,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:50,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:50,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:50,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:50,712 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:50,759 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:50,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:50,759 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-26 21:12:50,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:50,782 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:50,783 INFO ]: Computing forward predicates... [2018-06-26 21:12:50,886 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:50,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:50,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:12:50,904 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:12:50,905 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:12:50,905 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:50,905 INFO ]: Start difference. First operand 110 states and 5308 transitions. Second operand 6 states. [2018-06-26 21:12:52,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:52,421 INFO ]: Finished difference Result 140 states and 6858 transitions. [2018-06-26 21:12:52,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:12:52,421 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 21:12:52,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:52,425 INFO ]: With dead ends: 140 [2018-06-26 21:12:52,425 INFO ]: Without dead ends: 140 [2018-06-26 21:12:52,426 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:12:52,426 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 21:12:52,433 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 128. [2018-06-26 21:12:52,433 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-26 21:12:52,435 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 6238 transitions. [2018-06-26 21:12:52,435 INFO ]: Start accepts. Automaton has 128 states and 6238 transitions. Word has length 9 [2018-06-26 21:12:52,435 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:52,435 INFO ]: Abstraction has 128 states and 6238 transitions. [2018-06-26 21:12:52,435 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:12:52,435 INFO ]: Start isEmpty. Operand 128 states and 6238 transitions. [2018-06-26 21:12:52,437 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:12:52,437 INFO ]: Found error trace [2018-06-26 21:12:52,437 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:52,437 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:52,437 INFO ]: Analyzing trace with hash 1925209565, now seen corresponding path program 1 times [2018-06-26 21:12:52,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:52,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:52,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:52,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:52,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:52,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:52,788 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:52,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:52,788 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) [2018-06-26 21:12:52,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:12:52,836 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:52,838 INFO ]: Computing forward predicates... [2018-06-26 21:12:53,000 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:53,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:53,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:12:53,031 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:12:53,031 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:12:53,031 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:53,031 INFO ]: Start difference. First operand 128 states and 6238 transitions. Second operand 6 states. [2018-06-26 21:12:54,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:54,880 INFO ]: Finished difference Result 182 states and 9028 transitions. [2018-06-26 21:12:54,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 21:12:54,880 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 21:12:54,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:54,888 INFO ]: With dead ends: 182 [2018-06-26 21:12:54,888 INFO ]: Without dead ends: 182 [2018-06-26 21:12:54,888 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:12:54,888 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-26 21:12:54,900 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-06-26 21:12:54,900 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-26 21:12:54,905 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 6858 transitions. [2018-06-26 21:12:54,905 INFO ]: Start accepts. Automaton has 140 states and 6858 transitions. Word has length 9 [2018-06-26 21:12:54,905 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:54,905 INFO ]: Abstraction has 140 states and 6858 transitions. [2018-06-26 21:12:54,905 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:12:54,905 INFO ]: Start isEmpty. Operand 140 states and 6858 transitions. [2018-06-26 21:12:54,907 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:12:54,907 INFO ]: Found error trace [2018-06-26 21:12:54,907 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:54,907 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:54,907 INFO ]: Analyzing trace with hash 1931584839, now seen corresponding path program 1 times [2018-06-26 21:12:54,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:54,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:54,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:54,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:54,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:54,921 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:54,961 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:54,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:54,961 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-26 21:12:54,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:54,984 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:54,985 INFO ]: Computing forward predicates... [2018-06-26 21:12:55,007 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:55,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:55,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:12:55,026 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:12:55,027 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:12:55,027 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:55,027 INFO ]: Start difference. First operand 140 states and 6858 transitions. Second operand 6 states. [2018-06-26 21:12:56,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:56,470 INFO ]: Finished difference Result 182 states and 9028 transitions. [2018-06-26 21:12:56,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 21:12:56,470 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 21:12:56,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:56,477 INFO ]: With dead ends: 182 [2018-06-26 21:12:56,477 INFO ]: Without dead ends: 182 [2018-06-26 21:12:56,477 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-26 21:12:56,477 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-26 21:12:56,486 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 140. [2018-06-26 21:12:56,486 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-26 21:12:56,489 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 6858 transitions. [2018-06-26 21:12:56,489 INFO ]: Start accepts. Automaton has 140 states and 6858 transitions. Word has length 9 [2018-06-26 21:12:56,490 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:56,490 INFO ]: Abstraction has 140 states and 6858 transitions. [2018-06-26 21:12:56,490 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:12:56,490 INFO ]: Start isEmpty. Operand 140 states and 6858 transitions. [2018-06-26 21:12:56,491 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 21:12:56,491 INFO ]: Found error trace [2018-06-26 21:12:56,491 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:12:56,491 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:56,491 INFO ]: Analyzing trace with hash -153307331, now seen corresponding path program 1 times [2018-06-26 21:12:56,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:56,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:56,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:56,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:56,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:56,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:56,624 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:56,624 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:56,624 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-26 21:12:56,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:56,660 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:56,662 INFO ]: Computing forward predicates... [2018-06-26 21:12:56,726 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:12:56,745 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:56,745 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:12:56,745 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:12:56,745 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:12:56,745 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:12:56,745 INFO ]: Start difference. First operand 140 states and 6858 transitions. Second operand 6 states. [2018-06-26 21:12:58,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:12:58,249 INFO ]: Finished difference Result 182 states and 9028 transitions. [2018-06-26 21:12:58,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 21:12:58,251 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 21:12:58,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:12:58,255 INFO ]: With dead ends: 182 [2018-06-26 21:12:58,255 INFO ]: Without dead ends: 182 [2018-06-26 21:12:58,255 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-26 21:12:58,255 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-26 21:12:58,270 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 146. [2018-06-26 21:12:58,270 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-26 21:12:58,274 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 7168 transitions. [2018-06-26 21:12:58,274 INFO ]: Start accepts. Automaton has 146 states and 7168 transitions. Word has length 9 [2018-06-26 21:12:58,275 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:12:58,275 INFO ]: Abstraction has 146 states and 7168 transitions. [2018-06-26 21:12:58,275 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:12:58,275 INFO ]: Start isEmpty. Operand 146 states and 7168 transitions. [2018-06-26 21:12:58,277 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:12:58,277 INFO ]: Found error trace [2018-06-26 21:12:58,277 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-26 21:12:58,277 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:12:58,277 INFO ]: Analyzing trace with hash 867460194, now seen corresponding path program 2 times [2018-06-26 21:12:58,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:12:58,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:12:58,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:58,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:12:58,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:12:58,286 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:58,333 INFO ]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:12:58,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:12:58,333 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-26 21:12:58,338 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:12:58,364 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:12:58,364 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:12:58,366 INFO ]: Computing forward predicates... [2018-06-26 21:12:58,418 INFO ]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:12:58,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:12:58,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-26 21:12:58,444 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:12:58,444 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:12:58,444 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:12:58,445 INFO ]: Start difference. First operand 146 states and 7168 transitions. Second operand 9 states. [2018-06-26 21:13:00,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:00,719 INFO ]: Finished difference Result 260 states and 12965 transitions. [2018-06-26 21:13:00,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 21:13:00,720 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 21:13:00,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:00,724 INFO ]: With dead ends: 260 [2018-06-26 21:13:00,724 INFO ]: Without dead ends: 260 [2018-06-26 21:13:00,724 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-06-26 21:13:00,724 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-26 21:13:00,740 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 164. [2018-06-26 21:13:00,740 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-26 21:13:00,745 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 8098 transitions. [2018-06-26 21:13:00,745 INFO ]: Start accepts. Automaton has 164 states and 8098 transitions. Word has length 10 [2018-06-26 21:13:00,746 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:00,746 INFO ]: Abstraction has 164 states and 8098 transitions. [2018-06-26 21:13:00,746 INFO ]: Interpolant automaton has 9 states. [2018-06-26 21:13:00,746 INFO ]: Start isEmpty. Operand 164 states and 8098 transitions. [2018-06-26 21:13:00,748 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:13:00,748 INFO ]: Found error trace [2018-06-26 21:13:00,748 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-26 21:13:00,748 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:00,748 INFO ]: Analyzing trace with hash -1342703918, now seen corresponding path program 2 times [2018-06-26 21:13:00,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:00,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:00,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:00,749 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:13:00,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:00,759 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:00,838 INFO ]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:13:00,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:00,838 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-26 21:13:00,846 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:13:00,867 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:13:00,867 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:00,868 INFO ]: Computing forward predicates... [2018-06-26 21:13:00,955 INFO ]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:13:00,973 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:00,973 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-26 21:13:00,974 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:13:00,974 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:13:00,974 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:13:00,974 INFO ]: Start difference. First operand 164 states and 8098 transitions. Second operand 9 states. [2018-06-26 21:13:04,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:04,104 INFO ]: Finished difference Result 254 states and 12648 transitions. [2018-06-26 21:13:04,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 21:13:04,104 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 21:13:04,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:04,111 INFO ]: With dead ends: 254 [2018-06-26 21:13:04,111 INFO ]: Without dead ends: 254 [2018-06-26 21:13:04,112 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-06-26 21:13:04,112 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-26 21:13:04,128 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 173. [2018-06-26 21:13:04,128 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-26 21:13:04,134 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 8538 transitions. [2018-06-26 21:13:04,134 INFO ]: Start accepts. Automaton has 173 states and 8538 transitions. Word has length 10 [2018-06-26 21:13:04,134 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:04,134 INFO ]: Abstraction has 173 states and 8538 transitions. [2018-06-26 21:13:04,134 INFO ]: Interpolant automaton has 9 states. [2018-06-26 21:13:04,134 INFO ]: Start isEmpty. Operand 173 states and 8538 transitions. [2018-06-26 21:13:04,137 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:13:04,137 INFO ]: Found error trace [2018-06-26 21:13:04,137 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:13:04,137 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:04,137 INFO ]: Analyzing trace with hash 1340357763, now seen corresponding path program 1 times [2018-06-26 21:13:04,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:04,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:04,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:04,138 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:13:04,138 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:04,148 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:04,511 INFO ]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:13:04,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:04,512 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-26 21:13:04,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:04,552 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:04,554 INFO ]: Computing forward predicates... [2018-06-26 21:13:04,612 INFO ]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:13:04,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:13:04,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:13:04,632 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:13:04,632 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:13:04,632 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:13:04,632 INFO ]: Start difference. First operand 173 states and 8538 transitions. Second operand 7 states. [2018-06-26 21:13:06,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:13:06,581 INFO ]: Finished difference Result 233 states and 11638 transitions. [2018-06-26 21:13:06,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 21:13:06,631 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-26 21:13:06,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:13:06,636 INFO ]: With dead ends: 233 [2018-06-26 21:13:06,636 INFO ]: Without dead ends: 233 [2018-06-26 21:13:06,636 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:13:06,636 INFO ]: Start minimizeSevpa. Operand 233 states. [2018-06-26 21:13:06,653 INFO ]: Finished minimizeSevpa. Reduced states from 233 to 179. [2018-06-26 21:13:06,653 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-26 21:13:06,659 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 8848 transitions. [2018-06-26 21:13:06,659 INFO ]: Start accepts. Automaton has 179 states and 8848 transitions. Word has length 11 [2018-06-26 21:13:06,659 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:13:06,659 INFO ]: Abstraction has 179 states and 8848 transitions. [2018-06-26 21:13:06,659 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:13:06,659 INFO ]: Start isEmpty. Operand 179 states and 8848 transitions. [2018-06-26 21:13:06,662 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:13:06,662 INFO ]: Found error trace [2018-06-26 21:13:06,662 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:13:06,662 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:13:06,662 INFO ]: Analyzing trace with hash 1346733037, now seen corresponding path program 1 times [2018-06-26 21:13:06,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:13:06,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:13:06,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:06,663 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:06,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:13:06,672 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:06,889 INFO ]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:13:06,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:13:06,889 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-26 21:13:06,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:13:06,927 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:13:06,929 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 21:13:06,960 INFO ]: Timeout while computing interpolants [2018-06-26 21:13:07,160 WARN ]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:13:07,160 WARN ]: Verification canceled [2018-06-26 21:13:07,162 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:13:07,163 WARN ]: Timeout [2018-06-26 21:13:07,163 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:13:07 BasicIcfg [2018-06-26 21:13:07,163 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:13:07,164 INFO ]: Toolchain (without parser) took 58116.49 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 261.0 MB in the beginning and 1.0 GB in the end (delta: -785.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-26 21:13:07,165 INFO ]: SmtParser took 0.06 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-26 21:13:07,165 INFO ]: ChcToBoogie took 61.68 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 258.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:13:07,166 INFO ]: Boogie Preprocessor took 46.19 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 257.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 21:13:07,166 INFO ]: RCFGBuilder took 202.41 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.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:13:07,167 INFO ]: BlockEncodingV2 took 20277.95 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 248.0 MB in the beginning and 889.8 MB in the end (delta: -641.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 3.6 GB. [2018-06-26 21:13:07,167 INFO ]: TraceAbstraction took 37519.92 ms. Allocated memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -13.1 MB). Free memory was 889.8 MB in the beginning and 1.0 GB in the end (delta: -157.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:13:07,177 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 200 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 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 61.68 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 258.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.19 ms. Allocated memory is still 305.7 MB. Free memory was 258.0 MB in the beginning and 257.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 202.41 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.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 20277.95 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 248.0 MB in the beginning and 889.8 MB in the end (delta: -641.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 3.6 GB. * TraceAbstraction took 37519.92 ms. Allocated memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -13.1 MB). Free memory was 889.8 MB in the beginning and 1.0 GB in the end (delta: -157.1 MB). There was no memory consumed. 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 12 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 37.4s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 31.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 789 SDtfs, 3 SDslu, 198 SDs, 0 SdLazy, 34330 SolverSat, 14064 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 142 SyntacticMatches, 16 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=22, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 604 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 259 ConstructedInterpolants, 3 QuantifiedInterpolants, 7536 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2403 ConjunctsInSsa, 253 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 37/271 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/fib_bench_safe_v2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-13-07-186.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-13-07-186.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-13-07-186.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_bench_safe_v2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-13-07-186.csv Completed graceful shutdown