java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 00:05:12,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 00:05:12,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 00:05:12,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 00:05:12,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 00:05:12,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 00:05:12,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 00:05:12,481 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 00:05:12,483 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 00:05:12,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 00:05:12,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 00:05:12,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 00:05:12,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 00:05:12,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 00:05:12,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 00:05:12,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 00:05:12,492 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 00:05:12,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 00:05:12,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 00:05:12,504 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 00:05:12,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 00:05:12,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 00:05:12,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 00:05:12,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 00:05:12,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 00:05:12,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 00:05:12,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 00:05:12,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 00:05:12,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 00:05:12,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 00:05:12,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 00:05:12,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 00:05:12,515 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 00:05:12,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 00:05:12,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 00:05:12,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 00:05:12,523 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 00:05:12,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 00:05:12,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 00:05:12,547 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 00:05:12,547 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 00:05:12,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 00:05:12,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 00:05:12,549 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 00:05:12,549 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 00:05:12,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 00:05:12,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 00:05:12,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 00:05:12,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 00:05:12,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:05:12,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 00:05:12,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 00:05:12,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 00:05:12,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 00:05:12,551 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 00:05:12,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 00:05:12,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 00:05:12,552 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 00:05:12,553 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 00:05:12,557 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 00:05:12,615 INFO ]: Repository-Root is: /tmp [2018-06-27 00:05:12,628 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 00:05:12,631 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 00:05:12,633 INFO ]: Initializing SmtParser... [2018-06-27 00:05:12,633 INFO ]: SmtParser initialized [2018-06-27 00:05:12,634 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 [2018-06-27 00:05:12,635 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-27 00:05:12,732 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 unknown [2018-06-27 00:05:13,071 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590_e7_590.smt2 [2018-06-27 00:05:13,076 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 00:05:13,082 INFO ]: Walking toolchain with 5 elements. [2018-06-27 00:05:13,082 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 00:05:13,082 INFO ]: Initializing ChcToBoogie... [2018-06-27 00:05:13,083 INFO ]: ChcToBoogie initialized [2018-06-27 00:05:13,086 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,143 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13 Unit [2018-06-27 00:05:13,143 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 00:05:13,144 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 00:05:13,144 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 00:05:13,144 INFO ]: Boogie Preprocessor initialized [2018-06-27 00:05:13,164 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,165 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,174 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,174 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,180 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,181 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,194 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,196 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 00:05:13,197 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 00:05:13,197 INFO ]: Initializing RCFGBuilder... [2018-06-27 00:05:13,197 INFO ]: RCFGBuilder initialized [2018-06-27 00:05:13,197 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (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-27 00:05:13,221 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 00:05:13,221 INFO ]: Found specification of procedure gotoProc [2018-06-27 00:05:13,221 INFO ]: Found implementation of procedure gotoProc [2018-06-27 00:05:13,221 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 00:05:13,221 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 00:05:13,221 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-27 00:05:13,471 INFO ]: Using library mode [2018-06-27 00:05:13,472 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:05:13 BoogieIcfgContainer [2018-06-27 00:05:13,472 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 00:05:13,472 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 00:05:13,472 INFO ]: Initializing BlockEncodingV2... [2018-06-27 00:05:13,473 INFO ]: BlockEncodingV2 initialized [2018-06-27 00:05:13,474 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:05:13" (1/1) ... [2018-06-27 00:05:13,487 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 00:05:13,488 INFO ]: Using Remove infeasible edges [2018-06-27 00:05:13,488 INFO ]: Using Maximize final states [2018-06-27 00:05:13,489 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 00:05:13,489 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 00:05:13,491 INFO ]: Using Remove sink states [2018-06-27 00:05:13,491 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 00:05:13,491 INFO ]: Using Use SBE [2018-06-27 00:05:13,501 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 00:05:14,195 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:05:14,196 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 00:05:14,568 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:05:14,569 INFO ]: SBE split 2 edges [2018-06-27 00:05:14,589 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 00:05:14,593 INFO ]: 0 new accepting states [2018-06-27 00:05:27,390 INFO ]: Removed 2070 edges and 2 locations by large block encoding [2018-06-27 00:05:27,392 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:05:27,407 INFO ]: Removed 16 edges and 0 locations because of local infeasibility [2018-06-27 00:05:27,408 INFO ]: 0 new accepting states [2018-06-27 00:05:27,409 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:05:27,410 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:05:27,415 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 00:05:27,416 INFO ]: 0 new accepting states [2018-06-27 00:05:27,418 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:05:27,419 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:05:27,431 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-27 00:05:27,431 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:05:27 BasicIcfg [2018-06-27 00:05:27,431 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 00:05:27,432 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 00:05:27,432 INFO ]: Initializing TraceAbstraction... [2018-06-27 00:05:27,435 INFO ]: TraceAbstraction initialized [2018-06-27 00:05:27,435 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:05:13" (1/4) ... [2018-06-27 00:05:27,436 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5026ca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 12:05:27, skipping insertion in model container [2018-06-27 00:05:27,436 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:13" (2/4) ... [2018-06-27 00:05:27,436 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5026ca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 12:05:27, skipping insertion in model container [2018-06-27 00:05:27,436 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:05:13" (3/4) ... [2018-06-27 00:05:27,436 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5026ca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:05:27, skipping insertion in model container [2018-06-27 00:05:27,437 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:05:27" (4/4) ... [2018-06-27 00:05:27,438 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 00:05:27,446 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 00:05:27,452 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 00:05:27,487 INFO ]: Using default assertion order modulation [2018-06-27 00:05:27,487 INFO ]: Interprodecural is true [2018-06-27 00:05:27,487 INFO ]: Hoare is false [2018-06-27 00:05:27,487 INFO ]: Compute interpolants for FPandBP [2018-06-27 00:05:27,487 INFO ]: Backedges is TWOTRACK [2018-06-27 00:05:27,488 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 00:05:27,488 INFO ]: Difference is false [2018-06-27 00:05:27,488 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 00:05:27,488 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 00:05:27,512 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 00:05:27,533 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:27,533 INFO ]: Found error trace [2018-06-27 00:05:27,536 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:27,537 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:27,542 INFO ]: Analyzing trace with hash 161085986, now seen corresponding path program 1 times [2018-06-27 00:05:27,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:27,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:27,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:27,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:27,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:27,628 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:27,731 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:27,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:27,733 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:27,735 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:27,750 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:27,751 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:27,753 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 00:05:30,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:30,990 INFO ]: Finished difference Result 7 states and 2057 transitions. [2018-06-27 00:05:30,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:30,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:30,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:31,010 INFO ]: With dead ends: 7 [2018-06-27 00:05:31,010 INFO ]: Without dead ends: 7 [2018-06-27 00:05:31,011 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-27 00:05:31,024 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:31,083 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:31,085 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:31,088 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 00:05:31,089 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 00:05:31,090 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:31,090 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 00:05:31,090 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:31,090 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 00:05:31,092 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:31,092 INFO ]: Found error trace [2018-06-27 00:05:31,092 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:31,092 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:31,092 INFO ]: Analyzing trace with hash 161115777, now seen corresponding path program 1 times [2018-06-27 00:05:31,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:31,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:31,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:31,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:31,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:31,112 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:31,155 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:31,155 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:31,155 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:31,156 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:31,156 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:31,156 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:31,156 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 00:05:33,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:33,674 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-27 00:05:33,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:33,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:33,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:33,678 INFO ]: With dead ends: 9 [2018-06-27 00:05:33,678 INFO ]: Without dead ends: 9 [2018-06-27 00:05:33,678 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-27 00:05:33,679 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:05:33,692 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:05:33,692 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:33,696 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 00:05:33,696 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 00:05:33,696 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:33,696 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 00:05:33,696 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:33,696 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 00:05:33,697 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:33,698 INFO ]: Found error trace [2018-06-27 00:05:33,698 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:33,698 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:33,698 INFO ]: Analyzing trace with hash 161264732, now seen corresponding path program 1 times [2018-06-27 00:05:33,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:33,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:33,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:33,699 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:33,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:33,722 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:33,755 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:33,755 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:33,755 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:33,755 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:33,755 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:33,755 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:33,755 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 00:05:36,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:36,001 INFO ]: Finished difference Result 10 states and 2062 transitions. [2018-06-27 00:05:36,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:36,021 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:36,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:36,026 INFO ]: With dead ends: 10 [2018-06-27 00:05:36,026 INFO ]: Without dead ends: 10 [2018-06-27 00:05:36,026 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-27 00:05:36,026 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-27 00:05:36,042 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-27 00:05:36,042 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:36,046 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:05:36,047 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:05:36,047 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:36,047 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:05:36,047 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:36,047 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:05:36,049 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:36,050 INFO ]: Found error trace [2018-06-27 00:05:36,050 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:36,050 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:36,050 INFO ]: Analyzing trace with hash 161267615, now seen corresponding path program 1 times [2018-06-27 00:05:36,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:36,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:36,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:36,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:36,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:36,069 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:36,150 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:36,151 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:36,151 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:36,151 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:36,151 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:36,151 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:36,151 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:05:38,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:38,273 INFO ]: Finished difference Result 11 states and 2063 transitions. [2018-06-27 00:05:38,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:38,273 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:38,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:38,275 INFO ]: With dead ends: 11 [2018-06-27 00:05:38,275 INFO ]: Without dead ends: 11 [2018-06-27 00:05:38,276 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-27 00:05:38,276 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 00:05:38,290 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 00:05:38,290 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:38,293 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:05:38,294 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:05:38,294 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:38,294 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:05:38,294 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:38,294 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:05:38,295 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:38,295 INFO ]: Found error trace [2018-06-27 00:05:38,295 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:38,295 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:38,295 INFO ]: Analyzing trace with hash 161622224, now seen corresponding path program 1 times [2018-06-27 00:05:38,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:38,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:38,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:38,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:38,296 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:38,316 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:38,372 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:38,373 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:38,373 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:38,373 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:38,373 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:38,373 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:38,373 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:05:40,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:40,212 INFO ]: Finished difference Result 11 states and 2063 transitions. [2018-06-27 00:05:40,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:40,212 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:40,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:40,214 INFO ]: With dead ends: 11 [2018-06-27 00:05:40,214 INFO ]: Without dead ends: 11 [2018-06-27 00:05:40,214 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-27 00:05:40,214 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 00:05:40,224 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 00:05:40,224 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:40,228 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:05:40,228 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:05:40,228 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:40,228 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:05:40,228 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:40,228 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:05:40,229 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:40,229 INFO ]: Found error trace [2018-06-27 00:05:40,229 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:40,229 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:40,229 INFO ]: Analyzing trace with hash 101238750, now seen corresponding path program 1 times [2018-06-27 00:05:40,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:40,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:40,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:40,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:40,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:40,247 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:40,309 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:40,309 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:40,309 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:40,309 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:40,310 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:40,310 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:40,310 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:05:41,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:41,892 INFO ]: Finished difference Result 11 states and 2063 transitions. [2018-06-27 00:05:41,893 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:41,893 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:41,893 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:41,895 INFO ]: With dead ends: 11 [2018-06-27 00:05:41,895 INFO ]: Without dead ends: 11 [2018-06-27 00:05:41,895 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-27 00:05:41,895 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 00:05:41,904 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 00:05:41,904 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:41,909 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:05:41,909 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:05:41,910 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:41,910 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:05:41,910 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:41,910 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:05:41,911 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:05:41,911 INFO ]: Found error trace [2018-06-27 00:05:41,911 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:05:41,911 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:41,911 INFO ]: Analyzing trace with hash 101328123, now seen corresponding path program 1 times [2018-06-27 00:05:41,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:41,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:41,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:41,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:41,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:41,918 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:41,965 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:41,965 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:41,965 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:41,965 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:41,965 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:41,965 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:41,966 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:05:43,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:43,569 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-27 00:05:43,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:43,572 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:05:43,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:43,574 INFO ]: With dead ends: 9 [2018-06-27 00:05:43,575 INFO ]: Without dead ends: 9 [2018-06-27 00:05:43,575 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-27 00:05:43,575 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:05:43,580 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-27 00:05:43,580 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:43,582 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 00:05:43,582 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 00:05:43,582 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:43,583 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 00:05:43,583 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:43,583 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 00:05:43,584 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:43,584 INFO ]: Found error trace [2018-06-27 00:05:43,584 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:43,584 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:43,584 INFO ]: Analyzing trace with hash 579680501, now seen corresponding path program 1 times [2018-06-27 00:05:43,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:43,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:43,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:43,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:43,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:43,600 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:43,682 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:43,682 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:43,682 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:43,682 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:43,682 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:43,682 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:43,682 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 00:05:45,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:45,328 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-27 00:05:45,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:45,328 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:45,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:45,330 INFO ]: With dead ends: 8 [2018-06-27 00:05:45,330 INFO ]: Without dead ends: 7 [2018-06-27 00:05:45,330 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-27 00:05:45,330 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:45,335 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:45,335 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:45,336 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1545 transitions. [2018-06-27 00:05:45,336 INFO ]: Start accepts. Automaton has 7 states and 1545 transitions. Word has length 6 [2018-06-27 00:05:45,336 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:45,336 INFO ]: Abstraction has 7 states and 1545 transitions. [2018-06-27 00:05:45,336 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:45,336 INFO ]: Start isEmpty. Operand 7 states and 1545 transitions. [2018-06-27 00:05:45,338 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:45,338 INFO ]: Found error trace [2018-06-27 00:05:45,338 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:45,338 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:45,338 INFO ]: Analyzing trace with hash 580604022, now seen corresponding path program 1 times [2018-06-27 00:05:45,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:45,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:45,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:45,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:45,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:45,362 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:45,391 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:45,391 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:45,391 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:45,391 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:45,391 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:45,391 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:45,391 INFO ]: Start difference. First operand 7 states and 1545 transitions. Second operand 3 states. [2018-06-27 00:05:46,604 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:46,605 INFO ]: Finished difference Result 8 states and 1545 transitions. [2018-06-27 00:05:46,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:46,605 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:46,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:46,606 INFO ]: With dead ends: 8 [2018-06-27 00:05:46,606 INFO ]: Without dead ends: 7 [2018-06-27 00:05:46,606 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-27 00:05:46,606 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:46,608 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:46,608 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:46,609 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2018-06-27 00:05:46,609 INFO ]: Start accepts. Automaton has 7 states and 1033 transitions. Word has length 6 [2018-06-27 00:05:46,609 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:46,609 INFO ]: Abstraction has 7 states and 1033 transitions. [2018-06-27 00:05:46,609 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:46,609 INFO ]: Start isEmpty. Operand 7 states and 1033 transitions. [2018-06-27 00:05:46,609 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:46,609 INFO ]: Found error trace [2018-06-27 00:05:46,609 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:46,609 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:46,610 INFO ]: Analyzing trace with hash 581527543, now seen corresponding path program 1 times [2018-06-27 00:05:46,610 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:46,610 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:46,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:46,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:46,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:46,623 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:46,648 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:46,648 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:46,648 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:46,648 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:46,648 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:46,648 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:46,648 INFO ]: Start difference. First operand 7 states and 1033 transitions. Second operand 3 states. [2018-06-27 00:05:47,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:47,466 INFO ]: Finished difference Result 8 states and 1033 transitions. [2018-06-27 00:05:47,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:47,467 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:47,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:47,467 INFO ]: With dead ends: 8 [2018-06-27 00:05:47,467 INFO ]: Without dead ends: 7 [2018-06-27 00:05:47,468 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-27 00:05:47,468 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:47,469 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:47,469 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:47,470 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2018-06-27 00:05:47,470 INFO ]: Start accepts. Automaton has 7 states and 777 transitions. Word has length 6 [2018-06-27 00:05:47,470 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:47,470 INFO ]: Abstraction has 7 states and 777 transitions. [2018-06-27 00:05:47,470 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:47,470 INFO ]: Start isEmpty. Operand 7 states and 777 transitions. [2018-06-27 00:05:47,470 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:47,470 INFO ]: Found error trace [2018-06-27 00:05:47,470 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:47,470 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:47,470 INFO ]: Analyzing trace with hash -366005003, now seen corresponding path program 1 times [2018-06-27 00:05:47,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:47,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:47,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:47,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:47,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:47,497 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:47,575 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:47,575 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:47,575 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:47,575 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:47,575 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:47,575 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:47,575 INFO ]: Start difference. First operand 7 states and 777 transitions. Second operand 3 states. [2018-06-27 00:05:48,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:48,195 INFO ]: Finished difference Result 8 states and 777 transitions. [2018-06-27 00:05:48,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:48,195 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:48,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:48,196 INFO ]: With dead ends: 8 [2018-06-27 00:05:48,196 INFO ]: Without dead ends: 7 [2018-06-27 00:05:48,196 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-27 00:05:48,196 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:48,197 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:48,197 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:48,198 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 585 transitions. [2018-06-27 00:05:48,198 INFO ]: Start accepts. Automaton has 7 states and 585 transitions. Word has length 6 [2018-06-27 00:05:48,198 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:48,198 INFO ]: Abstraction has 7 states and 585 transitions. [2018-06-27 00:05:48,198 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:48,198 INFO ]: Start isEmpty. Operand 7 states and 585 transitions. [2018-06-27 00:05:48,198 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:48,198 INFO ]: Found error trace [2018-06-27 00:05:48,198 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:48,198 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:48,198 INFO ]: Analyzing trace with hash -365081482, now seen corresponding path program 1 times [2018-06-27 00:05:48,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:48,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:48,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:48,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:48,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:48,207 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:48,236 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:48,237 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:48,237 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:48,237 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:48,237 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:48,237 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:48,237 INFO ]: Start difference. First operand 7 states and 585 transitions. Second operand 3 states. [2018-06-27 00:05:48,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:48,731 INFO ]: Finished difference Result 8 states and 585 transitions. [2018-06-27 00:05:48,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:48,732 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:48,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:48,732 INFO ]: With dead ends: 8 [2018-06-27 00:05:48,732 INFO ]: Without dead ends: 7 [2018-06-27 00:05:48,732 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-27 00:05:48,732 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:48,734 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:48,734 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:48,735 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 489 transitions. [2018-06-27 00:05:48,735 INFO ]: Start accepts. Automaton has 7 states and 489 transitions. Word has length 6 [2018-06-27 00:05:48,735 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:48,735 INFO ]: Abstraction has 7 states and 489 transitions. [2018-06-27 00:05:48,735 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:48,735 INFO ]: Start isEmpty. Operand 7 states and 489 transitions. [2018-06-27 00:05:48,735 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:48,735 INFO ]: Found error trace [2018-06-27 00:05:48,735 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:48,736 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:48,736 INFO ]: Analyzing trace with hash -363234440, now seen corresponding path program 1 times [2018-06-27 00:05:48,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:48,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:48,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:48,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:48,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:48,750 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:48,837 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:48,838 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:48,838 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:48,838 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:48,838 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:48,838 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:48,838 INFO ]: Start difference. First operand 7 states and 489 transitions. Second operand 3 states. [2018-06-27 00:05:49,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:49,246 INFO ]: Finished difference Result 8 states and 489 transitions. [2018-06-27 00:05:49,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:49,247 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:49,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:49,247 INFO ]: With dead ends: 8 [2018-06-27 00:05:49,247 INFO ]: Without dead ends: 7 [2018-06-27 00:05:49,247 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-27 00:05:49,247 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:49,248 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:49,248 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:49,249 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 329 transitions. [2018-06-27 00:05:49,249 INFO ]: Start accepts. Automaton has 7 states and 329 transitions. Word has length 6 [2018-06-27 00:05:49,249 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:49,249 INFO ]: Abstraction has 7 states and 329 transitions. [2018-06-27 00:05:49,249 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:49,249 INFO ]: Start isEmpty. Operand 7 states and 329 transitions. [2018-06-27 00:05:49,249 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:49,249 INFO ]: Found error trace [2018-06-27 00:05:49,249 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:49,249 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:49,249 INFO ]: Analyzing trace with hash 107761270, now seen corresponding path program 1 times [2018-06-27 00:05:49,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:49,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:49,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:49,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:49,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:49,272 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:49,300 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:49,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:49,300 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:49,301 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:49,301 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:49,301 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:49,301 INFO ]: Start difference. First operand 7 states and 329 transitions. Second operand 3 states. [2018-06-27 00:05:49,553 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:49,553 INFO ]: Finished difference Result 8 states and 329 transitions. [2018-06-27 00:05:49,553 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:49,554 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:49,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:49,554 INFO ]: With dead ends: 8 [2018-06-27 00:05:49,554 INFO ]: Without dead ends: 7 [2018-06-27 00:05:49,554 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-27 00:05:49,554 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:49,555 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:49,555 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:49,556 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2018-06-27 00:05:49,556 INFO ]: Start accepts. Automaton has 7 states and 201 transitions. Word has length 6 [2018-06-27 00:05:49,556 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:49,556 INFO ]: Abstraction has 7 states and 201 transitions. [2018-06-27 00:05:49,556 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:49,556 INFO ]: Start isEmpty. Operand 7 states and 201 transitions. [2018-06-27 00:05:49,556 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:49,556 INFO ]: Found error trace [2018-06-27 00:05:49,556 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:49,556 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:49,556 INFO ]: Analyzing trace with hash -361387398, now seen corresponding path program 1 times [2018-06-27 00:05:49,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:49,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:49,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:49,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:49,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:49,572 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:49,686 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:49,686 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:49,686 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:49,686 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:49,686 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:49,686 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:49,686 INFO ]: Start difference. First operand 7 states and 201 transitions. Second operand 3 states. [2018-06-27 00:05:50,319 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:50,319 INFO ]: Finished difference Result 8 states and 201 transitions. [2018-06-27 00:05:50,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:50,320 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:05:50,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:50,321 INFO ]: With dead ends: 8 [2018-06-27 00:05:50,321 INFO ]: Without dead ends: 7 [2018-06-27 00:05:50,321 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:50,321 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:05:50,322 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:05:50,322 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:05:50,322 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-06-27 00:05:50,322 INFO ]: Start accepts. Automaton has 7 states and 57 transitions. Word has length 6 [2018-06-27 00:05:50,322 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:50,322 INFO ]: Abstraction has 7 states and 57 transitions. [2018-06-27 00:05:50,322 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:50,322 INFO ]: Start isEmpty. Operand 7 states and 57 transitions. [2018-06-27 00:05:50,322 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:05:50,322 INFO ]: Found error trace [2018-06-27 00:05:50,322 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:05:50,322 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:50,323 INFO ]: Analyzing trace with hash -1015240266, now seen corresponding path program 1 times [2018-06-27 00:05:50,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:50,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:50,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:50,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:50,323 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:50,332 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:50,446 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:50,446 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:05:50,446 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-27 00:05:50,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:50,518 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:50,548 INFO ]: Computing forward predicates... [2018-06-27 00:05:50,607 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:50,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:05:50,640 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 00:05:50,640 INFO ]: Interpolant automaton has 4 states [2018-06-27 00:05:50,640 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 00:05:50,640 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 00:05:50,641 INFO ]: Start difference. First operand 7 states and 57 transitions. Second operand 4 states. [2018-06-27 00:05:51,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:51,381 INFO ]: Finished difference Result 9 states and 58 transitions. [2018-06-27 00:05:51,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:05:51,381 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 00:05:51,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:51,381 INFO ]: With dead ends: 9 [2018-06-27 00:05:51,381 INFO ]: Without dead ends: 8 [2018-06-27 00:05:51,382 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:05:51,382 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:05:51,383 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:05:51,383 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:51,383 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2018-06-27 00:05:51,383 INFO ]: Start accepts. Automaton has 8 states and 34 transitions. Word has length 6 [2018-06-27 00:05:51,383 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:51,383 INFO ]: Abstraction has 8 states and 34 transitions. [2018-06-27 00:05:51,383 INFO ]: Interpolant automaton has 4 states. [2018-06-27 00:05:51,383 INFO ]: Start isEmpty. Operand 8 states and 34 transitions. [2018-06-27 00:05:51,383 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:05:51,383 INFO ]: Found error trace [2018-06-27 00:05:51,383 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:05:51,383 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:51,384 INFO ]: Analyzing trace with hash -1446753950, now seen corresponding path program 1 times [2018-06-27 00:05:51,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:51,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:51,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:51,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:51,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:51,399 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:51,420 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 00:05:51,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:51,420 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:51,420 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:51,421 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:51,421 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:51,421 INFO ]: Start difference. First operand 8 states and 34 transitions. Second operand 3 states. [2018-06-27 00:05:51,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:51,539 INFO ]: Finished difference Result 9 states and 34 transitions. [2018-06-27 00:05:51,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:51,546 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 00:05:51,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:51,546 INFO ]: With dead ends: 9 [2018-06-27 00:05:51,546 INFO ]: Without dead ends: 8 [2018-06-27 00:05:51,546 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-27 00:05:51,546 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:05:51,547 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:05:51,547 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:51,547 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-06-27 00:05:51,547 INFO ]: Start accepts. Automaton has 8 states and 26 transitions. Word has length 7 [2018-06-27 00:05:51,547 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:51,547 INFO ]: Abstraction has 8 states and 26 transitions. [2018-06-27 00:05:51,547 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:51,547 INFO ]: Start isEmpty. Operand 8 states and 26 transitions. [2018-06-27 00:05:51,548 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:05:51,548 INFO ]: Found error trace [2018-06-27 00:05:51,548 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:05:51,548 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:51,548 INFO ]: Analyzing trace with hash -1526694943, now seen corresponding path program 2 times [2018-06-27 00:05:51,548 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:51,548 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:51,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:51,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:51,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:51,564 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:52,140 WARN ]: Spent 513.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-27 00:05:52,412 WARN ]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-27 00:05:52,564 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:52,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:05:52,565 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-27 00:05:52,579 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:05:52,656 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-27 00:05:52,656 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:52,659 INFO ]: Computing forward predicates... [2018-06-27 00:05:52,888 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-27 00:05:53,177 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:53,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:05:53,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 00:05:53,203 INFO ]: Interpolant automaton has 7 states [2018-06-27 00:05:53,203 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 00:05:53,203 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:05:53,203 INFO ]: Start difference. First operand 8 states and 26 transitions. Second operand 7 states. [2018-06-27 00:05:53,481 WARN ]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-06-27 00:05:53,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:53,883 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-27 00:05:53,883 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-27 00:05:53,883 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 00:05:53,883 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:53,883 INFO ]: With dead ends: 12 [2018-06-27 00:05:53,883 INFO ]: Without dead ends: 8 [2018-06-27 00:05:53,883 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-27 00:05:53,883 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:05:53,884 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:05:53,884 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:53,884 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-27 00:05:53,884 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-27 00:05:53,884 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:53,884 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-27 00:05:53,884 INFO ]: Interpolant automaton has 7 states. [2018-06-27 00:05:53,884 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-27 00:05:53,885 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:05:53,885 INFO ]: Found error trace [2018-06-27 00:05:53,885 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:05:53,885 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:53,885 INFO ]: Analyzing trace with hash 102788080, now seen corresponding path program 1 times [2018-06-27 00:05:53,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:53,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:53,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:53,886 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-27 00:05:53,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:53,899 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:54,015 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-27 00:05:54,015 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:05:54,016 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:05:54,016 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:05:54,016 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:05:54,016 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:54,016 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 3 states. [2018-06-27 00:05:54,062 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:54,062 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-27 00:05:54,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:05:54,063 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-27 00:05:54,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:54,063 INFO ]: With dead ends: 9 [2018-06-27 00:05:54,063 INFO ]: Without dead ends: 8 [2018-06-27 00:05:54,063 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:05:54,063 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:05:54,064 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:05:54,064 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:54,064 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-27 00:05:54,064 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-27 00:05:54,064 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:54,064 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-27 00:05:54,064 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:05:54,064 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-27 00:05:54,064 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:05:54,064 INFO ]: Found error trace [2018-06-27 00:05:54,065 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:05:54,065 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:54,065 INFO ]: Analyzing trace with hash -2044398245, now seen corresponding path program 1 times [2018-06-27 00:05:54,065 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:54,065 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:54,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:54,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:54,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:54,083 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:54,263 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:54,263 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:05:54,263 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-27 00:05:54,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:54,304 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:54,307 INFO ]: Computing forward predicates... [2018-06-27 00:05:54,561 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:54,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:05:54,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 00:05:54,581 INFO ]: Interpolant automaton has 7 states [2018-06-27 00:05:54,581 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 00:05:54,581 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:05:54,581 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-06-27 00:05:54,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:54,639 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-27 00:05:54,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:05:54,639 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 00:05:54,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:54,640 INFO ]: With dead ends: 10 [2018-06-27 00:05:54,640 INFO ]: Without dead ends: 8 [2018-06-27 00:05:54,640 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:05:54,640 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:05:54,641 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:05:54,641 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:54,641 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-27 00:05:54,641 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-27 00:05:54,641 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:54,641 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-27 00:05:54,641 INFO ]: Interpolant automaton has 7 states. [2018-06-27 00:05:54,641 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-27 00:05:54,641 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:05:54,641 INFO ]: Found error trace [2018-06-27 00:05:54,641 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:05:54,641 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:54,641 INFO ]: Analyzing trace with hash 1846193061, now seen corresponding path program 1 times [2018-06-27 00:05:54,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:54,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:54,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:54,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:54,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:54,653 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:54,755 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:54,755 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:05:54,755 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-27 00:05:54,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:54,805 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:54,808 INFO ]: Computing forward predicates... [2018-06-27 00:05:55,010 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:55,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:05:55,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-27 00:05:55,030 INFO ]: Interpolant automaton has 6 states [2018-06-27 00:05:55,030 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-27 00:05:55,030 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:05:55,031 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 6 states. [2018-06-27 00:05:55,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:55,080 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-27 00:05:55,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 00:05:55,080 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-27 00:05:55,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:55,080 INFO ]: With dead ends: 10 [2018-06-27 00:05:55,080 INFO ]: Without dead ends: 8 [2018-06-27 00:05:55,080 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-27 00:05:55,080 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:05:55,081 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:05:55,081 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:05:55,081 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-27 00:05:55,081 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-27 00:05:55,081 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:55,081 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-27 00:05:55,081 INFO ]: Interpolant automaton has 6 states. [2018-06-27 00:05:55,081 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-27 00:05:55,082 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:05:55,082 INFO ]: Found error trace [2018-06-27 00:05:55,082 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:05:55,082 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:05:55,082 INFO ]: Analyzing trace with hash 760663907, now seen corresponding path program 1 times [2018-06-27 00:05:55,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:05:55,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:05:55,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:55,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:55,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:05:55,098 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:55,251 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:55,251 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:05:55,251 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-27 00:05:55,257 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:05:55,296 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:05:55,298 INFO ]: Computing forward predicates... [2018-06-27 00:05:55,479 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:05:55,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:05:55,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 00:05:55,499 INFO ]: Interpolant automaton has 7 states [2018-06-27 00:05:55,499 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 00:05:55,499 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:05:55,499 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 7 states. [2018-06-27 00:05:55,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:05:55,543 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-27 00:05:55,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 00:05:55,543 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 00:05:55,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:05:55,543 INFO ]: With dead ends: 4 [2018-06-27 00:05:55,543 INFO ]: Without dead ends: 0 [2018-06-27 00:05:55,544 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:05:55,544 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 00:05:55,544 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 00:05:55,544 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 00:05:55,544 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 00:05:55,544 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-27 00:05:55,544 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:05:55,544 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 00:05:55,544 INFO ]: Interpolant automaton has 7 states. [2018-06-27 00:05:55,544 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 00:05:55,544 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 00:05:55,546 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 00:05:55,547 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:05:55 BasicIcfg [2018-06-27 00:05:55,547 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 00:05:55,547 INFO ]: Toolchain (without parser) took 42470.49 ms. Allocated memory was 307.8 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 260.0 MB in the beginning and 645.4 MB in the end (delta: -385.4 MB). Peak memory consumption was 657.9 MB. Max. memory is 3.6 GB. [2018-06-27 00:05:55,548 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 00:05:55,548 INFO ]: ChcToBoogie took 61.18 ms. Allocated memory is still 307.8 MB. Free memory was 260.0 MB in the beginning and 257.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:05:55,548 INFO ]: Boogie Preprocessor took 52.33 ms. Allocated memory is still 307.8 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-27 00:05:55,549 INFO ]: RCFGBuilder took 275.24 ms. Allocated memory is still 307.8 MB. Free memory was 256.0 MB in the beginning and 242.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:05:55,549 INFO ]: BlockEncodingV2 took 13958.95 ms. Allocated memory was 307.8 MB in the beginning and 785.4 MB in the end (delta: 477.6 MB). Free memory was 242.0 MB in the beginning and 467.0 MB in the end (delta: -225.0 MB). Peak memory consumption was 423.6 MB. Max. memory is 3.6 GB. [2018-06-27 00:05:55,549 INFO ]: TraceAbstraction took 28114.57 ms. Allocated memory was 785.4 MB in the beginning and 1.4 GB in the end (delta: 565.7 MB). Free memory was 467.0 MB in the beginning and 645.4 MB in the end (delta: -178.4 MB). Peak memory consumption was 387.3 MB. Max. memory is 3.6 GB. [2018-06-27 00:05:55,552 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.18 ms. Allocated memory is still 307.8 MB. Free memory was 260.0 MB in the beginning and 257.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 52.33 ms. Allocated memory is still 307.8 MB. Free memory was 257.0 MB in the beginning and 256.0 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 275.24 ms. Allocated memory is still 307.8 MB. Free memory was 256.0 MB in the beginning and 242.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13958.95 ms. Allocated memory was 307.8 MB in the beginning and 785.4 MB in the end (delta: 477.6 MB). Free memory was 242.0 MB in the beginning and 467.0 MB in the end (delta: -225.0 MB). Peak memory consumption was 423.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28114.57 ms. Allocated memory was 785.4 MB in the beginning and 1.4 GB in the end (delta: 565.7 MB). Free memory was 467.0 MB in the beginning and 645.4 MB in the end (delta: -178.4 MB). Peak memory consumption was 387.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 28.0s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21539 SDtfs, 2 SDslu, 99 SDs, 0 SdLazy, 11364 SolverSat, 10321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 15 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1929 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 14/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_00-05-55-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_00-05-55-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_00-05-55-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_00-05-55-562.csv Received shutdown request...