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/ex8.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:47:22,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:47:22,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:47:22,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:47:22,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:47:22,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:47:22,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:47:22,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:47:22,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:47:22,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:47:22,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:47:22,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:47:22,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:47:22,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:47:22,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:47:22,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:47:22,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:47:22,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:47:22,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:47:22,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:47:22,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:47:22,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:47:22,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:47:22,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:47:22,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:47:22,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:47:22,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:47:22,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:47:22,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:47:22,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:47:22,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:47:22,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:47:22,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:47:22,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:47:22,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:47:22,522 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:47:22,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:47:22,548 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:47:22,548 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:47:22,548 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:47:22,549 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:47:22,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:47:22,550 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:47:22,550 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:47:22,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:47:22,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:47:22,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:47:22,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:47:22,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:47:22,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:47:22,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:47:22,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:47:22,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:47:22,552 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:47:22,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:47:22,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:47:22,552 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:47:22,557 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:47:22,558 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:47:22,602 INFO ]: Repository-Root is: /tmp [2018-06-25 03:47:22,616 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:47:22,623 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:47:22,625 INFO ]: Initializing SmtParser... [2018-06-25 03:47:22,625 INFO ]: SmtParser initialized [2018-06-25 03:47:22,625 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8.smt2 [2018-06-25 03:47:22,627 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-25 03:47:22,713 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8.smt2 unknown [2018-06-25 03:47:22,989 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8.smt2 [2018-06-25 03:47:22,999 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:47:23,003 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:47:23,003 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:47:23,003 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:47:23,004 INFO ]: ChcToBoogie initialized [2018-06-25 03:47:23,007 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:47:22" (1/1) ... [2018-06-25 03:47:23,063 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23 Unit [2018-06-25 03:47:23,063 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:47:23,064 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:47:23,064 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:47:23,064 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:47:23,083 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,084 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,092 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,093 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,097 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,099 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,111 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,113 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:47:23,113 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:47:23,113 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:47:23,113 INFO ]: RCFGBuilder initialized [2018-06-25 03:47:23,114 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (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-25 03:47:23,138 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:47:23,138 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:47:23,138 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:47:23,138 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:47:23,138 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:47:23,138 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-25 03:47:23,395 INFO ]: Using library mode [2018-06-25 03:47:23,396 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:47:23 BoogieIcfgContainer [2018-06-25 03:47:23,396 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:47:23,396 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:47:23,396 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:47:23,397 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:47:23,398 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:47:23" (1/1) ... [2018-06-25 03:47:23,410 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:47:23,412 INFO ]: Using Remove infeasible edges [2018-06-25 03:47:23,412 INFO ]: Using Maximize final states [2018-06-25 03:47:23,412 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:47:23,413 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:47:23,414 INFO ]: Using Remove sink states [2018-06-25 03:47:23,415 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:47:23,415 INFO ]: Using Use SBE [2018-06-25 03:47:23,420 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:47:25,423 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:47:26,032 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:47:26,290 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:47:26,292 INFO ]: SBE split 2 edges [2018-06-25 03:47:26,312 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:47:26,316 INFO ]: 0 new accepting states [2018-06-25 03:47:38,332 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 03:47:38,334 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:47:38,348 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 03:47:38,349 INFO ]: 0 new accepting states [2018-06-25 03:47:38,351 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:47:38,351 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:47:38,357 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:47:38,358 INFO ]: 0 new accepting states [2018-06-25 03:47:38,361 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:47:38,362 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:47:38,372 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 03:47:38,373 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:47:38 BasicIcfg [2018-06-25 03:47:38,373 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:47:38,374 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:47:38,374 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:47:38,377 INFO ]: TraceAbstraction initialized [2018-06-25 03:47:38,377 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:47:22" (1/4) ... [2018-06-25 03:47:38,379 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a688673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:47:38, skipping insertion in model container [2018-06-25 03:47:38,379 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:47:23" (2/4) ... [2018-06-25 03:47:38,379 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a688673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:47:38, skipping insertion in model container [2018-06-25 03:47:38,379 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:47:23" (3/4) ... [2018-06-25 03:47:38,380 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a688673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:47:38, skipping insertion in model container [2018-06-25 03:47:38,380 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:47:38" (4/4) ... [2018-06-25 03:47:38,381 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:47:38,387 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:47:38,393 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:47:38,436 INFO ]: Using default assertion order modulation [2018-06-25 03:47:38,437 INFO ]: Interprodecural is true [2018-06-25 03:47:38,437 INFO ]: Hoare is false [2018-06-25 03:47:38,437 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:47:38,437 INFO ]: Backedges is TWOTRACK [2018-06-25 03:47:38,437 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:47:38,437 INFO ]: Difference is false [2018-06-25 03:47:38,437 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:47:38,437 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:47:38,460 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:47:38,479 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:47:38,479 INFO ]: Found error trace [2018-06-25 03:47:38,480 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:47:38,480 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:38,485 INFO ]: Analyzing trace with hash 161085986, now seen corresponding path program 1 times [2018-06-25 03:47:38,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:38,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:38,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:38,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:38,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:38,580 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:38,679 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:38,682 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:38,682 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:38,684 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:38,699 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:38,699 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:38,701 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:47:41,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:41,979 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-25 03:47:41,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:41,980 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:47:41,980 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:41,993 INFO ]: With dead ends: 7 [2018-06-25 03:47:41,994 INFO ]: Without dead ends: 7 [2018-06-25 03:47:41,995 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-25 03:47:42,011 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:42,063 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:42,064 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:42,069 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:47:42,070 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:47:42,071 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:42,071 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:47:42,071 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:42,071 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:47:42,072 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:47:42,072 INFO ]: Found error trace [2018-06-25 03:47:42,072 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:47:42,072 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:42,072 INFO ]: Analyzing trace with hash 161115777, now seen corresponding path program 1 times [2018-06-25 03:47:42,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:42,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:42,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:42,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:42,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:42,081 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:42,140 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:42,140 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:42,140 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:42,142 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:42,142 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:42,142 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:42,142 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:47:44,838 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:44,839 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 03:47:44,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:44,959 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:47:44,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:44,962 INFO ]: With dead ends: 9 [2018-06-25 03:47:44,962 INFO ]: Without dead ends: 9 [2018-06-25 03:47:44,963 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-25 03:47:44,963 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:44,976 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:47:44,976 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:44,981 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:47:44,981 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:47:44,981 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:44,981 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:47:44,981 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:44,981 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:47:44,982 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:47:44,982 INFO ]: Found error trace [2018-06-25 03:47:44,983 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:47:44,983 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:44,983 INFO ]: Analyzing trace with hash 161503060, now seen corresponding path program 1 times [2018-06-25 03:47:44,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:44,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:44,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:44,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:44,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:44,993 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:45,023 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:45,024 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:45,024 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:45,024 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:45,024 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:45,024 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:45,024 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:47:47,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:47,990 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 03:47:47,990 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:47,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:47:47,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:47,993 INFO ]: With dead ends: 9 [2018-06-25 03:47:47,993 INFO ]: Without dead ends: 9 [2018-06-25 03:47:47,994 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-25 03:47:47,994 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:48,008 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:47:48,008 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:48,012 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:47:48,012 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:47:48,012 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:48,012 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:47:48,012 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:48,012 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:47:48,015 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:47:48,015 INFO ]: Found error trace [2018-06-25 03:47:48,015 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:47:48,015 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:48,015 INFO ]: Analyzing trace with hash 100997539, now seen corresponding path program 1 times [2018-06-25 03:47:48,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:48,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:48,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:48,016 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:48,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:48,033 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:48,086 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:48,086 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:48,086 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:48,086 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:48,086 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:48,086 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:48,086 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:47:49,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:49,916 INFO ]: Finished difference Result 10 states and 2063 transitions. [2018-06-25 03:47:49,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:49,928 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:47:49,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:49,931 INFO ]: With dead ends: 10 [2018-06-25 03:47:49,931 INFO ]: Without dead ends: 10 [2018-06-25 03:47:49,932 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-25 03:47:49,932 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:47:49,947 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 03:47:49,947 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:47:49,950 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2061 transitions. [2018-06-25 03:47:49,950 INFO ]: Start accepts. Automaton has 8 states and 2061 transitions. Word has length 5 [2018-06-25 03:47:49,950 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:49,950 INFO ]: Abstraction has 8 states and 2061 transitions. [2018-06-25 03:47:49,950 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:49,950 INFO ]: Start isEmpty. Operand 8 states and 2061 transitions. [2018-06-25 03:47:49,951 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:47:49,951 INFO ]: Found error trace [2018-06-25 03:47:49,952 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:47:49,952 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:49,952 INFO ]: Analyzing trace with hash 100998500, now seen corresponding path program 1 times [2018-06-25 03:47:49,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:49,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:49,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:49,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:49,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:49,964 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:50,033 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:50,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:50,033 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:50,033 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:50,033 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:50,033 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:50,033 INFO ]: Start difference. First operand 8 states and 2061 transitions. Second operand 3 states. [2018-06-25 03:47:51,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:51,736 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 03:47:51,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:51,736 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:47:51,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:51,738 INFO ]: With dead ends: 9 [2018-06-25 03:47:51,738 INFO ]: Without dead ends: 9 [2018-06-25 03:47:51,739 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:51,739 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:47:51,747 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 03:47:51,747 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:51,751 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 03:47:51,751 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 03:47:51,751 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:51,751 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 03:47:51,751 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:51,751 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 03:47:51,752 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:51,752 INFO ]: Found error trace [2018-06-25 03:47:51,752 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:51,752 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:51,753 INFO ]: Analyzing trace with hash 579710292, now seen corresponding path program 1 times [2018-06-25 03:47:51,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:51,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:51,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:51,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:51,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:51,780 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:51,886 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:51,886 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:51,886 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:51,886 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:51,886 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:51,886 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:51,886 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 03:47:53,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:53,684 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 03:47:53,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:53,685 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:53,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:53,686 INFO ]: With dead ends: 8 [2018-06-25 03:47:53,686 INFO ]: Without dead ends: 7 [2018-06-25 03:47:53,687 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-25 03:47:53,687 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:53,693 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:53,693 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:53,695 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1546 transitions. [2018-06-25 03:47:53,695 INFO ]: Start accepts. Automaton has 7 states and 1546 transitions. Word has length 6 [2018-06-25 03:47:53,695 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:53,695 INFO ]: Abstraction has 7 states and 1546 transitions. [2018-06-25 03:47:53,695 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:53,695 INFO ]: Start isEmpty. Operand 7 states and 1546 transitions. [2018-06-25 03:47:53,696 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:53,696 INFO ]: Found error trace [2018-06-25 03:47:53,696 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:53,696 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:53,696 INFO ]: Analyzing trace with hash 580633813, now seen corresponding path program 1 times [2018-06-25 03:47:53,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:53,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:53,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:53,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:53,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:53,727 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:53,773 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:53,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:53,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:53,773 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:53,773 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:53,773 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:53,774 INFO ]: Start difference. First operand 7 states and 1546 transitions. Second operand 3 states. [2018-06-25 03:47:54,979 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:54,979 INFO ]: Finished difference Result 8 states and 1546 transitions. [2018-06-25 03:47:54,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:54,995 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:54,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:54,996 INFO ]: With dead ends: 8 [2018-06-25 03:47:54,996 INFO ]: Without dead ends: 7 [2018-06-25 03:47:54,996 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-25 03:47:54,996 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:54,998 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:54,998 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:54,998 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2018-06-25 03:47:54,998 INFO ]: Start accepts. Automaton has 7 states and 778 transitions. Word has length 6 [2018-06-25 03:47:54,998 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:54,998 INFO ]: Abstraction has 7 states and 778 transitions. [2018-06-25 03:47:54,998 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:54,998 INFO ]: Start isEmpty. Operand 7 states and 778 transitions. [2018-06-25 03:47:54,999 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:54,999 INFO ]: Found error trace [2018-06-25 03:47:54,999 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:54,999 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:54,999 INFO ]: Analyzing trace with hash -365051691, now seen corresponding path program 1 times [2018-06-25 03:47:54,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:54,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:55,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:55,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:55,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:55,018 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:55,050 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:55,050 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:55,050 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:55,050 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:55,050 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:55,050 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:55,050 INFO ]: Start difference. First operand 7 states and 778 transitions. Second operand 3 states. [2018-06-25 03:47:55,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:55,675 INFO ]: Finished difference Result 8 states and 778 transitions. [2018-06-25 03:47:55,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:55,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:55,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:55,676 INFO ]: With dead ends: 8 [2018-06-25 03:47:55,676 INFO ]: Without dead ends: 7 [2018-06-25 03:47:55,676 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:55,676 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:55,677 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:55,677 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:55,678 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 586 transitions. [2018-06-25 03:47:55,678 INFO ]: Start accepts. Automaton has 7 states and 586 transitions. Word has length 6 [2018-06-25 03:47:55,678 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:55,678 INFO ]: Abstraction has 7 states and 586 transitions. [2018-06-25 03:47:55,678 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:55,678 INFO ]: Start isEmpty. Operand 7 states and 586 transitions. [2018-06-25 03:47:55,678 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:55,678 INFO ]: Found error trace [2018-06-25 03:47:55,678 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:55,678 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:55,678 INFO ]: Analyzing trace with hash -363204649, now seen corresponding path program 1 times [2018-06-25 03:47:55,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:55,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:55,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:55,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:55,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:55,689 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:55,739 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:55,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:55,740 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:55,740 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:55,740 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:55,740 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:55,740 INFO ]: Start difference. First operand 7 states and 586 transitions. Second operand 3 states. [2018-06-25 03:47:56,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:56,241 INFO ]: Finished difference Result 8 states and 586 transitions. [2018-06-25 03:47:56,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:56,241 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:56,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:56,242 INFO ]: With dead ends: 8 [2018-06-25 03:47:56,242 INFO ]: Without dead ends: 7 [2018-06-25 03:47:56,242 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-25 03:47:56,242 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:56,243 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:56,243 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:56,244 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 03:47:56,244 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-25 03:47:56,244 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:56,244 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 03:47:56,244 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:56,244 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 03:47:56,244 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:56,244 INFO ]: Found error trace [2018-06-25 03:47:56,244 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:56,244 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:56,244 INFO ]: Analyzing trace with hash -836047401, now seen corresponding path program 1 times [2018-06-25 03:47:56,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:56,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:56,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:56,245 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:56,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:56,255 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:56,323 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:56,323 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:56,323 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:56,323 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:56,323 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:56,323 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:56,323 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 03:47:56,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:56,635 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-25 03:47:56,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:56,636 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:56,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:56,636 INFO ]: With dead ends: 8 [2018-06-25 03:47:56,636 INFO ]: Without dead ends: 7 [2018-06-25 03:47:56,636 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-25 03:47:56,636 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:56,638 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:56,638 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:56,638 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 298 transitions. [2018-06-25 03:47:56,638 INFO ]: Start accepts. Automaton has 7 states and 298 transitions. Word has length 6 [2018-06-25 03:47:56,638 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:56,638 INFO ]: Abstraction has 7 states and 298 transitions. [2018-06-25 03:47:56,638 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:56,638 INFO ]: Start isEmpty. Operand 7 states and 298 transitions. [2018-06-25 03:47:56,638 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:56,638 INFO ]: Found error trace [2018-06-25 03:47:56,639 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:56,639 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:56,639 INFO ]: Analyzing trace with hash 110561624, now seen corresponding path program 1 times [2018-06-25 03:47:56,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:56,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:56,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:56,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:56,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:56,651 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:56,767 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:56,767 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:56,767 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:56,767 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:56,767 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:56,767 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:56,767 INFO ]: Start difference. First operand 7 states and 298 transitions. Second operand 3 states. [2018-06-25 03:47:57,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:57,866 INFO ]: Finished difference Result 8 states and 298 transitions. [2018-06-25 03:47:57,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:57,867 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:57,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:57,867 INFO ]: With dead ends: 8 [2018-06-25 03:47:57,867 INFO ]: Without dead ends: 7 [2018-06-25 03:47:57,867 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-25 03:47:57,868 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:57,869 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:57,869 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:57,869 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2018-06-25 03:47:57,869 INFO ]: Start accepts. Automaton has 7 states and 202 transitions. Word has length 6 [2018-06-25 03:47:57,869 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:57,869 INFO ]: Abstraction has 7 states and 202 transitions. [2018-06-25 03:47:57,869 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:57,869 INFO ]: Start isEmpty. Operand 7 states and 202 transitions. [2018-06-25 03:47:57,869 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:57,869 INFO ]: Found error trace [2018-06-25 03:47:57,869 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:57,869 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:57,870 INFO ]: Analyzing trace with hash -602396588, now seen corresponding path program 1 times [2018-06-25 03:47:57,870 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:57,870 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:57,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:57,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:57,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:57,880 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:57,913 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:57,913 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:57,913 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:57,914 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:57,914 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:57,914 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:57,914 INFO ]: Start difference. First operand 7 states and 202 transitions. Second operand 3 states. [2018-06-25 03:47:58,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:58,076 INFO ]: Finished difference Result 8 states and 202 transitions. [2018-06-25 03:47:58,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:58,076 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:58,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:58,077 INFO ]: With dead ends: 8 [2018-06-25 03:47:58,077 INFO ]: Without dead ends: 7 [2018-06-25 03:47:58,077 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-25 03:47:58,077 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:58,078 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:58,078 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:58,078 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2018-06-25 03:47:58,078 INFO ]: Start accepts. Automaton has 7 states and 138 transitions. Word has length 6 [2018-06-25 03:47:58,078 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:58,079 INFO ]: Abstraction has 7 states and 138 transitions. [2018-06-25 03:47:58,079 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:58,079 INFO ]: Start isEmpty. Operand 7 states and 138 transitions. [2018-06-25 03:47:58,079 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:58,079 INFO ]: Found error trace [2018-06-25 03:47:58,079 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:58,079 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:58,079 INFO ]: Analyzing trace with hash 343288916, now seen corresponding path program 1 times [2018-06-25 03:47:58,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:58,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:58,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:58,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,093 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:58,197 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:58,197 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:58,197 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:58,197 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:58,197 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:58,197 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:58,197 INFO ]: Start difference. First operand 7 states and 138 transitions. Second operand 3 states. [2018-06-25 03:47:58,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:58,316 INFO ]: Finished difference Result 8 states and 138 transitions. [2018-06-25 03:47:58,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:58,316 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:58,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:58,316 INFO ]: With dead ends: 8 [2018-06-25 03:47:58,316 INFO ]: Without dead ends: 7 [2018-06-25 03:47:58,316 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-25 03:47:58,316 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:58,317 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:58,317 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:58,318 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-06-25 03:47:58,318 INFO ]: Start accepts. Automaton has 7 states and 106 transitions. Word has length 6 [2018-06-25 03:47:58,318 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:58,318 INFO ]: Abstraction has 7 states and 106 transitions. [2018-06-25 03:47:58,318 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:58,318 INFO ]: Start isEmpty. Operand 7 states and 106 transitions. [2018-06-25 03:47:58,318 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:58,318 INFO ]: Found error trace [2018-06-25 03:47:58,318 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:58,318 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:58,318 INFO ]: Analyzing trace with hash -720607276, now seen corresponding path program 1 times [2018-06-25 03:47:58,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:58,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:58,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:58,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,331 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:58,370 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:58,371 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:58,371 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:58,371 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:58,371 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:58,371 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:58,371 INFO ]: Start difference. First operand 7 states and 106 transitions. Second operand 3 states. [2018-06-25 03:47:58,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:58,455 INFO ]: Finished difference Result 8 states and 106 transitions. [2018-06-25 03:47:58,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:58,456 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:58,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:58,456 INFO ]: With dead ends: 8 [2018-06-25 03:47:58,456 INFO ]: Without dead ends: 7 [2018-06-25 03:47:58,456 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-25 03:47:58,456 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:58,457 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:58,457 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:58,457 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-06-25 03:47:58,457 INFO ]: Start accepts. Automaton has 7 states and 74 transitions. Word has length 6 [2018-06-25 03:47:58,457 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:58,457 INFO ]: Abstraction has 7 states and 74 transitions. [2018-06-25 03:47:58,457 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:58,457 INFO ]: Start isEmpty. Operand 7 states and 74 transitions. [2018-06-25 03:47:58,458 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:58,458 INFO ]: Found error trace [2018-06-25 03:47:58,458 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:58,458 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:58,458 INFO ]: Analyzing trace with hash 348830042, now seen corresponding path program 1 times [2018-06-25 03:47:58,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:58,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:58,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:58,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,470 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:58,583 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:58,583 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:47:58,583 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:47:58,583 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:47:58,583 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:47:58,583 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:47:58,583 INFO ]: Start difference. First operand 7 states and 74 transitions. Second operand 3 states. [2018-06-25 03:47:58,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:47:58,674 INFO ]: Finished difference Result 8 states and 74 transitions. [2018-06-25 03:47:58,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:47:58,674 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:47:58,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:47:58,674 INFO ]: With dead ends: 8 [2018-06-25 03:47:58,674 INFO ]: Without dead ends: 7 [2018-06-25 03:47:58,674 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-25 03:47:58,674 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:47:58,675 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:47:58,675 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:47:58,675 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-06-25 03:47:58,676 INFO ]: Start accepts. Automaton has 7 states and 58 transitions. Word has length 6 [2018-06-25 03:47:58,676 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:47:58,676 INFO ]: Abstraction has 7 states and 58 transitions. [2018-06-25 03:47:58,676 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:47:58,676 INFO ]: Start isEmpty. Operand 7 states and 58 transitions. [2018-06-25 03:47:58,676 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:47:58,676 INFO ]: Found error trace [2018-06-25 03:47:58,676 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:47:58,676 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:47:58,676 INFO ]: Analyzing trace with hash 527069595, now seen corresponding path program 1 times [2018-06-25 03:47:58,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:47:58,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:47:58,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:58,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:47:58,700 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:58,824 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:58,824 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:47:58,824 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-25 03:47:58,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:47:58,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:47:58,889 INFO ]: Computing forward predicates... [2018-06-25 03:47:59,604 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 7 [2018-06-25 03:47:59,617 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:47:59,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:47:59,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:47:59,651 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:47:59,651 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:47:59,651 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:47:59,651 INFO ]: Start difference. First operand 7 states and 58 transitions. Second operand 6 states. [2018-06-25 03:48:00,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:00,583 INFO ]: Finished difference Result 14 states and 67 transitions. [2018-06-25 03:48:00,584 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:48:00,584 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:48:00,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:00,584 INFO ]: With dead ends: 14 [2018-06-25 03:48:00,584 INFO ]: Without dead ends: 14 [2018-06-25 03:48:00,585 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:48:00,585 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 03:48:00,586 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-25 03:48:00,586 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:48:00,587 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-06-25 03:48:00,587 INFO ]: Start accepts. Automaton has 9 states and 62 transitions. Word has length 6 [2018-06-25 03:48:00,587 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:00,587 INFO ]: Abstraction has 9 states and 62 transitions. [2018-06-25 03:48:00,587 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:48:00,587 INFO ]: Start isEmpty. Operand 9 states and 62 transitions. [2018-06-25 03:48:00,587 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:00,587 INFO ]: Found error trace [2018-06-25 03:48:00,587 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:00,587 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:00,587 INFO ]: Analyzing trace with hash 527070556, now seen corresponding path program 1 times [2018-06-25 03:48:00,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:00,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:00,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:00,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:00,588 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:00,606 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:00,913 WARN ]: Spent 243.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2018-06-25 03:48:01,105 WARN ]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 03:48:01,106 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:01,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:01,106 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:01,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:01,147 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:01,149 INFO ]: Computing forward predicates... [2018-06-25 03:48:01,194 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 03:48:01,436 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:01,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:01,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:01,455 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:01,455 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:01,455 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:01,455 INFO ]: Start difference. First operand 9 states and 62 transitions. Second operand 5 states. [2018-06-25 03:48:01,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:01,633 INFO ]: Finished difference Result 13 states and 65 transitions. [2018-06-25 03:48:01,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:48:01,634 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:01,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:01,634 INFO ]: With dead ends: 13 [2018-06-25 03:48:01,634 INFO ]: Without dead ends: 13 [2018-06-25 03:48:01,634 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:01,634 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 03:48:01,636 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-06-25 03:48:01,636 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:48:01,636 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-06-25 03:48:01,636 INFO ]: Start accepts. Automaton has 9 states and 61 transitions. Word has length 6 [2018-06-25 03:48:01,636 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:01,636 INFO ]: Abstraction has 9 states and 61 transitions. [2018-06-25 03:48:01,636 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:01,636 INFO ]: Start isEmpty. Operand 9 states and 61 transitions. [2018-06-25 03:48:01,637 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:01,637 INFO ]: Found error trace [2018-06-25 03:48:01,637 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:01,637 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:01,637 INFO ]: Analyzing trace with hash 527065751, now seen corresponding path program 1 times [2018-06-25 03:48:01,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:01,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:01,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:01,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:01,638 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:01,646 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:01,883 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2018-06-25 03:48:02,541 WARN ]: Spent 610.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-06-25 03:48:02,542 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:02,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:02,542 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) [2018-06-25 03:48:02,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:02,593 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:02,595 INFO ]: Computing forward predicates... [2018-06-25 03:48:02,756 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:02,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:02,775 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:02,775 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:02,775 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:02,775 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:02,775 INFO ]: Start difference. First operand 9 states and 61 transitions. Second operand 5 states. [2018-06-25 03:48:02,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:02,926 INFO ]: Finished difference Result 14 states and 65 transitions. [2018-06-25 03:48:02,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 03:48:02,926 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:02,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:02,927 INFO ]: With dead ends: 14 [2018-06-25 03:48:02,927 INFO ]: Without dead ends: 14 [2018-06-25 03:48:02,927 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:02,927 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 03:48:02,928 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 03:48:02,928 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:02,928 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-06-25 03:48:02,928 INFO ]: Start accepts. Automaton has 8 states and 59 transitions. Word has length 6 [2018-06-25 03:48:02,928 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:02,928 INFO ]: Abstraction has 8 states and 59 transitions. [2018-06-25 03:48:02,928 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:02,928 INFO ]: Start isEmpty. Operand 8 states and 59 transitions. [2018-06-25 03:48:02,928 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:02,928 INFO ]: Found error trace [2018-06-25 03:48:02,928 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:02,928 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:02,928 INFO ]: Analyzing trace with hash 55150364, now seen corresponding path program 1 times [2018-06-25 03:48:02,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:02,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:02,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:02,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:02,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:02,936 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:02,981 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:02,981 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:48:02,981 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:48:02,981 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:48:02,981 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:48:02,981 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:48:02,981 INFO ]: Start difference. First operand 8 states and 59 transitions. Second operand 3 states. [2018-06-25 03:48:03,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:03,058 INFO ]: Finished difference Result 10 states and 59 transitions. [2018-06-25 03:48:03,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:48:03,059 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:48:03,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:03,060 INFO ]: With dead ends: 10 [2018-06-25 03:48:03,060 INFO ]: Without dead ends: 8 [2018-06-25 03:48:03,060 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-25 03:48:03,060 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:48:03,061 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:48:03,061 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:03,061 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-06-25 03:48:03,061 INFO ]: Start accepts. Automaton has 8 states and 47 transitions. Word has length 6 [2018-06-25 03:48:03,061 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:03,061 INFO ]: Abstraction has 8 states and 47 transitions. [2018-06-25 03:48:03,061 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:48:03,061 INFO ]: Start isEmpty. Operand 8 states and 47 transitions. [2018-06-25 03:48:03,061 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:03,061 INFO ]: Found error trace [2018-06-25 03:48:03,061 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:03,061 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:03,061 INFO ]: Analyzing trace with hash -1066004130, now seen corresponding path program 1 times [2018-06-25 03:48:03,061 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:03,061 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:03,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:03,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:03,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:03,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:03,143 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:03,143 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:03,143 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-25 03:48:03,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:03,183 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:03,185 INFO ]: Computing forward predicates... [2018-06-25 03:48:03,429 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:03,448 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:03,448 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:48:03,448 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:48:03,448 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:48:03,448 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:48:03,449 INFO ]: Start difference. First operand 8 states and 47 transitions. Second operand 6 states. [2018-06-25 03:48:03,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:03,569 INFO ]: Finished difference Result 15 states and 56 transitions. [2018-06-25 03:48:03,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:48:03,569 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:48:03,569 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:03,570 INFO ]: With dead ends: 15 [2018-06-25 03:48:03,570 INFO ]: Without dead ends: 15 [2018-06-25 03:48:03,570 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:48:03,570 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 03:48:03,571 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 10. [2018-06-25 03:48:03,571 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:48:03,571 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2018-06-25 03:48:03,571 INFO ]: Start accepts. Automaton has 10 states and 51 transitions. Word has length 6 [2018-06-25 03:48:03,571 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:03,571 INFO ]: Abstraction has 10 states and 51 transitions. [2018-06-25 03:48:03,571 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:48:03,571 INFO ]: Start isEmpty. Operand 10 states and 51 transitions. [2018-06-25 03:48:03,571 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:03,571 INFO ]: Found error trace [2018-06-25 03:48:03,571 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:03,571 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:03,572 INFO ]: Analyzing trace with hash -1066003169, now seen corresponding path program 1 times [2018-06-25 03:48:03,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:03,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:03,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:03,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:03,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:03,584 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:03,645 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:03,645 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:03,645 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-25 03:48:03,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:03,686 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:03,688 INFO ]: Computing forward predicates... [2018-06-25 03:48:03,907 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:03,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:03,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:03,927 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:03,927 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:03,927 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:03,927 INFO ]: Start difference. First operand 10 states and 51 transitions. Second operand 5 states. [2018-06-25 03:48:04,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:04,030 INFO ]: Finished difference Result 14 states and 54 transitions. [2018-06-25 03:48:04,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:48:04,030 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:04,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:04,031 INFO ]: With dead ends: 14 [2018-06-25 03:48:04,031 INFO ]: Without dead ends: 14 [2018-06-25 03:48:04,031 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:04,031 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 03:48:04,032 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-25 03:48:04,032 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:48:04,032 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-06-25 03:48:04,032 INFO ]: Start accepts. Automaton has 10 states and 50 transitions. Word has length 6 [2018-06-25 03:48:04,032 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:04,032 INFO ]: Abstraction has 10 states and 50 transitions. [2018-06-25 03:48:04,032 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:04,032 INFO ]: Start isEmpty. Operand 10 states and 50 transitions. [2018-06-25 03:48:04,032 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:04,032 INFO ]: Found error trace [2018-06-25 03:48:04,032 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:04,032 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:04,032 INFO ]: Analyzing trace with hash -1066007974, now seen corresponding path program 1 times [2018-06-25 03:48:04,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:04,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:04,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:04,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:04,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:04,041 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:04,184 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:04,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:04,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:04,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:04,219 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:04,221 INFO ]: Computing forward predicates... [2018-06-25 03:48:04,385 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:04,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:04,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:48:04,405 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:48:04,406 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:48:04,406 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:48:04,406 INFO ]: Start difference. First operand 10 states and 50 transitions. Second operand 6 states. [2018-06-25 03:48:04,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:04,637 INFO ]: Finished difference Result 14 states and 53 transitions. [2018-06-25 03:48:04,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:48:04,639 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:48:04,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:04,640 INFO ]: With dead ends: 14 [2018-06-25 03:48:04,640 INFO ]: Without dead ends: 14 [2018-06-25 03:48:04,640 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:04,640 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 03:48:04,641 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 03:48:04,641 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:04,641 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-06-25 03:48:04,641 INFO ]: Start accepts. Automaton has 8 states and 47 transitions. Word has length 6 [2018-06-25 03:48:04,641 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:04,641 INFO ]: Abstraction has 8 states and 47 transitions. [2018-06-25 03:48:04,641 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:48:04,641 INFO ]: Start isEmpty. Operand 8 states and 47 transitions. [2018-06-25 03:48:04,642 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:04,642 INFO ]: Found error trace [2018-06-25 03:48:04,642 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:04,642 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:04,642 INFO ]: Analyzing trace with hash -593161378, now seen corresponding path program 1 times [2018-06-25 03:48:04,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:04,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:04,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:04,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:04,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:04,651 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:04,759 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:04,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:48:04,760 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:48:04,760 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:48:04,760 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:48:04,760 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:48:04,760 INFO ]: Start difference. First operand 8 states and 47 transitions. Second operand 3 states. [2018-06-25 03:48:05,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:05,446 INFO ]: Finished difference Result 10 states and 47 transitions. [2018-06-25 03:48:05,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:48:05,448 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:48:05,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:05,448 INFO ]: With dead ends: 10 [2018-06-25 03:48:05,448 INFO ]: Without dead ends: 8 [2018-06-25 03:48:05,448 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-25 03:48:05,449 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:48:05,449 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:48:05,449 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:05,449 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-06-25 03:48:05,449 INFO ]: Start accepts. Automaton has 8 states and 35 transitions. Word has length 6 [2018-06-25 03:48:05,449 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:05,450 INFO ]: Abstraction has 8 states and 35 transitions. [2018-06-25 03:48:05,450 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:48:05,450 INFO ]: Start isEmpty. Operand 8 states and 35 transitions. [2018-06-25 03:48:05,450 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:05,450 INFO ]: Found error trace [2018-06-25 03:48:05,450 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:05,450 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:05,450 INFO ]: Analyzing trace with hash 376535672, now seen corresponding path program 1 times [2018-06-25 03:48:05,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:05,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:05,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:05,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:05,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:05,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:05,512 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:05,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:48:05,512 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:48:05,513 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:48:05,513 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:48:05,513 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:48:05,513 INFO ]: Start difference. First operand 8 states and 35 transitions. Second operand 3 states. [2018-06-25 03:48:05,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:05,538 INFO ]: Finished difference Result 10 states and 35 transitions. [2018-06-25 03:48:05,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:48:05,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:48:05,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:05,539 INFO ]: With dead ends: 10 [2018-06-25 03:48:05,539 INFO ]: Without dead ends: 8 [2018-06-25 03:48:05,539 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-25 03:48:05,540 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:48:05,540 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:48:05,540 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:05,540 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-25 03:48:05,540 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-25 03:48:05,540 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:05,540 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-25 03:48:05,540 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:48:05,541 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-25 03:48:05,541 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:05,541 INFO ]: Found error trace [2018-06-25 03:48:05,541 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:05,541 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:05,541 INFO ]: Analyzing trace with hash -90765954, now seen corresponding path program 1 times [2018-06-25 03:48:05,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:05,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:05,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:05,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:05,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:05,549 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:05,690 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:05,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:05,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:05,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:05,716 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:05,718 INFO ]: Computing forward predicates... [2018-06-25 03:48:05,796 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:05,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:05,815 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:48:05,815 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:48:05,815 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:48:05,815 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:48:05,815 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 6 states. [2018-06-25 03:48:05,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:05,886 INFO ]: Finished difference Result 15 states and 36 transitions. [2018-06-25 03:48:05,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:48:05,886 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:48:05,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:05,887 INFO ]: With dead ends: 15 [2018-06-25 03:48:05,887 INFO ]: Without dead ends: 15 [2018-06-25 03:48:05,887 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:48:05,887 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 03:48:05,888 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 10. [2018-06-25 03:48:05,888 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:48:05,888 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 03:48:05,888 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 6 [2018-06-25 03:48:05,888 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:05,888 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 03:48:05,888 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:48:05,888 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 03:48:05,888 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:05,888 INFO ]: Found error trace [2018-06-25 03:48:05,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:05,888 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:05,889 INFO ]: Analyzing trace with hash -90764993, now seen corresponding path program 1 times [2018-06-25 03:48:05,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:05,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:05,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:05,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:05,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:05,896 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:06,040 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:06,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:06,040 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:06,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:06,066 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:06,067 INFO ]: Computing forward predicates... [2018-06-25 03:48:06,178 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:06,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:06,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:06,197 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:06,198 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:06,198 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:06,198 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 5 states. [2018-06-25 03:48:06,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:06,266 INFO ]: Finished difference Result 14 states and 34 transitions. [2018-06-25 03:48:06,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:48:06,266 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:06,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:06,266 INFO ]: With dead ends: 14 [2018-06-25 03:48:06,266 INFO ]: Without dead ends: 14 [2018-06-25 03:48:06,267 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:06,267 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 03:48:06,267 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-25 03:48:06,267 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:48:06,268 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2018-06-25 03:48:06,268 INFO ]: Start accepts. Automaton has 10 states and 30 transitions. Word has length 6 [2018-06-25 03:48:06,268 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:06,268 INFO ]: Abstraction has 10 states and 30 transitions. [2018-06-25 03:48:06,268 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:06,268 INFO ]: Start isEmpty. Operand 10 states and 30 transitions. [2018-06-25 03:48:06,268 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:06,268 INFO ]: Found error trace [2018-06-25 03:48:06,268 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:06,268 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:06,268 INFO ]: Analyzing trace with hash -90769798, now seen corresponding path program 1 times [2018-06-25 03:48:06,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:06,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:06,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:06,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:06,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:06,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:06,503 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 4 [2018-06-25 03:48:06,606 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:06,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:06,606 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:06,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:06,633 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:06,634 INFO ]: Computing forward predicates... [2018-06-25 03:48:06,640 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 03:48:06,826 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:06,845 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:06,845 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:06,845 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:06,845 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:06,845 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:06,846 INFO ]: Start difference. First operand 10 states and 30 transitions. Second operand 5 states. [2018-06-25 03:48:06,994 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-06-25 03:48:07,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:07,050 INFO ]: Finished difference Result 14 states and 33 transitions. [2018-06-25 03:48:07,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:48:07,050 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:07,050 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:07,050 INFO ]: With dead ends: 14 [2018-06-25 03:48:07,050 INFO ]: Without dead ends: 14 [2018-06-25 03:48:07,050 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:07,050 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 03:48:07,051 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 8. [2018-06-25 03:48:07,051 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:07,051 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-25 03:48:07,052 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-25 03:48:07,052 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:07,052 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-25 03:48:07,052 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:07,052 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-25 03:48:07,052 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:07,052 INFO ]: Found error trace [2018-06-25 03:48:07,052 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:07,052 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:07,052 INFO ]: Analyzing trace with hash -265311423, now seen corresponding path program 1 times [2018-06-25 03:48:07,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:07,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:07,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:07,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:07,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:07,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:07,192 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:07,192 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:07,192 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:07,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:07,219 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:07,220 INFO ]: Computing forward predicates... [2018-06-25 03:48:07,571 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:07,591 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:07,591 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:48:07,591 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:48:07,591 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:48:07,591 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:48:07,591 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 6 states. [2018-06-25 03:48:07,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:07,658 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-25 03:48:07,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:48:07,661 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:48:07,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:07,661 INFO ]: With dead ends: 16 [2018-06-25 03:48:07,661 INFO ]: Without dead ends: 16 [2018-06-25 03:48:07,661 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:48:07,661 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 03:48:07,662 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-06-25 03:48:07,662 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:48:07,662 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-06-25 03:48:07,663 INFO ]: Start accepts. Automaton has 10 states and 31 transitions. Word has length 6 [2018-06-25 03:48:07,663 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:07,663 INFO ]: Abstraction has 10 states and 31 transitions. [2018-06-25 03:48:07,663 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:48:07,663 INFO ]: Start isEmpty. Operand 10 states and 31 transitions. [2018-06-25 03:48:07,663 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:07,663 INFO ]: Found error trace [2018-06-25 03:48:07,663 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:07,663 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:07,663 INFO ]: Analyzing trace with hash -265310462, now seen corresponding path program 1 times [2018-06-25 03:48:07,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:07,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:07,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:07,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:07,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:07,670 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:07,891 WARN ]: Spent 181.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 4 [2018-06-25 03:48:07,904 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:07,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:07,904 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:07,910 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:07,930 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:07,932 INFO ]: Computing forward predicates... [2018-06-25 03:48:07,937 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 03:48:08,147 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:08,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:08,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:08,166 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:08,166 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:08,166 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:08,166 INFO ]: Start difference. First operand 10 states and 31 transitions. Second operand 5 states. [2018-06-25 03:48:08,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:08,224 INFO ]: Finished difference Result 16 states and 36 transitions. [2018-06-25 03:48:08,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:48:08,224 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:08,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:08,224 INFO ]: With dead ends: 16 [2018-06-25 03:48:08,224 INFO ]: Without dead ends: 16 [2018-06-25 03:48:08,224 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:08,224 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 03:48:08,225 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-06-25 03:48:08,225 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:48:08,225 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2018-06-25 03:48:08,225 INFO ]: Start accepts. Automaton has 10 states and 30 transitions. Word has length 6 [2018-06-25 03:48:08,225 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:08,225 INFO ]: Abstraction has 10 states and 30 transitions. [2018-06-25 03:48:08,226 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:08,226 INFO ]: Start isEmpty. Operand 10 states and 30 transitions. [2018-06-25 03:48:08,226 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:08,226 INFO ]: Found error trace [2018-06-25 03:48:08,226 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:08,226 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:08,226 INFO ]: Analyzing trace with hash -265315267, now seen corresponding path program 1 times [2018-06-25 03:48:08,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:08,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:08,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:08,226 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:08,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:08,234 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:08,282 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:08,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:48:08,282 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:48:08,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:08,309 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:48:08,310 INFO ]: Computing forward predicates... [2018-06-25 03:48:08,317 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 03:48:08,623 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:48:08,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:48:08,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:48:08,643 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:48:08,643 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:48:08,643 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:48:08,643 INFO ]: Start difference. First operand 10 states and 30 transitions. Second operand 5 states. [2018-06-25 03:48:08,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:48:08,710 INFO ]: Finished difference Result 17 states and 36 transitions. [2018-06-25 03:48:08,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:48:08,712 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:48:08,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:48:08,712 INFO ]: With dead ends: 17 [2018-06-25 03:48:08,712 INFO ]: Without dead ends: 17 [2018-06-25 03:48:08,713 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:48:08,713 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 03:48:08,713 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 8. [2018-06-25 03:48:08,713 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:48:08,714 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-25 03:48:08,714 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 6 [2018-06-25 03:48:08,714 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:48:08,714 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-25 03:48:08,714 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:48:08,714 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-25 03:48:08,714 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:48:08,714 INFO ]: Found error trace [2018-06-25 03:48:08,714 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:48:08,714 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:48:08,714 INFO ]: Analyzing trace with hash -884994014, now seen corresponding path program 1 times [2018-06-25 03:48:08,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:48:08,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:48:08,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:08,715 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:48:08,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:48:08,727 INFO ]: Conjunction of SSA is sat [2018-06-25 03:48:08,729 INFO ]: Counterexample might be feasible [2018-06-25 03:48:08,747 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:48:08,751 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:48:08 BasicIcfg [2018-06-25 03:48:08,751 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:48:08,752 INFO ]: Toolchain (without parser) took 45752.36 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 261.8 MB in the beginning and 902.6 MB in the end (delta: -640.8 MB). Peak memory consumption was 572.4 MB. Max. memory is 3.6 GB. [2018-06-25 03:48:08,753 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:48:08,753 INFO ]: ChcToBoogie took 60.19 ms. Allocated memory is still 309.3 MB. Free memory was 261.8 MB in the beginning and 258.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:48:08,753 INFO ]: Boogie Preprocessor took 48.74 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 257.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 03:48:08,753 INFO ]: RCFGBuilder took 282.98 ms. Allocated memory is still 309.3 MB. Free memory was 257.8 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:48:08,758 INFO ]: BlockEncodingV2 took 14976.35 ms. Allocated memory was 309.3 MB in the beginning and 730.3 MB in the end (delta: 421.0 MB). Free memory was 243.8 MB in the beginning and 404.9 MB in the end (delta: -161.1 MB). Peak memory consumption was 406.4 MB. Max. memory is 3.6 GB. [2018-06-25 03:48:08,759 INFO ]: TraceAbstraction took 30377.02 ms. Allocated memory was 730.3 MB in the beginning and 1.5 GB in the end (delta: 792.2 MB). Free memory was 404.9 MB in the beginning and 902.6 MB in the end (delta: -497.7 MB). Peak memory consumption was 294.5 MB. Max. memory is 3.6 GB. [2018-06-25 03:48:08,761 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, 2057 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.19 ms. Allocated memory is still 309.3 MB. Free memory was 261.8 MB in the beginning and 258.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.74 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 257.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 282.98 ms. Allocated memory is still 309.3 MB. Free memory was 257.8 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 14976.35 ms. Allocated memory was 309.3 MB in the beginning and 730.3 MB in the end (delta: 421.0 MB). Free memory was 243.8 MB in the beginning and 404.9 MB in the end (delta: -161.1 MB). Peak memory consumption was 406.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30377.02 ms. Allocated memory was 730.3 MB in the beginning and 1.5 GB in the end (delta: 792.2 MB). Free memory was 404.9 MB in the beginning and 902.6 MB in the end (delta: -497.7 MB). Peak memory consumption was 294.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_5_Bool, hbv_False_17_Bool, hbv_False_4_Bool, hbv_False_8_Int, hbv_False_16_Bool, hbv_False_11_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_6_Int, hbv_False_13_Bool, hbv_False_3_Bool, hbv_False_21_Bool, hbv_False_14_Bool, hbv_False_12_Int, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_15_Int, hbv_False_2_Int, hbv_False_18_Bool, hbv_False_7_Int; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_2_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_2_Bool) || hhv_state_17_Bool)) && !((!hbv_state_13_Bool || !hbv_state_14_Bool) && (hbv_state_13_Bool || hbv_state_14_Bool))) && !((hbv_state_3_Bool || hbv_state_15_Bool) && (!hbv_state_3_Bool || !hbv_state_15_Bool))) && !((!hbv_state_18_Bool || !hbv_state_1_Bool) && (hbv_state_1_Bool || hbv_state_18_Bool))) && hhv_state_7_Int == hhv_state_10_Int) && hbv_state_8_Int == hhv_state_0_Int) && hbv_state_16_Int == hbv_state_8_Int) && !(!(hhv_state_8_Int == hhv_state_13_Int) && (!hhv_state_15_Bool || hhv_state_14_Bool))) && hbv_state_16_Int == hbv_state_12_Int) && hbv_state_6_Int == hbv_state_11_Int) && hhv_state_4_Int == hhv_state_7_Int) && !((hbv_state_4_Bool || !hbv_state_5_Bool) && !(hbv_state_6_Int == hbv_state_7_Int))) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && hhv_state_5_Int == hhv_state_4_Int) && !((!(hhv_state_8_Int == 1) && !hhv_state_14_Bool) && hhv_state_15_Bool)) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !(!(hhv_state_13_Int == 0) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && !((hbv_state_1_Bool || hbv_state_17_Bool) && (!hbv_state_17_Bool || !hbv_state_1_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_3_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_1_Bool)) && !(!(hbv_state_7_Int == 0) && (hbv_state_5_Bool || !hbv_state_4_Bool))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && !((hbv_state_5_Bool && !hbv_state_4_Bool) && !(hbv_state_6_Int == 1))) && hbv_state_8_Int == hbv_state_9_Int) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_3_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && !((!(hbv_state_12_Int == hbv_state_10_Int) && !hbv_state_5_Bool) && !hbv_state_4_Bool)) && !((hbv_state_4_Bool && !hbv_state_5_Bool) && !(hbv_state_7_Int == 2))) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_1_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !(!(hbv_state_12_Int + (-1 * hbv_state_10_Int + -1 * hbv_state_11_Int) == 0) && (hbv_state_4_Bool || hbv_state_5_Bool))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !((!(hhv_state_13_Int == 2) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && !((!hhv_state_15_Bool && !(hhv_state_5_Int == hhv_state_6_Int)) && !hhv_state_14_Bool)) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && hbv_state_19_Int == hbv_state_10_Int) && !((hhv_state_14_Bool || hhv_state_15_Bool) && !(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool))) && !((hbv_state_2_Bool || hbv_state_3_Bool) && (!hbv_state_3_Bool || !hbv_state_2_Bool)); [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_18_Bool, hbv_state_15_Bool, hbv_state_13_Bool, hbv_state_16_Int, hbv_state_12_Int, hbv_state_10_Int, hbv_state_8_Int, hbv_state_6_Int, hbv_state_11_Int, hbv_state_9_Int, hbv_state_3_Bool, hbv_state_1_Bool, hbv_state_7_Int, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_2_Bool, hbv_state_17_Bool, hbv_state_14_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_15_Bool, hbv_state_9_Int, hbv_state_10_Int, hbv_state_6_Int, hbv_state_8_Int, hbv_state_4_Bool, hbv_state_11_Int, hbv_state_21_Bool, hbv_state_14_Bool, hbv_state_17_Bool, hbv_state_5_Bool, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_20_Bool, hbv_state_7_Int, hbv_state_13_Bool, hbv_state_18_Bool, hbv_state_12_Int, hbv_state_16_Int, hbv_state_1_Bool, hbv_state_3_Bool; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 30.3s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17018 SDtfs, 26 SDslu, 153 SDs, 0 SdLazy, 9215 SolverSat, 8740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=20, 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, 30 MinimizatonAttempts, 74 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 3529 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 313 ConjunctsInUnsatCore, 42 InterpolantComputations, 18 PerfectInterpolantSequences, 13/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-48-08-769.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-48-08-769.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-48-08-769.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-48-08-769.csv Received shutdown request...