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/eldarica-misc/LIA/reve/006-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:01:03,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:01:03,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:01:03,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:01:03,782 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:01:03,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:01:03,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:01:03,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:01:03,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:01:03,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:01:03,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:01:03,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:01:03,798 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:01:03,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:01:03,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:01:03,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:01:03,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:01:03,804 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:01:03,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:01:03,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:01:03,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:01:03,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:01:03,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:01:03,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:01:03,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:01:03,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:01:03,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:01:03,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:01:03,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:01:03,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:01:03,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:01:03,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:01:03,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:01:03,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:01:03,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:01:03,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:01:03,835 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:01:03,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:01:03,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:01:03,855 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:01:03,855 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:01:03,857 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:01:03,857 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:01:03,857 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:01:03,857 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:01:03,858 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:01:03,858 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:01:03,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:01:03,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:01:03,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:01:03,859 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:01:03,859 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:01:03,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:01:03,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:01:03,859 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:01:03,859 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:01:03,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:01:03,860 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:01:03,862 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:01:03,862 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:01:03,910 INFO ]: Repository-Root is: /tmp [2018-06-26 18:01:03,925 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:01:03,930 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:01:03,932 INFO ]: Initializing SmtParser... [2018-06-26 18:01:03,932 INFO ]: SmtParser initialized [2018-06-26 18:01:03,933 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/006-horn.smt2 [2018-06-26 18:01:03,934 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 18:01:04,019 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/006-horn.smt2 unknown [2018-06-26 18:01:04,246 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/006-horn.smt2 [2018-06-26 18:01:04,251 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:01:04,256 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:01:04,257 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:01:04,257 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:01:04,257 INFO ]: ChcToBoogie initialized [2018-06-26 18:01:04,263 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,329 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04 Unit [2018-06-26 18:01:04,332 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:01:04,333 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:01:04,333 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:01:04,333 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:01:04,355 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,355 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,364 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,364 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,377 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,380 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,390 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,393 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:01:04,393 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:01:04,393 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:01:04,393 INFO ]: RCFGBuilder initialized [2018-06-26 18:01:04,394 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (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 18:01:04,419 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:01:04,420 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:01:04,420 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:01:04,420 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:01:04,420 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:01:04,420 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 18:01:04,974 INFO ]: Using library mode [2018-06-26 18:01:04,974 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:01:04 BoogieIcfgContainer [2018-06-26 18:01:04,974 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:01:04,974 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:01:04,974 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:01:04,975 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:01:04,979 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:01:04" (1/1) ... [2018-06-26 18:01:04,997 INFO ]: Initial Icfg 35 locations, 58 edges [2018-06-26 18:01:04,998 INFO ]: Using Remove infeasible edges [2018-06-26 18:01:04,999 INFO ]: Using Maximize final states [2018-06-26 18:01:04,999 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:01:05,000 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:01:05,001 INFO ]: Using Remove sink states [2018-06-26 18:01:05,002 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:01:05,002 INFO ]: Using Use SBE [2018-06-26 18:01:05,017 INFO ]: SBE split 0 edges [2018-06-26 18:01:05,027 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:01:05,029 INFO ]: 0 new accepting states [2018-06-26 18:01:05,091 INFO ]: Removed 13 edges and 5 locations by large block encoding [2018-06-26 18:01:05,093 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:01:05,096 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:01:05,096 INFO ]: 0 new accepting states [2018-06-26 18:01:05,097 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:01:05,097 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:01:05,098 INFO ]: Encoded RCFG 28 locations, 51 edges [2018-06-26 18:01:05,098 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:01:05 BasicIcfg [2018-06-26 18:01:05,098 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:01:05,100 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:01:05,100 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:01:05,103 INFO ]: TraceAbstraction initialized [2018-06-26 18:01:05,104 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:01:04" (1/4) ... [2018-06-26 18:01:05,105 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e993843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:01:05, skipping insertion in model container [2018-06-26 18:01:05,106 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:04" (2/4) ... [2018-06-26 18:01:05,106 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e993843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:01:05, skipping insertion in model container [2018-06-26 18:01:05,106 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:01:04" (3/4) ... [2018-06-26 18:01:05,106 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e993843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:01:05, skipping insertion in model container [2018-06-26 18:01:05,106 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:01:05" (4/4) ... [2018-06-26 18:01:05,110 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:01:05,121 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:01:05,139 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:01:05,186 INFO ]: Using default assertion order modulation [2018-06-26 18:01:05,186 INFO ]: Interprodecural is true [2018-06-26 18:01:05,186 INFO ]: Hoare is false [2018-06-26 18:01:05,186 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:01:05,187 INFO ]: Backedges is TWOTRACK [2018-06-26 18:01:05,187 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:01:05,187 INFO ]: Difference is false [2018-06-26 18:01:05,187 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:01:05,187 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:01:05,203 INFO ]: Start isEmpty. Operand 28 states. [2018-06-26 18:01:05,217 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:01:05,217 INFO ]: Found error trace [2018-06-26 18:01:05,218 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:01:05,218 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:05,223 INFO ]: Analyzing trace with hash 36020863, now seen corresponding path program 1 times [2018-06-26 18:01:05,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:05,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:05,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:05,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:05,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:05,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:05,390 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:05,392 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:01:05,392 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:01:05,393 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:01:05,406 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:01:05,406 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:01:05,410 INFO ]: Start difference. First operand 28 states. Second operand 3 states. [2018-06-26 18:01:05,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:05,688 INFO ]: Finished difference Result 41 states and 76 transitions. [2018-06-26 18:01:05,688 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:01:05,689 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:01:05,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:05,700 INFO ]: With dead ends: 41 [2018-06-26 18:01:05,700 INFO ]: Without dead ends: 41 [2018-06-26 18:01:05,701 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 18:01:05,715 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 18:01:05,756 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 18:01:05,758 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 18:01:05,763 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 76 transitions. [2018-06-26 18:01:05,764 INFO ]: Start accepts. Automaton has 41 states and 76 transitions. Word has length 5 [2018-06-26 18:01:05,767 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:05,767 INFO ]: Abstraction has 41 states and 76 transitions. [2018-06-26 18:01:05,767 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:01:05,767 INFO ]: Start isEmpty. Operand 41 states and 76 transitions. [2018-06-26 18:01:05,773 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:01:05,773 INFO ]: Found error trace [2018-06-26 18:01:05,773 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:01:05,773 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:05,773 INFO ]: Analyzing trace with hash 1118685385, now seen corresponding path program 1 times [2018-06-26 18:01:05,773 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:05,773 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:05,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:05,774 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:05,774 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:05,790 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:05,882 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:05,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:01:05,882 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:01:05,884 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:01:05,884 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:01:05,884 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:01:05,884 INFO ]: Start difference. First operand 41 states and 76 transitions. Second operand 3 states. [2018-06-26 18:01:06,197 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:06,197 INFO ]: Finished difference Result 54 states and 102 transitions. [2018-06-26 18:01:06,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:01:06,198 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:01:06,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:06,202 INFO ]: With dead ends: 54 [2018-06-26 18:01:06,202 INFO ]: Without dead ends: 54 [2018-06-26 18:01:06,202 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 18:01:06,203 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 18:01:06,232 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-26 18:01:06,232 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 18:01:06,237 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 102 transitions. [2018-06-26 18:01:06,237 INFO ]: Start accepts. Automaton has 54 states and 102 transitions. Word has length 6 [2018-06-26 18:01:06,237 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:06,237 INFO ]: Abstraction has 54 states and 102 transitions. [2018-06-26 18:01:06,237 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:01:06,237 INFO ]: Start isEmpty. Operand 54 states and 102 transitions. [2018-06-26 18:01:06,250 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 18:01:06,250 INFO ]: Found error trace [2018-06-26 18:01:06,250 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:06,250 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:06,251 INFO ]: Analyzing trace with hash -979799857, now seen corresponding path program 1 times [2018-06-26 18:01:06,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:06,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:06,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:06,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:06,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:06,272 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:06,308 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:01:06,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:06,308 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 18:01:06,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:06,362 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:06,371 INFO ]: Computing forward predicates... [2018-06-26 18:01:06,393 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:01:06,428 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:01:06,428 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-26 18:01:06,429 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:01:06,429 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:01:06,429 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:01:06,429 INFO ]: Start difference. First operand 54 states and 102 transitions. Second operand 3 states. [2018-06-26 18:01:06,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:06,920 INFO ]: Finished difference Result 67 states and 124 transitions. [2018-06-26 18:01:06,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:01:06,946 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 18:01:06,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:06,949 INFO ]: With dead ends: 67 [2018-06-26 18:01:06,949 INFO ]: Without dead ends: 67 [2018-06-26 18:01:06,950 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 16 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 18:01:06,950 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-26 18:01:06,960 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-26 18:01:06,960 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 18:01:06,962 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2018-06-26 18:01:06,962 INFO ]: Start accepts. Automaton has 67 states and 124 transitions. Word has length 15 [2018-06-26 18:01:06,963 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:06,963 INFO ]: Abstraction has 67 states and 124 transitions. [2018-06-26 18:01:06,963 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:01:06,963 INFO ]: Start isEmpty. Operand 67 states and 124 transitions. [2018-06-26 18:01:06,966 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 18:01:06,966 INFO ]: Found error trace [2018-06-26 18:01:06,966 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:06,966 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:06,966 INFO ]: Analyzing trace with hash 1102024481, now seen corresponding path program 1 times [2018-06-26 18:01:06,966 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:06,966 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:06,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:06,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:06,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:07,012 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:07,248 INFO ]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 18:01:07,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:07,248 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:07,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:07,302 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:07,305 INFO ]: Computing forward predicates... [2018-06-26 18:01:07,397 INFO ]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:01:07,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:07,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-26 18:01:07,417 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:01:07,417 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:01:07,418 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:01:07,418 INFO ]: Start difference. First operand 67 states and 124 transitions. Second operand 9 states. [2018-06-26 18:01:08,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:08,410 INFO ]: Finished difference Result 119 states and 294 transitions. [2018-06-26 18:01:08,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:01:08,411 INFO ]: Start accepts. Automaton has 9 states. Word has length 22 [2018-06-26 18:01:08,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:08,417 INFO ]: With dead ends: 119 [2018-06-26 18:01:08,418 INFO ]: Without dead ends: 97 [2018-06-26 18:01:08,418 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:01:08,418 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-26 18:01:08,439 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 75. [2018-06-26 18:01:08,439 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 18:01:08,441 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 155 transitions. [2018-06-26 18:01:08,441 INFO ]: Start accepts. Automaton has 75 states and 155 transitions. Word has length 22 [2018-06-26 18:01:08,442 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:08,442 INFO ]: Abstraction has 75 states and 155 transitions. [2018-06-26 18:01:08,442 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:01:08,442 INFO ]: Start isEmpty. Operand 75 states and 155 transitions. [2018-06-26 18:01:08,444 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:01:08,445 INFO ]: Found error trace [2018-06-26 18:01:08,445 INFO ]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:08,445 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:08,445 INFO ]: Analyzing trace with hash 2119563394, now seen corresponding path program 1 times [2018-06-26 18:01:08,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:08,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:08,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:08,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:08,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:08,493 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:08,789 INFO ]: Checked inductivity of 33 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 18:01:08,789 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:08,789 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 18:01:08,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:08,852 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:08,857 INFO ]: Computing forward predicates... [2018-06-26 18:01:09,127 INFO ]: Checked inductivity of 33 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 18:01:09,160 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:09,160 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-26 18:01:09,160 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:01:09,160 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:01:09,161 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:01:09,161 INFO ]: Start difference. First operand 75 states and 155 transitions. Second operand 20 states. [2018-06-26 18:01:10,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:10,973 INFO ]: Finished difference Result 103 states and 258 transitions. [2018-06-26 18:01:10,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:01:10,974 INFO ]: Start accepts. Automaton has 20 states. Word has length 28 [2018-06-26 18:01:10,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:10,977 INFO ]: With dead ends: 103 [2018-06-26 18:01:10,978 INFO ]: Without dead ends: 103 [2018-06-26 18:01:10,978 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:01:10,978 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-26 18:01:10,997 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 79. [2018-06-26 18:01:10,997 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-26 18:01:10,999 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 177 transitions. [2018-06-26 18:01:10,999 INFO ]: Start accepts. Automaton has 79 states and 177 transitions. Word has length 28 [2018-06-26 18:01:10,999 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:10,999 INFO ]: Abstraction has 79 states and 177 transitions. [2018-06-26 18:01:11,000 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:01:11,000 INFO ]: Start isEmpty. Operand 79 states and 177 transitions. [2018-06-26 18:01:11,002 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:01:11,002 INFO ]: Found error trace [2018-06-26 18:01:11,002 INFO ]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:11,002 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:11,003 INFO ]: Analyzing trace with hash -1896366746, now seen corresponding path program 1 times [2018-06-26 18:01:11,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:11,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:11,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:11,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:11,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:11,027 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:11,098 INFO ]: Checked inductivity of 33 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:01:11,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:11,098 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 18:01:11,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:11,154 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:11,158 INFO ]: Computing forward predicates... [2018-06-26 18:01:11,231 INFO ]: Checked inductivity of 33 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 18:01:11,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:11,251 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2018-06-26 18:01:11,251 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:01:11,251 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:01:11,251 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:01:11,251 INFO ]: Start difference. First operand 79 states and 177 transitions. Second operand 13 states. [2018-06-26 18:01:12,110 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:12,110 INFO ]: Finished difference Result 142 states and 428 transitions. [2018-06-26 18:01:12,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 18:01:12,111 INFO ]: Start accepts. Automaton has 13 states. Word has length 28 [2018-06-26 18:01:12,111 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:12,116 INFO ]: With dead ends: 142 [2018-06-26 18:01:12,116 INFO ]: Without dead ends: 137 [2018-06-26 18:01:12,116 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:01:12,117 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-26 18:01:12,145 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 83. [2018-06-26 18:01:12,145 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-26 18:01:12,147 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 185 transitions. [2018-06-26 18:01:12,147 INFO ]: Start accepts. Automaton has 83 states and 185 transitions. Word has length 28 [2018-06-26 18:01:12,147 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:12,147 INFO ]: Abstraction has 83 states and 185 transitions. [2018-06-26 18:01:12,147 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:01:12,147 INFO ]: Start isEmpty. Operand 83 states and 185 transitions. [2018-06-26 18:01:12,150 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 18:01:12,150 INFO ]: Found error trace [2018-06-26 18:01:12,150 INFO ]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:12,150 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:12,150 INFO ]: Analyzing trace with hash 78947080, now seen corresponding path program 1 times [2018-06-26 18:01:12,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:12,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:12,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:12,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:12,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:12,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:12,264 INFO ]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 18:01:12,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:12,264 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 18:01:12,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:12,307 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:12,310 INFO ]: Computing forward predicates... [2018-06-26 18:01:12,485 INFO ]: Checked inductivity of 33 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 18:01:12,517 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:12,517 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-26 18:01:12,517 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:01:12,517 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:01:12,517 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:01:12,517 INFO ]: Start difference. First operand 83 states and 185 transitions. Second operand 14 states. [2018-06-26 18:01:13,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:13,317 INFO ]: Finished difference Result 130 states and 406 transitions. [2018-06-26 18:01:13,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 18:01:13,317 INFO ]: Start accepts. Automaton has 14 states. Word has length 28 [2018-06-26 18:01:13,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:13,321 INFO ]: With dead ends: 130 [2018-06-26 18:01:13,321 INFO ]: Without dead ends: 130 [2018-06-26 18:01:13,321 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:01:13,321 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-26 18:01:13,345 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 99. [2018-06-26 18:01:13,345 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-26 18:01:13,347 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 254 transitions. [2018-06-26 18:01:13,348 INFO ]: Start accepts. Automaton has 99 states and 254 transitions. Word has length 28 [2018-06-26 18:01:13,348 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:13,348 INFO ]: Abstraction has 99 states and 254 transitions. [2018-06-26 18:01:13,348 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:01:13,348 INFO ]: Start isEmpty. Operand 99 states and 254 transitions. [2018-06-26 18:01:13,351 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 18:01:13,351 INFO ]: Found error trace [2018-06-26 18:01:13,351 INFO ]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:13,351 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:13,351 INFO ]: Analyzing trace with hash -988552897, now seen corresponding path program 1 times [2018-06-26 18:01:13,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:13,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:13,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:13,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:13,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:13,375 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:13,460 INFO ]: Checked inductivity of 49 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-26 18:01:13,460 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:13,460 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:13,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:13,519 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:13,522 INFO ]: Computing forward predicates... [2018-06-26 18:01:13,568 INFO ]: Checked inductivity of 49 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 18:01:13,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:13,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-26 18:01:13,588 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:01:13,588 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:01:13,588 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:01:13,589 INFO ]: Start difference. First operand 99 states and 254 transitions. Second operand 11 states. [2018-06-26 18:01:14,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:14,942 INFO ]: Finished difference Result 154 states and 465 transitions. [2018-06-26 18:01:14,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:01:14,943 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-26 18:01:14,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:14,946 INFO ]: With dead ends: 154 [2018-06-26 18:01:14,946 INFO ]: Without dead ends: 148 [2018-06-26 18:01:14,947 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:01:14,947 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-26 18:01:14,984 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 113. [2018-06-26 18:01:14,984 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-26 18:01:14,991 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 298 transitions. [2018-06-26 18:01:14,991 INFO ]: Start accepts. Automaton has 113 states and 298 transitions. Word has length 33 [2018-06-26 18:01:14,991 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:14,991 INFO ]: Abstraction has 113 states and 298 transitions. [2018-06-26 18:01:14,991 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:01:14,992 INFO ]: Start isEmpty. Operand 113 states and 298 transitions. [2018-06-26 18:01:14,995 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 18:01:14,995 INFO ]: Found error trace [2018-06-26 18:01:14,995 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:14,995 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:14,995 INFO ]: Analyzing trace with hash -289986367, now seen corresponding path program 2 times [2018-06-26 18:01:14,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:14,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:14,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:14,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:14,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:15,030 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:15,256 INFO ]: Checked inductivity of 53 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 18:01:15,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:15,256 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 18:01:15,263 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:15,305 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:15,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:15,308 INFO ]: Computing forward predicates... [2018-06-26 18:01:15,375 INFO ]: Checked inductivity of 53 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 18:01:15,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:15,394 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-26 18:01:15,395 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:01:15,395 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:01:15,395 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:01:15,395 INFO ]: Start difference. First operand 113 states and 298 transitions. Second operand 16 states. [2018-06-26 18:01:16,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:16,572 INFO ]: Finished difference Result 154 states and 476 transitions. [2018-06-26 18:01:16,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:01:16,573 INFO ]: Start accepts. Automaton has 16 states. Word has length 34 [2018-06-26 18:01:16,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:16,577 INFO ]: With dead ends: 154 [2018-06-26 18:01:16,577 INFO ]: Without dead ends: 151 [2018-06-26 18:01:16,579 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:01:16,579 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-26 18:01:16,614 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 121. [2018-06-26 18:01:16,614 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-26 18:01:16,618 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 343 transitions. [2018-06-26 18:01:16,618 INFO ]: Start accepts. Automaton has 121 states and 343 transitions. Word has length 34 [2018-06-26 18:01:16,619 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:16,619 INFO ]: Abstraction has 121 states and 343 transitions. [2018-06-26 18:01:16,619 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:01:16,619 INFO ]: Start isEmpty. Operand 121 states and 343 transitions. [2018-06-26 18:01:16,622 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 18:01:16,622 INFO ]: Found error trace [2018-06-26 18:01:16,623 INFO ]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:16,623 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:16,623 INFO ]: Analyzing trace with hash 1693512657, now seen corresponding path program 1 times [2018-06-26 18:01:16,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:16,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:16,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:16,623 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:16,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:16,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:17,138 INFO ]: Checked inductivity of 49 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 18:01:17,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:17,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:01:17,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:17,246 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:17,249 INFO ]: Computing forward predicates... [2018-06-26 18:01:17,280 INFO ]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 18:01:17,312 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:01:17,312 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2018-06-26 18:01:17,312 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:01:17,313 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:01:17,313 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:01:17,313 INFO ]: Start difference. First operand 121 states and 343 transitions. Second operand 7 states. [2018-06-26 18:01:17,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:17,592 INFO ]: Finished difference Result 128 states and 374 transitions. [2018-06-26 18:01:17,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:01:17,594 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-26 18:01:17,594 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:17,596 INFO ]: With dead ends: 128 [2018-06-26 18:01:17,596 INFO ]: Without dead ends: 128 [2018-06-26 18:01:17,597 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:01:17,597 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 18:01:17,614 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-06-26 18:01:17,614 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-26 18:01:17,618 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 298 transitions. [2018-06-26 18:01:17,618 INFO ]: Start accepts. Automaton has 110 states and 298 transitions. Word has length 33 [2018-06-26 18:01:17,618 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:17,618 INFO ]: Abstraction has 110 states and 298 transitions. [2018-06-26 18:01:17,618 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:01:17,618 INFO ]: Start isEmpty. Operand 110 states and 298 transitions. [2018-06-26 18:01:17,622 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 18:01:17,622 INFO ]: Found error trace [2018-06-26 18:01:17,622 INFO ]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:17,622 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:17,622 INFO ]: Analyzing trace with hash 588425717, now seen corresponding path program 1 times [2018-06-26 18:01:17,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:17,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:17,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:17,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:17,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:17,641 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:17,759 INFO ]: Checked inductivity of 49 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-26 18:01:17,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:17,760 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 18:01:17,765 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:17,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:17,809 INFO ]: Computing forward predicates... [2018-06-26 18:01:17,833 INFO ]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-26 18:01:17,852 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:01:17,852 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2018-06-26 18:01:17,852 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:01:17,852 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:01:17,852 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:01:17,852 INFO ]: Start difference. First operand 110 states and 298 transitions. Second operand 7 states. [2018-06-26 18:01:18,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:18,082 INFO ]: Finished difference Result 132 states and 405 transitions. [2018-06-26 18:01:18,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:01:18,082 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-26 18:01:18,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:18,084 INFO ]: With dead ends: 132 [2018-06-26 18:01:18,084 INFO ]: Without dead ends: 132 [2018-06-26 18:01:18,085 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:01:18,085 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-26 18:01:18,099 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-06-26 18:01:18,099 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-26 18:01:18,100 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2018-06-26 18:01:18,100 INFO ]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 33 [2018-06-26 18:01:18,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:18,100 INFO ]: Abstraction has 102 states and 255 transitions. [2018-06-26 18:01:18,100 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:01:18,100 INFO ]: Start isEmpty. Operand 102 states and 255 transitions. [2018-06-26 18:01:18,103 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:01:18,103 INFO ]: Found error trace [2018-06-26 18:01:18,103 INFO ]: trace histogram [7, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:18,103 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:18,103 INFO ]: Analyzing trace with hash -1169876686, now seen corresponding path program 1 times [2018-06-26 18:01:18,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:18,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:18,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:18,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:18,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:18,125 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:18,290 INFO ]: Checked inductivity of 70 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-26 18:01:18,290 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:18,290 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:18,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:18,351 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:18,354 INFO ]: Computing forward predicates... [2018-06-26 18:01:18,372 INFO ]: Checked inductivity of 70 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:01:18,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:18,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 18:01:18,392 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:01:18,392 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:01:18,392 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:01:18,392 INFO ]: Start difference. First operand 102 states and 255 transitions. Second operand 9 states. [2018-06-26 18:01:18,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:18,624 INFO ]: Finished difference Result 114 states and 313 transitions. [2018-06-26 18:01:18,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:01:18,624 INFO ]: Start accepts. Automaton has 9 states. Word has length 39 [2018-06-26 18:01:18,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:18,626 INFO ]: With dead ends: 114 [2018-06-26 18:01:18,626 INFO ]: Without dead ends: 114 [2018-06-26 18:01:18,627 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:01:18,627 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-26 18:01:18,636 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-06-26 18:01:18,636 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-26 18:01:18,638 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 274 transitions. [2018-06-26 18:01:18,638 INFO ]: Start accepts. Automaton has 105 states and 274 transitions. Word has length 39 [2018-06-26 18:01:18,638 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:18,638 INFO ]: Abstraction has 105 states and 274 transitions. [2018-06-26 18:01:18,638 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:01:18,638 INFO ]: Start isEmpty. Operand 105 states and 274 transitions. [2018-06-26 18:01:18,641 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-26 18:01:18,641 INFO ]: Found error trace [2018-06-26 18:01:18,641 INFO ]: trace histogram [9, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:18,641 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:18,641 INFO ]: Analyzing trace with hash -1693817326, now seen corresponding path program 2 times [2018-06-26 18:01:18,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:18,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:18,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:18,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:18,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:18,674 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:19,128 INFO ]: Checked inductivity of 130 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-26 18:01:19,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:19,128 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 18:01:19,139 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:19,196 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:19,196 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:19,200 INFO ]: Computing forward predicates... [2018-06-26 18:01:19,321 INFO ]: Checked inductivity of 130 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 18:01:19,340 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:19,340 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21 [2018-06-26 18:01:19,340 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:01:19,340 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:01:19,340 INFO ]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:01:19,341 INFO ]: Start difference. First operand 105 states and 274 transitions. Second operand 21 states. [2018-06-26 18:01:20,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:20,638 INFO ]: Finished difference Result 152 states and 485 transitions. [2018-06-26 18:01:20,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:01:20,639 INFO ]: Start accepts. Automaton has 21 states. Word has length 51 [2018-06-26 18:01:20,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:20,641 INFO ]: With dead ends: 152 [2018-06-26 18:01:20,642 INFO ]: Without dead ends: 149 [2018-06-26 18:01:20,642 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 18:01:20,642 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-26 18:01:20,663 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 113. [2018-06-26 18:01:20,663 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-26 18:01:20,666 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 311 transitions. [2018-06-26 18:01:20,666 INFO ]: Start accepts. Automaton has 113 states and 311 transitions. Word has length 51 [2018-06-26 18:01:20,666 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:20,666 INFO ]: Abstraction has 113 states and 311 transitions. [2018-06-26 18:01:20,666 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:01:20,666 INFO ]: Start isEmpty. Operand 113 states and 311 transitions. [2018-06-26 18:01:20,669 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 18:01:20,670 INFO ]: Found error trace [2018-06-26 18:01:20,670 INFO ]: trace histogram [8, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:20,670 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:20,670 INFO ]: Analyzing trace with hash 1628898673, now seen corresponding path program 3 times [2018-06-26 18:01:20,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:20,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:20,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:20,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:20,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:20,689 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:20,971 INFO ]: Checked inductivity of 97 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-26 18:01:20,971 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:20,971 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 18:01:20,981 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:01:21,029 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:01:21,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:21,032 INFO ]: Computing forward predicates... [2018-06-26 18:01:21,184 INFO ]: Checked inductivity of 97 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-26 18:01:21,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:21,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-06-26 18:01:21,204 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:01:21,204 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:01:21,204 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:01:21,204 INFO ]: Start difference. First operand 113 states and 311 transitions. Second operand 14 states. [2018-06-26 18:01:21,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:21,939 INFO ]: Finished difference Result 134 states and 384 transitions. [2018-06-26 18:01:21,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:01:21,939 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-26 18:01:21,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:21,941 INFO ]: With dead ends: 134 [2018-06-26 18:01:21,941 INFO ]: Without dead ends: 134 [2018-06-26 18:01:21,941 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:01:21,941 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 18:01:21,966 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 114. [2018-06-26 18:01:21,966 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-26 18:01:21,968 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 302 transitions. [2018-06-26 18:01:21,968 INFO ]: Start accepts. Automaton has 114 states and 302 transitions. Word has length 45 [2018-06-26 18:01:21,969 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:21,969 INFO ]: Abstraction has 114 states and 302 transitions. [2018-06-26 18:01:21,969 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:01:21,969 INFO ]: Start isEmpty. Operand 114 states and 302 transitions. [2018-06-26 18:01:21,974 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 18:01:21,974 INFO ]: Found error trace [2018-06-26 18:01:21,974 INFO ]: trace histogram [7, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:21,974 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:21,974 INFO ]: Analyzing trace with hash -285425370, now seen corresponding path program 1 times [2018-06-26 18:01:21,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:21,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:21,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:21,975 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:21,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:21,991 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:22,854 INFO ]: Checked inductivity of 77 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 18:01:22,854 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:22,854 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 18:01:22,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:22,931 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:22,934 INFO ]: Computing forward predicates... [2018-06-26 18:01:23,292 INFO ]: Checked inductivity of 77 backedges. 50 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-26 18:01:23,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:23,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-26 18:01:23,311 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:01:23,311 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:01:23,311 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:01:23,312 INFO ]: Start difference. First operand 114 states and 302 transitions. Second operand 17 states. [2018-06-26 18:01:24,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:24,581 INFO ]: Finished difference Result 160 states and 562 transitions. [2018-06-26 18:01:24,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:01:24,581 INFO ]: Start accepts. Automaton has 17 states. Word has length 40 [2018-06-26 18:01:24,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:24,584 INFO ]: With dead ends: 160 [2018-06-26 18:01:24,584 INFO ]: Without dead ends: 160 [2018-06-26 18:01:24,589 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 18:01:24,589 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-26 18:01:24,610 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 122. [2018-06-26 18:01:24,610 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-26 18:01:24,612 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 361 transitions. [2018-06-26 18:01:24,612 INFO ]: Start accepts. Automaton has 122 states and 361 transitions. Word has length 40 [2018-06-26 18:01:24,613 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:24,613 INFO ]: Abstraction has 122 states and 361 transitions. [2018-06-26 18:01:24,613 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:01:24,613 INFO ]: Start isEmpty. Operand 122 states and 361 transitions. [2018-06-26 18:01:24,617 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:01:24,617 INFO ]: Found error trace [2018-06-26 18:01:24,617 INFO ]: trace histogram [7, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:24,617 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:24,618 INFO ]: Analyzing trace with hash 1082478300, now seen corresponding path program 1 times [2018-06-26 18:01:24,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:24,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:24,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:24,618 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:24,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:24,634 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:24,798 INFO ]: Checked inductivity of 70 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-26 18:01:24,798 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:24,798 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 18:01:24,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:24,864 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:24,867 INFO ]: Computing forward predicates... [2018-06-26 18:01:25,041 INFO ]: Checked inductivity of 70 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 18:01:25,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:25,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-06-26 18:01:25,060 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:01:25,060 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:01:25,060 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:01:25,060 INFO ]: Start difference. First operand 122 states and 361 transitions. Second operand 14 states. [2018-06-26 18:01:25,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:25,636 INFO ]: Finished difference Result 147 states and 473 transitions. [2018-06-26 18:01:25,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 18:01:25,636 INFO ]: Start accepts. Automaton has 14 states. Word has length 39 [2018-06-26 18:01:25,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:25,638 INFO ]: With dead ends: 147 [2018-06-26 18:01:25,638 INFO ]: Without dead ends: 147 [2018-06-26 18:01:25,638 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-06-26 18:01:25,639 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-26 18:01:25,655 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 122. [2018-06-26 18:01:25,655 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-26 18:01:25,657 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 359 transitions. [2018-06-26 18:01:25,657 INFO ]: Start accepts. Automaton has 122 states and 359 transitions. Word has length 39 [2018-06-26 18:01:25,657 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:25,657 INFO ]: Abstraction has 122 states and 359 transitions. [2018-06-26 18:01:25,657 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:01:25,657 INFO ]: Start isEmpty. Operand 122 states and 359 transitions. [2018-06-26 18:01:25,661 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:01:25,661 INFO ]: Found error trace [2018-06-26 18:01:25,661 INFO ]: trace histogram [7, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:25,662 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:25,662 INFO ]: Analyzing trace with hash 1866557670, now seen corresponding path program 1 times [2018-06-26 18:01:25,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:25,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:25,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:25,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:25,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:25,678 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:26,468 INFO ]: Checked inductivity of 70 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-26 18:01:26,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:26,468 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 18:01:26,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:26,541 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:26,544 INFO ]: Computing forward predicates... [2018-06-26 18:01:26,706 INFO ]: Checked inductivity of 70 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 18:01:26,729 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:26,729 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-26 18:01:26,729 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:01:26,729 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:01:26,729 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:01:26,730 INFO ]: Start difference. First operand 122 states and 359 transitions. Second operand 13 states. [2018-06-26 18:01:27,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:27,206 INFO ]: Finished difference Result 145 states and 453 transitions. [2018-06-26 18:01:27,206 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 18:01:27,206 INFO ]: Start accepts. Automaton has 13 states. Word has length 39 [2018-06-26 18:01:27,206 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:27,208 INFO ]: With dead ends: 145 [2018-06-26 18:01:27,208 INFO ]: Without dead ends: 139 [2018-06-26 18:01:27,208 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-26 18:01:27,208 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-26 18:01:27,222 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-06-26 18:01:27,222 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-26 18:01:27,223 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 285 transitions. [2018-06-26 18:01:27,223 INFO ]: Start accepts. Automaton has 111 states and 285 transitions. Word has length 39 [2018-06-26 18:01:27,223 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:27,223 INFO ]: Abstraction has 111 states and 285 transitions. [2018-06-26 18:01:27,223 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:01:27,223 INFO ]: Start isEmpty. Operand 111 states and 285 transitions. [2018-06-26 18:01:27,226 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 18:01:27,226 INFO ]: Found error trace [2018-06-26 18:01:27,226 INFO ]: trace histogram [8, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:27,226 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:27,226 INFO ]: Analyzing trace with hash -882145017, now seen corresponding path program 1 times [2018-06-26 18:01:27,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:27,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:27,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:27,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:27,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:27,252 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:27,680 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-06-26 18:01:27,863 INFO ]: Checked inductivity of 103 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 18:01:27,863 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:27,863 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) [2018-06-26 18:01:27,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:27,933 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:27,938 INFO ]: Computing forward predicates... [2018-06-26 18:01:28,591 INFO ]: Checked inductivity of 103 backedges. 40 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 18:01:28,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:28,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-26 18:01:28,610 INFO ]: Interpolant automaton has 34 states [2018-06-26 18:01:28,610 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 18:01:28,610 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:01:28,610 INFO ]: Start difference. First operand 111 states and 285 transitions. Second operand 34 states. [2018-06-26 18:01:31,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:31,899 INFO ]: Finished difference Result 147 states and 457 transitions. [2018-06-26 18:01:31,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:01:31,899 INFO ]: Start accepts. Automaton has 34 states. Word has length 46 [2018-06-26 18:01:31,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:31,900 INFO ]: With dead ends: 147 [2018-06-26 18:01:31,900 INFO ]: Without dead ends: 147 [2018-06-26 18:01:31,901 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=333, Invalid=2859, Unknown=0, NotChecked=0, Total=3192 [2018-06-26 18:01:31,901 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-26 18:01:31,912 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 119. [2018-06-26 18:01:31,912 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-26 18:01:31,914 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 324 transitions. [2018-06-26 18:01:31,914 INFO ]: Start accepts. Automaton has 119 states and 324 transitions. Word has length 46 [2018-06-26 18:01:31,914 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:31,914 INFO ]: Abstraction has 119 states and 324 transitions. [2018-06-26 18:01:31,914 INFO ]: Interpolant automaton has 34 states. [2018-06-26 18:01:31,914 INFO ]: Start isEmpty. Operand 119 states and 324 transitions. [2018-06-26 18:01:31,917 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-26 18:01:31,917 INFO ]: Found error trace [2018-06-26 18:01:31,917 INFO ]: trace histogram [10, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:31,917 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:31,918 INFO ]: Analyzing trace with hash 989191607, now seen corresponding path program 1 times [2018-06-26 18:01:31,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:31,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:31,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:31,918 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:31,918 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:31,941 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:32,178 INFO ]: Checked inductivity of 163 backedges. 60 proven. 39 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-26 18:01:32,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:32,178 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:32,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:32,249 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:32,252 INFO ]: Computing forward predicates... [2018-06-26 18:01:32,333 INFO ]: Checked inductivity of 163 backedges. 99 proven. 16 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-26 18:01:32,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:32,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-26 18:01:32,358 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:01:32,358 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:01:32,358 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:01:32,359 INFO ]: Start difference. First operand 119 states and 324 transitions. Second operand 16 states. [2018-06-26 18:01:32,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:32,990 INFO ]: Finished difference Result 148 states and 457 transitions. [2018-06-26 18:01:33,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 18:01:33,013 INFO ]: Start accepts. Automaton has 16 states. Word has length 57 [2018-06-26 18:01:33,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:33,015 INFO ]: With dead ends: 148 [2018-06-26 18:01:33,015 INFO ]: Without dead ends: 148 [2018-06-26 18:01:33,015 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:01:33,015 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-26 18:01:33,031 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 131. [2018-06-26 18:01:33,031 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-26 18:01:33,033 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 374 transitions. [2018-06-26 18:01:33,033 INFO ]: Start accepts. Automaton has 131 states and 374 transitions. Word has length 57 [2018-06-26 18:01:33,033 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:33,033 INFO ]: Abstraction has 131 states and 374 transitions. [2018-06-26 18:01:33,034 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:01:33,034 INFO ]: Start isEmpty. Operand 131 states and 374 transitions. [2018-06-26 18:01:33,037 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 18:01:33,037 INFO ]: Found error trace [2018-06-26 18:01:33,037 INFO ]: trace histogram [8, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:33,037 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:33,037 INFO ]: Analyzing trace with hash 1400776989, now seen corresponding path program 1 times [2018-06-26 18:01:33,037 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:33,037 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:33,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:33,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:33,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:33,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:33,378 INFO ]: Checked inductivity of 105 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-26 18:01:33,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:33,378 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:33,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:33,437 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:33,440 INFO ]: Computing forward predicates... [2018-06-26 18:01:33,667 INFO ]: Checked inductivity of 105 backedges. 46 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-26 18:01:33,685 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:33,686 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-06-26 18:01:33,686 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:01:33,686 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:01:33,686 INFO ]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:01:33,686 INFO ]: Start difference. First operand 131 states and 374 transitions. Second operand 20 states. [2018-06-26 18:01:34,548 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:34,548 INFO ]: Finished difference Result 179 states and 627 transitions. [2018-06-26 18:01:34,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 18:01:34,549 INFO ]: Start accepts. Automaton has 20 states. Word has length 46 [2018-06-26 18:01:34,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:34,551 INFO ]: With dead ends: 179 [2018-06-26 18:01:34,551 INFO ]: Without dead ends: 175 [2018-06-26 18:01:34,551 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:01:34,551 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-26 18:01:34,572 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 130. [2018-06-26 18:01:34,572 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-26 18:01:34,574 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 375 transitions. [2018-06-26 18:01:34,574 INFO ]: Start accepts. Automaton has 130 states and 375 transitions. Word has length 46 [2018-06-26 18:01:34,574 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:34,574 INFO ]: Abstraction has 130 states and 375 transitions. [2018-06-26 18:01:34,574 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:01:34,574 INFO ]: Start isEmpty. Operand 130 states and 375 transitions. [2018-06-26 18:01:34,577 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-26 18:01:34,577 INFO ]: Found error trace [2018-06-26 18:01:34,577 INFO ]: trace histogram [10, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:34,578 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:34,578 INFO ]: Analyzing trace with hash -744462373, now seen corresponding path program 1 times [2018-06-26 18:01:34,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:34,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:34,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:34,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:34,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:34,599 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:34,748 INFO ]: Checked inductivity of 163 backedges. 60 proven. 37 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 18:01:34,748 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:34,748 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:34,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:34,817 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:34,820 INFO ]: Computing forward predicates... [2018-06-26 18:01:34,873 INFO ]: Checked inductivity of 163 backedges. 99 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-26 18:01:34,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:34,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-26 18:01:34,892 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:01:34,892 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:01:34,892 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:01:34,892 INFO ]: Start difference. First operand 130 states and 375 transitions. Second operand 15 states. [2018-06-26 18:01:35,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:35,484 INFO ]: Finished difference Result 156 states and 490 transitions. [2018-06-26 18:01:35,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:01:35,484 INFO ]: Start accepts. Automaton has 15 states. Word has length 57 [2018-06-26 18:01:35,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:35,486 INFO ]: With dead ends: 156 [2018-06-26 18:01:35,486 INFO ]: Without dead ends: 156 [2018-06-26 18:01:35,486 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2018-06-26 18:01:35,486 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-26 18:01:35,500 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 132. [2018-06-26 18:01:35,500 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-26 18:01:35,502 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 380 transitions. [2018-06-26 18:01:35,502 INFO ]: Start accepts. Automaton has 132 states and 380 transitions. Word has length 57 [2018-06-26 18:01:35,503 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:35,503 INFO ]: Abstraction has 132 states and 380 transitions. [2018-06-26 18:01:35,503 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:01:35,503 INFO ]: Start isEmpty. Operand 132 states and 380 transitions. [2018-06-26 18:01:35,505 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-26 18:01:35,505 INFO ]: Found error trace [2018-06-26 18:01:35,505 INFO ]: trace histogram [10, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:35,505 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:35,505 INFO ]: Analyzing trace with hash 1538459633, now seen corresponding path program 1 times [2018-06-26 18:01:35,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:35,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:35,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:35,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:35,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:35,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:35,652 INFO ]: Checked inductivity of 165 backedges. 60 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-26 18:01:35,652 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:35,652 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:35,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:35,723 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:35,727 INFO ]: Computing forward predicates... [2018-06-26 18:01:35,843 INFO ]: Checked inductivity of 165 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-26 18:01:35,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:35,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-26 18:01:35,863 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:01:35,863 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:01:35,863 INFO ]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:01:35,863 INFO ]: Start difference. First operand 132 states and 380 transitions. Second operand 17 states. [2018-06-26 18:01:36,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:36,775 INFO ]: Finished difference Result 207 states and 814 transitions. [2018-06-26 18:01:36,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 18:01:36,776 INFO ]: Start accepts. Automaton has 17 states. Word has length 57 [2018-06-26 18:01:36,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:36,778 INFO ]: With dead ends: 207 [2018-06-26 18:01:36,778 INFO ]: Without dead ends: 207 [2018-06-26 18:01:36,779 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 18:01:36,779 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-26 18:01:36,804 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 154. [2018-06-26 18:01:36,804 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-26 18:01:36,806 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 515 transitions. [2018-06-26 18:01:36,806 INFO ]: Start accepts. Automaton has 154 states and 515 transitions. Word has length 57 [2018-06-26 18:01:36,806 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:36,806 INFO ]: Abstraction has 154 states and 515 transitions. [2018-06-26 18:01:36,806 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:01:36,806 INFO ]: Start isEmpty. Operand 154 states and 515 transitions. [2018-06-26 18:01:36,809 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-26 18:01:36,809 INFO ]: Found error trace [2018-06-26 18:01:36,809 INFO ]: trace histogram [10, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:36,809 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:36,810 INFO ]: Analyzing trace with hash -1490621429, now seen corresponding path program 2 times [2018-06-26 18:01:36,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:36,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:36,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:36,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:36,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:36,833 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:37,090 INFO ]: Checked inductivity of 176 backedges. 65 proven. 42 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-26 18:01:37,090 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:37,090 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:37,095 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:37,183 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:37,183 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:37,186 INFO ]: Computing forward predicates... [2018-06-26 18:01:37,288 INFO ]: Checked inductivity of 176 backedges. 90 proven. 29 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-26 18:01:37,307 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:37,307 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2018-06-26 18:01:37,307 INFO ]: Interpolant automaton has 18 states [2018-06-26 18:01:37,307 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 18:01:37,307 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:01:37,307 INFO ]: Start difference. First operand 154 states and 515 transitions. Second operand 18 states. [2018-06-26 18:01:38,288 WARN ]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-26 18:01:38,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:38,765 INFO ]: Finished difference Result 241 states and 1134 transitions. [2018-06-26 18:01:38,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 18:01:38,772 INFO ]: Start accepts. Automaton has 18 states. Word has length 58 [2018-06-26 18:01:38,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:38,777 INFO ]: With dead ends: 241 [2018-06-26 18:01:38,777 INFO ]: Without dead ends: 241 [2018-06-26 18:01:38,778 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 18:01:38,778 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-26 18:01:38,820 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 149. [2018-06-26 18:01:38,821 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-26 18:01:38,822 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 487 transitions. [2018-06-26 18:01:38,822 INFO ]: Start accepts. Automaton has 149 states and 487 transitions. Word has length 58 [2018-06-26 18:01:38,823 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:38,823 INFO ]: Abstraction has 149 states and 487 transitions. [2018-06-26 18:01:38,823 INFO ]: Interpolant automaton has 18 states. [2018-06-26 18:01:38,823 INFO ]: Start isEmpty. Operand 149 states and 487 transitions. [2018-06-26 18:01:38,825 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 18:01:38,826 INFO ]: Found error trace [2018-06-26 18:01:38,826 INFO ]: trace histogram [9, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:38,826 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:38,826 INFO ]: Analyzing trace with hash 956003562, now seen corresponding path program 2 times [2018-06-26 18:01:38,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:38,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:38,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:38,826 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:38,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:38,842 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:39,970 INFO ]: Checked inductivity of 135 backedges. 32 proven. 60 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-26 18:01:39,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:39,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:39,975 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:40,034 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:40,034 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:40,038 INFO ]: Computing forward predicates... [2018-06-26 18:01:40,124 INFO ]: Checked inductivity of 135 backedges. 57 proven. 43 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 18:01:40,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:40,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21 [2018-06-26 18:01:40,144 INFO ]: Interpolant automaton has 21 states [2018-06-26 18:01:40,144 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 18:01:40,144 INFO ]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:01:40,144 INFO ]: Start difference. First operand 149 states and 487 transitions. Second operand 21 states. [2018-06-26 18:01:41,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:41,442 INFO ]: Finished difference Result 195 states and 750 transitions. [2018-06-26 18:01:41,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:01:41,442 INFO ]: Start accepts. Automaton has 21 states. Word has length 52 [2018-06-26 18:01:41,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:41,445 INFO ]: With dead ends: 195 [2018-06-26 18:01:41,445 INFO ]: Without dead ends: 195 [2018-06-26 18:01:41,446 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 18:01:41,446 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-26 18:01:41,468 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 132. [2018-06-26 18:01:41,468 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-26 18:01:41,470 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 379 transitions. [2018-06-26 18:01:41,470 INFO ]: Start accepts. Automaton has 132 states and 379 transitions. Word has length 52 [2018-06-26 18:01:41,470 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:41,470 INFO ]: Abstraction has 132 states and 379 transitions. [2018-06-26 18:01:41,470 INFO ]: Interpolant automaton has 21 states. [2018-06-26 18:01:41,470 INFO ]: Start isEmpty. Operand 132 states and 379 transitions. [2018-06-26 18:01:41,472 INFO ]: Finished isEmpty. Found accepting run of length 64 [2018-06-26 18:01:41,473 INFO ]: Found error trace [2018-06-26 18:01:41,473 INFO ]: trace histogram [11, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:41,473 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:41,473 INFO ]: Analyzing trace with hash 1119847834, now seen corresponding path program 2 times [2018-06-26 18:01:41,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:41,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:41,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:41,473 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:41,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:41,495 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:41,647 INFO ]: Checked inductivity of 202 backedges. 70 proven. 45 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-26 18:01:41,647 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:41,647 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:41,653 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:41,726 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:41,726 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:41,730 INFO ]: Computing forward predicates... [2018-06-26 18:01:41,779 INFO ]: Checked inductivity of 202 backedges. 123 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-26 18:01:41,798 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:41,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-26 18:01:41,799 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:01:41,799 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:01:41,799 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:01:41,799 INFO ]: Start difference. First operand 132 states and 379 transitions. Second operand 15 states. [2018-06-26 18:01:42,496 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:42,496 INFO ]: Finished difference Result 208 states and 869 transitions. [2018-06-26 18:01:42,496 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:01:42,496 INFO ]: Start accepts. Automaton has 15 states. Word has length 63 [2018-06-26 18:01:42,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:42,499 INFO ]: With dead ends: 208 [2018-06-26 18:01:42,499 INFO ]: Without dead ends: 208 [2018-06-26 18:01:42,499 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:01:42,499 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-26 18:01:42,527 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 143. [2018-06-26 18:01:42,527 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-26 18:01:42,529 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 457 transitions. [2018-06-26 18:01:42,529 INFO ]: Start accepts. Automaton has 143 states and 457 transitions. Word has length 63 [2018-06-26 18:01:42,530 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:42,530 INFO ]: Abstraction has 143 states and 457 transitions. [2018-06-26 18:01:42,530 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:01:42,530 INFO ]: Start isEmpty. Operand 143 states and 457 transitions. [2018-06-26 18:01:42,532 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-26 18:01:42,532 INFO ]: Found error trace [2018-06-26 18:01:42,532 INFO ]: trace histogram [11, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:42,532 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:42,532 INFO ]: Analyzing trace with hash -443231083, now seen corresponding path program 1 times [2018-06-26 18:01:42,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:42,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:42,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:42,533 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:42,533 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:42,554 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:43,001 INFO ]: Checked inductivity of 214 backedges. 82 proven. 34 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-26 18:01:43,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:43,001 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:43,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:43,079 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:43,083 INFO ]: Computing forward predicates... [2018-06-26 18:01:43,924 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 18:01:44,435 INFO ]: Checked inductivity of 214 backedges. 99 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-26 18:01:44,454 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:44,454 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-06-26 18:01:44,454 INFO ]: Interpolant automaton has 22 states [2018-06-26 18:01:44,455 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 18:01:44,455 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-26 18:01:44,455 INFO ]: Start difference. First operand 143 states and 457 transitions. Second operand 22 states. [2018-06-26 18:01:46,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:46,428 INFO ]: Finished difference Result 185 states and 754 transitions. [2018-06-26 18:01:46,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 18:01:46,428 INFO ]: Start accepts. Automaton has 22 states. Word has length 64 [2018-06-26 18:01:46,428 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:46,430 INFO ]: With dead ends: 185 [2018-06-26 18:01:46,431 INFO ]: Without dead ends: 185 [2018-06-26 18:01:46,431 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=296, Invalid=2254, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 18:01:46,432 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-26 18:01:46,446 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 135. [2018-06-26 18:01:46,446 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-26 18:01:46,448 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 414 transitions. [2018-06-26 18:01:46,448 INFO ]: Start accepts. Automaton has 135 states and 414 transitions. Word has length 64 [2018-06-26 18:01:46,449 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:46,449 INFO ]: Abstraction has 135 states and 414 transitions. [2018-06-26 18:01:46,449 INFO ]: Interpolant automaton has 22 states. [2018-06-26 18:01:46,449 INFO ]: Start isEmpty. Operand 135 states and 414 transitions. [2018-06-26 18:01:46,451 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-26 18:01:46,451 INFO ]: Found error trace [2018-06-26 18:01:46,451 INFO ]: trace histogram [12, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:46,451 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:46,451 INFO ]: Analyzing trace with hash 2131246453, now seen corresponding path program 3 times [2018-06-26 18:01:46,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:46,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:46,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:46,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:46,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:46,488 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:46,902 INFO ]: Checked inductivity of 240 backedges. 81 proven. 60 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-26 18:01:46,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:46,902 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:46,908 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:01:47,009 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 18:01:47,009 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:47,013 INFO ]: Computing forward predicates... [2018-06-26 18:01:47,195 INFO ]: Checked inductivity of 240 backedges. 132 proven. 37 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-26 18:01:47,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:47,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-06-26 18:01:47,214 INFO ]: Interpolant automaton has 25 states [2018-06-26 18:01:47,214 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 18:01:47,214 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-26 18:01:47,215 INFO ]: Start difference. First operand 135 states and 414 transitions. Second operand 25 states. [2018-06-26 18:01:48,290 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-26 18:01:49,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:49,352 INFO ]: Finished difference Result 186 states and 680 transitions. [2018-06-26 18:01:49,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-26 18:01:49,352 INFO ]: Start accepts. Automaton has 25 states. Word has length 68 [2018-06-26 18:01:49,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:49,354 INFO ]: With dead ends: 186 [2018-06-26 18:01:49,354 INFO ]: Without dead ends: 165 [2018-06-26 18:01:49,355 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=537, Invalid=4019, Unknown=0, NotChecked=0, Total=4556 [2018-06-26 18:01:49,355 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-26 18:01:49,369 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 131. [2018-06-26 18:01:49,370 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-26 18:01:49,372 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 407 transitions. [2018-06-26 18:01:49,372 INFO ]: Start accepts. Automaton has 131 states and 407 transitions. Word has length 68 [2018-06-26 18:01:49,372 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:49,372 INFO ]: Abstraction has 131 states and 407 transitions. [2018-06-26 18:01:49,372 INFO ]: Interpolant automaton has 25 states. [2018-06-26 18:01:49,372 INFO ]: Start isEmpty. Operand 131 states and 407 transitions. [2018-06-26 18:01:49,374 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-26 18:01:49,374 INFO ]: Found error trace [2018-06-26 18:01:49,374 INFO ]: trace histogram [13, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:49,374 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:49,374 INFO ]: Analyzing trace with hash -888424146, now seen corresponding path program 4 times [2018-06-26 18:01:49,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:49,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:49,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:49,375 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:49,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:49,414 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:50,324 INFO ]: Checked inductivity of 286 backedges. 91 proven. 85 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-26 18:01:50,324 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:50,324 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:50,330 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:01:50,418 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:01:50,418 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:50,421 INFO ]: Computing forward predicates... [2018-06-26 18:01:50,473 INFO ]: Checked inductivity of 286 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-26 18:01:50,492 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:50,493 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2018-06-26 18:01:50,493 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:01:50,493 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:01:50,493 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:01:50,493 INFO ]: Start difference. First operand 131 states and 407 transitions. Second operand 17 states. [2018-06-26 18:01:51,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:51,273 INFO ]: Finished difference Result 164 states and 574 transitions. [2018-06-26 18:01:51,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 18:01:51,273 INFO ]: Start accepts. Automaton has 17 states. Word has length 74 [2018-06-26 18:01:51,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:51,275 INFO ]: With dead ends: 164 [2018-06-26 18:01:51,275 INFO ]: Without dead ends: 164 [2018-06-26 18:01:51,275 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:01:51,276 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-26 18:01:51,288 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 136. [2018-06-26 18:01:51,288 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-26 18:01:51,290 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 433 transitions. [2018-06-26 18:01:51,290 INFO ]: Start accepts. Automaton has 136 states and 433 transitions. Word has length 74 [2018-06-26 18:01:51,290 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:51,290 INFO ]: Abstraction has 136 states and 433 transitions. [2018-06-26 18:01:51,290 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:01:51,290 INFO ]: Start isEmpty. Operand 136 states and 433 transitions. [2018-06-26 18:01:51,292 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-26 18:01:51,292 INFO ]: Found error trace [2018-06-26 18:01:51,292 INFO ]: trace histogram [13, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:51,292 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:51,292 INFO ]: Analyzing trace with hash 1454963522, now seen corresponding path program 5 times [2018-06-26 18:01:51,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:51,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:51,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:51,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:51,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:51,317 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:51,502 INFO ]: Checked inductivity of 286 backedges. 90 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-26 18:01:51,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:51,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:51,513 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:01:51,580 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 18:01:51,580 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:51,583 INFO ]: Computing forward predicates... [2018-06-26 18:01:51,691 INFO ]: Checked inductivity of 286 backedges. 144 proven. 4 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-26 18:01:51,710 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:51,710 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 23 [2018-06-26 18:01:51,710 INFO ]: Interpolant automaton has 23 states [2018-06-26 18:01:51,710 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 18:01:51,710 INFO ]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:01:51,710 INFO ]: Start difference. First operand 136 states and 433 transitions. Second operand 23 states. [2018-06-26 18:01:53,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:53,608 INFO ]: Finished difference Result 213 states and 898 transitions. [2018-06-26 18:01:53,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-26 18:01:53,608 INFO ]: Start accepts. Automaton has 23 states. Word has length 74 [2018-06-26 18:01:53,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:53,611 INFO ]: With dead ends: 213 [2018-06-26 18:01:53,611 INFO ]: Without dead ends: 213 [2018-06-26 18:01:53,612 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=722, Invalid=4828, Unknown=0, NotChecked=0, Total=5550 [2018-06-26 18:01:53,613 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-26 18:01:53,644 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 163. [2018-06-26 18:01:53,644 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-26 18:01:53,650 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 593 transitions. [2018-06-26 18:01:53,651 INFO ]: Start accepts. Automaton has 163 states and 593 transitions. Word has length 74 [2018-06-26 18:01:53,651 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:53,651 INFO ]: Abstraction has 163 states and 593 transitions. [2018-06-26 18:01:53,651 INFO ]: Interpolant automaton has 23 states. [2018-06-26 18:01:53,651 INFO ]: Start isEmpty. Operand 163 states and 593 transitions. [2018-06-26 18:01:53,658 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-26 18:01:53,658 INFO ]: Found error trace [2018-06-26 18:01:53,658 INFO ]: trace histogram [11, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:53,658 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:53,658 INFO ]: Analyzing trace with hash -564899114, now seen corresponding path program 2 times [2018-06-26 18:01:53,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:53,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:53,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:53,659 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:53,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:53,683 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:53,979 INFO ]: Checked inductivity of 221 backedges. 45 proven. 103 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-26 18:01:53,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:53,979 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:53,985 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:54,060 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:54,060 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:54,063 INFO ]: Computing forward predicates... [2018-06-26 18:01:54,200 INFO ]: Checked inductivity of 221 backedges. 79 proven. 81 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-26 18:01:54,219 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:54,219 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-06-26 18:01:54,220 INFO ]: Interpolant automaton has 23 states [2018-06-26 18:01:54,220 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 18:01:54,220 INFO ]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:01:54,220 INFO ]: Start difference. First operand 163 states and 593 transitions. Second operand 23 states. [2018-06-26 18:01:55,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:55,398 INFO ]: Finished difference Result 229 states and 1049 transitions. [2018-06-26 18:01:55,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 18:01:55,398 INFO ]: Start accepts. Automaton has 23 states. Word has length 64 [2018-06-26 18:01:55,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:55,401 INFO ]: With dead ends: 229 [2018-06-26 18:01:55,401 INFO ]: Without dead ends: 225 [2018-06-26 18:01:55,402 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:01:55,402 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-26 18:01:55,438 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 180. [2018-06-26 18:01:55,439 INFO ]: Start removeUnreachable. Operand 180 states. [2018-06-26 18:01:55,441 INFO ]: Finished removeUnreachable. Reduced from 180 states to 180 states and 683 transitions. [2018-06-26 18:01:55,441 INFO ]: Start accepts. Automaton has 180 states and 683 transitions. Word has length 64 [2018-06-26 18:01:55,442 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:55,442 INFO ]: Abstraction has 180 states and 683 transitions. [2018-06-26 18:01:55,442 INFO ]: Interpolant automaton has 23 states. [2018-06-26 18:01:55,442 INFO ]: Start isEmpty. Operand 180 states and 683 transitions. [2018-06-26 18:01:55,446 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-26 18:01:55,446 INFO ]: Found error trace [2018-06-26 18:01:55,446 INFO ]: trace histogram [14, 7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:55,446 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:55,446 INFO ]: Analyzing trace with hash 697511279, now seen corresponding path program 1 times [2018-06-26 18:01:55,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:55,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:55,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:55,447 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:01:55,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:55,480 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:55,851 INFO ]: Checked inductivity of 353 backedges. 109 proven. 110 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-06-26 18:01:55,851 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:55,851 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:55,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:55,949 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:55,953 INFO ]: Computing forward predicates... [2018-06-26 18:01:57,215 INFO ]: Checked inductivity of 353 backedges. 152 proven. 88 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 18:01:57,234 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:57,234 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-06-26 18:01:57,234 INFO ]: Interpolant automaton has 31 states [2018-06-26 18:01:57,234 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 18:01:57,234 INFO ]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-06-26 18:01:57,235 INFO ]: Start difference. First operand 180 states and 683 transitions. Second operand 31 states. [2018-06-26 18:01:58,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:58,870 INFO ]: Finished difference Result 258 states and 1249 transitions. [2018-06-26 18:01:58,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 18:01:58,870 INFO ]: Start accepts. Automaton has 31 states. Word has length 81 [2018-06-26 18:01:58,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:58,873 INFO ]: With dead ends: 258 [2018-06-26 18:01:58,873 INFO ]: Without dead ends: 254 [2018-06-26 18:01:58,874 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=377, Invalid=3163, Unknown=0, NotChecked=0, Total=3540 [2018-06-26 18:01:58,874 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-26 18:01:58,921 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 199. [2018-06-26 18:01:58,921 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-26 18:01:58,924 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 791 transitions. [2018-06-26 18:01:58,924 INFO ]: Start accepts. Automaton has 199 states and 791 transitions. Word has length 81 [2018-06-26 18:01:58,924 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:58,924 INFO ]: Abstraction has 199 states and 791 transitions. [2018-06-26 18:01:58,924 INFO ]: Interpolant automaton has 31 states. [2018-06-26 18:01:58,924 INFO ]: Start isEmpty. Operand 199 states and 791 transitions. [2018-06-26 18:01:58,928 INFO ]: Finished isEmpty. Found accepting run of length 93 [2018-06-26 18:01:58,928 INFO ]: Found error trace [2018-06-26 18:01:58,929 INFO ]: trace histogram [16, 8, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:01:58,929 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:58,930 INFO ]: Analyzing trace with hash -1407435237, now seen corresponding path program 2 times [2018-06-26 18:01:58,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:58,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:58,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:58,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:58,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:58,974 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:59,147 INFO ]: Checked inductivity of 460 backedges. 170 proven. 64 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-06-26 18:01:59,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:59,147 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:59,152 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:01:59,279 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:01:59,279 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:59,283 INFO ]: Computing forward predicates... [2018-06-26 18:01:59,504 INFO ]: Checked inductivity of 460 backedges. 256 proven. 40 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-06-26 18:01:59,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:59,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2018-06-26 18:01:59,524 INFO ]: Interpolant automaton has 28 states [2018-06-26 18:01:59,524 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 18:01:59,524 INFO ]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:01:59,525 INFO ]: Start difference. First operand 199 states and 791 transitions. Second operand 28 states. Received shutdown request... [2018-06-26 18:02:01,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-06-26 18:02:01,867 WARN ]: Verification canceled [2018-06-26 18:02:01,870 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:02:01,871 WARN ]: Timeout [2018-06-26 18:02:01,871 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:02:01 BasicIcfg [2018-06-26 18:02:01,871 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:02:01,872 INFO ]: Toolchain (without parser) took 57620.74 ms. Allocated memory was 309.9 MB in the beginning and 941.1 MB in the end (delta: 631.2 MB). Free memory was 262.2 MB in the beginning and 868.2 MB in the end (delta: -606.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 3.6 GB. [2018-06-26 18:02:01,872 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:02:01,873 INFO ]: ChcToBoogie took 76.38 ms. Allocated memory is still 309.9 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:02:01,873 INFO ]: Boogie Preprocessor took 59.41 ms. Allocated memory is still 309.9 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:02:01,873 INFO ]: RCFGBuilder took 580.79 ms. Allocated memory is still 309.9 MB. Free memory was 257.2 MB in the beginning and 238.1 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:02:01,874 INFO ]: BlockEncodingV2 took 123.57 ms. Allocated memory is still 309.9 MB. Free memory was 238.1 MB in the beginning and 233.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:02:01,874 INFO ]: TraceAbstraction took 56770.54 ms. Allocated memory was 309.9 MB in the beginning and 941.1 MB in the end (delta: 631.2 MB). Free memory was 233.1 MB in the beginning and 868.2 MB in the end (delta: -635.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:02:01,879 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 35 locations, 58 edges - StatisticsResult: Encoded RCFG 28 locations, 51 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.38 ms. Allocated memory is still 309.9 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.41 ms. Allocated memory is still 309.9 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 580.79 ms. Allocated memory is still 309.9 MB. Free memory was 257.2 MB in the beginning and 238.1 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 123.57 ms. Allocated memory is still 309.9 MB. Free memory was 238.1 MB in the beginning and 233.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56770.54 ms. Allocated memory was 309.9 MB in the beginning and 941.1 MB in the end (delta: 631.2 MB). Free memory was 233.1 MB in the beginning and 868.2 MB in the end (delta: -635.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 constructing difference of abstraction (199states) and interpolant automaton (currently 69 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (324 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. TIMEOUT Result, 56.6s OverallTime, 32 OverallIterations, 16 TraceHistogramMax, 35.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2260 SDtfs, 3610 SDslu, 14754 SDs, 0 SdLazy, 35789 SolverSat, 4180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2659 GetRequests, 1609 SyntacticMatches, 9 SemanticMatches, 1041 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10355 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=31, 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.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 1049 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 2931 NumberOfCodeBlocks, 2893 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2869 ConstructedInterpolants, 10 QuantifiedInterpolants, 422744 SizeOfPredicates, 332 NumberOfNonLiveVariables, 16880 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 62 InterpolantComputations, 5 PerfectInterpolantSequences, 6610/8226 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/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-02-01-890.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-02-01-890.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-02-01-890.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-02-01-890.csv Completed graceful shutdown