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/speed2_e7_223_e7_213.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:56:43,868 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:56:43,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:56:43,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:56:43,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:56:43,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:56:43,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:56:43,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:56:43,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:56:43,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:56:43,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:56:43,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:56:43,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:56:43,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:56:43,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:56:43,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:56:43,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:56:43,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:56:43,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:56:43,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:56:43,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:56:43,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:56:43,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:56:43,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:56:43,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:56:43,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:56:43,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:56:43,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:56:43,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:56:43,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:56:43,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:56:43,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:56:43,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:56:43,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:56:43,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:56:43,951 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:56:43,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:56:43,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:56:43,974 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:56:43,974 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:56:43,975 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:56:43,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:56:43,978 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:56:43,979 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:56:43,979 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:56:43,979 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:56:43,979 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:56:43,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:56:43,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:56:43,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:56:43,980 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:56:43,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:56:43,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:56:43,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:56:43,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:56:43,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:56:43,981 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:56:43,983 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:56:43,984 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:56:44,031 INFO ]: Repository-Root is: /tmp [2018-06-25 06:56:44,051 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:56:44,057 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:56:44,058 INFO ]: Initializing SmtParser... [2018-06-25 06:56:44,059 INFO ]: SmtParser initialized [2018-06-25 06:56:44,059 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e7_223_e7_213.smt2 [2018-06-25 06:56:44,061 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 06:56:44,190 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e7_223_e7_213.smt2 unknown [2018-06-25 06:56:44,516 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e7_223_e7_213.smt2 [2018-06-25 06:56:44,522 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:56:44,533 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:56:44,539 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:56:44,539 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:56:44,539 INFO ]: ChcToBoogie initialized [2018-06-25 06:56:44,543 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,611 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44 Unit [2018-06-25 06:56:44,611 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:56:44,612 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:56:44,612 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:56:44,612 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:56:44,634 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,634 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,642 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,642 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,653 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,655 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,656 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (1/1) ... [2018-06-25 06:56:44,658 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:56:44,659 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:56:44,659 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:56:44,659 INFO ]: RCFGBuilder initialized [2018-06-25 06:56:44,660 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (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 06:56:44,672 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:56:44,672 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:56:44,672 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:56:44,672 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:56:44,672 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:56:44,672 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 06:56:45,002 INFO ]: Using library mode [2018-06-25 06:56:45,002 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:56:45 BoogieIcfgContainer [2018-06-25 06:56:45,002 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:56:45,004 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:56:45,004 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:56:45,005 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:56:45,006 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:56:45" (1/1) ... [2018-06-25 06:56:45,029 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:56:45,031 INFO ]: Using Remove infeasible edges [2018-06-25 06:56:45,031 INFO ]: Using Maximize final states [2018-06-25 06:56:45,034 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:56:45,034 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:56:45,036 INFO ]: Using Remove sink states [2018-06-25 06:56:45,037 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:56:45,037 INFO ]: Using Use SBE [2018-06-25 06:56:45,047 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:56:47,639 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:56:47,641 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:56:48,658 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:56:48,659 INFO ]: SBE split 2 edges [2018-06-25 06:56:48,678 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:56:48,682 INFO ]: 0 new accepting states [2018-06-25 06:57:03,419 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 06:57:03,421 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:03,438 INFO ]: Removed 13 edges and 0 locations because of local infeasibility [2018-06-25 06:57:03,439 INFO ]: 0 new accepting states [2018-06-25 06:57:03,440 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:03,441 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:03,447 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:57:03,449 INFO ]: 0 new accepting states [2018-06-25 06:57:03,450 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:57:03,451 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:57:03,460 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-25 06:57:03,461 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:03 BasicIcfg [2018-06-25 06:57:03,461 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:57:03,462 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:57:03,462 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:57:03,845 INFO ]: TraceAbstraction initialized [2018-06-25 06:57:03,845 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:56:44" (1/4) ... [2018-06-25 06:57:03,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee262c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:57:03, skipping insertion in model container [2018-06-25 06:57:03,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:56:44" (2/4) ... [2018-06-25 06:57:03,897 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee262c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:57:03, skipping insertion in model container [2018-06-25 06:57:03,897 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:56:45" (3/4) ... [2018-06-25 06:57:03,898 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee262c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:57:03, skipping insertion in model container [2018-06-25 06:57:03,898 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:57:03" (4/4) ... [2018-06-25 06:57:03,899 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:57:04,024 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:57:04,196 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:57:05,378 INFO ]: Using default assertion order modulation [2018-06-25 06:57:05,379 INFO ]: Interprodecural is true [2018-06-25 06:57:05,379 INFO ]: Hoare is false [2018-06-25 06:57:05,379 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:57:05,379 INFO ]: Backedges is TWOTRACK [2018-06-25 06:57:05,379 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:57:05,379 INFO ]: Difference is false [2018-06-25 06:57:05,379 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:57:05,379 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:57:05,486 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:57:05,543 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:05,543 INFO ]: Found error trace [2018-06-25 06:57:05,557 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:05,557 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:05,562 INFO ]: Analyzing trace with hash 161085986, now seen corresponding path program 1 times [2018-06-25 06:57:05,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:05,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:05,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:05,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:05,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:05,963 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:06,174 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:06,177 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:06,177 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:06,179 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:06,195 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:06,196 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:06,218 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:57:09,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:09,684 INFO ]: Finished difference Result 7 states and 2057 transitions. [2018-06-25 06:57:09,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:09,685 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:09,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:09,778 INFO ]: With dead ends: 7 [2018-06-25 06:57:09,778 INFO ]: Without dead ends: 7 [2018-06-25 06:57:09,780 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 06:57:10,275 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:10,394 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:10,399 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:10,403 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 06:57:10,405 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 06:57:10,405 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:10,405 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 06:57:10,405 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:10,405 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 06:57:10,407 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:10,407 INFO ]: Found error trace [2018-06-25 06:57:10,407 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:10,407 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:10,407 INFO ]: Analyzing trace with hash 161115777, now seen corresponding path program 1 times [2018-06-25 06:57:10,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:10,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:10,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:10,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:10,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:10,424 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:10,498 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:10,498 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:10,498 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:10,500 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:10,500 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:10,500 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:10,500 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 06:57:13,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:13,268 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-25 06:57:13,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:13,268 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:13,268 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:13,271 INFO ]: With dead ends: 9 [2018-06-25 06:57:13,271 INFO ]: Without dead ends: 9 [2018-06-25 06:57:13,272 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 06:57:13,272 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:57:13,286 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:57:13,286 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:13,291 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 06:57:13,291 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 06:57:13,292 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:13,292 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 06:57:13,292 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:13,292 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 06:57:13,293 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:13,293 INFO ]: Found error trace [2018-06-25 06:57:13,293 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:13,293 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:13,293 INFO ]: Analyzing trace with hash 161234941, now seen corresponding path program 1 times [2018-06-25 06:57:13,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:13,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:13,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:13,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:13,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:13,305 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:13,330 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:13,330 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:13,330 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:13,330 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:13,330 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:13,330 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:13,330 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 06:57:15,582 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:15,582 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-25 06:57:15,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:15,611 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:15,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:15,614 INFO ]: With dead ends: 9 [2018-06-25 06:57:15,614 INFO ]: Without dead ends: 9 [2018-06-25 06:57:15,614 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 06:57:15,615 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:57:15,627 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:57:15,628 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:15,631 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 06:57:15,631 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 06:57:15,631 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:15,631 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 06:57:15,631 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:15,631 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 06:57:15,634 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:15,634 INFO ]: Found error trace [2018-06-25 06:57:15,634 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:15,634 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:15,634 INFO ]: Analyzing trace with hash 161771179, now seen corresponding path program 1 times [2018-06-25 06:57:15,634 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:15,634 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:15,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:15,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:15,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:15,656 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:15,711 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:15,712 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:15,712 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:15,712 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:15,712 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:15,712 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:15,712 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 06:57:17,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:17,717 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-25 06:57:17,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:17,718 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:17,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:17,721 INFO ]: With dead ends: 9 [2018-06-25 06:57:17,721 INFO ]: Without dead ends: 9 [2018-06-25 06:57:17,721 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 06:57:17,721 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:57:17,735 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:57:17,735 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:17,738 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 06:57:17,738 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 06:57:17,739 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:17,739 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 06:57:17,739 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:17,739 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 06:57:17,740 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:17,740 INFO ]: Found error trace [2018-06-25 06:57:17,740 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:17,740 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:17,740 INFO ]: Analyzing trace with hash 161800970, now seen corresponding path program 1 times [2018-06-25 06:57:17,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:17,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:17,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:17,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:17,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:17,754 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:17,820 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:17,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:17,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:17,820 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:17,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:17,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:17,821 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 06:57:19,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:19,439 INFO ]: Finished difference Result 9 states and 2059 transitions. [2018-06-25 06:57:19,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:19,439 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:19,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:19,441 INFO ]: With dead ends: 9 [2018-06-25 06:57:19,441 INFO ]: Without dead ends: 9 [2018-06-25 06:57:19,441 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 06:57:19,441 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:57:19,451 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:57:19,451 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:19,454 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 06:57:19,454 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 06:57:19,454 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:19,454 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 06:57:19,454 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:19,454 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 06:57:19,455 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:57:19,455 INFO ]: Found error trace [2018-06-25 06:57:19,456 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:57:19,456 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:19,456 INFO ]: Analyzing trace with hash 103023327, now seen corresponding path program 1 times [2018-06-25 06:57:19,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:19,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:19,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:19,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:19,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:19,463 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:19,512 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:19,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:19,512 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:19,512 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:19,512 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:19,512 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:19,512 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 06:57:20,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:20,971 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 06:57:20,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:20,971 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:57:20,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:20,973 INFO ]: With dead ends: 8 [2018-06-25 06:57:20,973 INFO ]: Without dead ends: 8 [2018-06-25 06:57:20,973 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 06:57:20,973 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:20,980 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 06:57:20,980 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:20,983 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-25 06:57:20,983 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-25 06:57:20,983 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:20,983 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-25 06:57:20,983 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:20,983 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-25 06:57:20,985 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:20,985 INFO ]: Found error trace [2018-06-25 06:57:20,985 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:20,985 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:20,985 INFO ]: Analyzing trace with hash 579680501, now seen corresponding path program 1 times [2018-06-25 06:57:20,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:20,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:20,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:20,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:20,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:21,008 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:21,124 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:21,124 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:21,124 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:21,124 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:21,124 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:21,124 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:21,124 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-25 06:57:22,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:22,745 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-25 06:57:22,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:22,747 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:22,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:22,749 INFO ]: With dead ends: 8 [2018-06-25 06:57:22,749 INFO ]: Without dead ends: 7 [2018-06-25 06:57:22,749 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 06:57:22,749 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:22,755 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:22,755 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:22,758 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1545 transitions. [2018-06-25 06:57:22,758 INFO ]: Start accepts. Automaton has 7 states and 1545 transitions. Word has length 6 [2018-06-25 06:57:22,758 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:22,758 INFO ]: Abstraction has 7 states and 1545 transitions. [2018-06-25 06:57:22,758 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:22,758 INFO ]: Start isEmpty. Operand 7 states and 1545 transitions. [2018-06-25 06:57:22,759 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:22,759 INFO ]: Found error trace [2018-06-25 06:57:22,759 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:22,759 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:22,759 INFO ]: Analyzing trace with hash 580604022, now seen corresponding path program 1 times [2018-06-25 06:57:22,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:22,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:22,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:22,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:22,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:22,789 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:22,832 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:22,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:22,832 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:22,833 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:22,833 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:22,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:22,833 INFO ]: Start difference. First operand 7 states and 1545 transitions. Second operand 3 states. [2018-06-25 06:57:24,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:24,094 INFO ]: Finished difference Result 8 states and 1545 transitions. [2018-06-25 06:57:24,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:24,094 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:24,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:24,095 INFO ]: With dead ends: 8 [2018-06-25 06:57:24,095 INFO ]: Without dead ends: 7 [2018-06-25 06:57:24,096 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 06:57:24,096 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:24,099 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:24,099 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:24,100 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1161 transitions. [2018-06-25 06:57:24,100 INFO ]: Start accepts. Automaton has 7 states and 1161 transitions. Word has length 6 [2018-06-25 06:57:24,100 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:24,100 INFO ]: Abstraction has 7 states and 1161 transitions. [2018-06-25 06:57:24,100 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:24,100 INFO ]: Start isEmpty. Operand 7 states and 1161 transitions. [2018-06-25 06:57:24,100 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:24,100 INFO ]: Found error trace [2018-06-25 06:57:24,100 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:24,100 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:24,101 INFO ]: Analyzing trace with hash 581527543, now seen corresponding path program 1 times [2018-06-25 06:57:24,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:24,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:24,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:24,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:24,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:24,113 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:24,143 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:24,143 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:24,143 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:24,143 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:24,143 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:24,143 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:24,144 INFO ]: Start difference. First operand 7 states and 1161 transitions. Second operand 3 states. [2018-06-25 06:57:25,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:25,065 INFO ]: Finished difference Result 8 states and 1161 transitions. [2018-06-25 06:57:25,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:25,066 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:25,066 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:25,066 INFO ]: With dead ends: 8 [2018-06-25 06:57:25,066 INFO ]: Without dead ends: 7 [2018-06-25 06:57:25,067 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 06:57:25,067 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:25,068 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:25,068 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:25,069 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 649 transitions. [2018-06-25 06:57:25,069 INFO ]: Start accepts. Automaton has 7 states and 649 transitions. Word has length 6 [2018-06-25 06:57:25,069 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:25,069 INFO ]: Abstraction has 7 states and 649 transitions. [2018-06-25 06:57:25,069 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:25,069 INFO ]: Start isEmpty. Operand 7 states and 649 transitions. [2018-06-25 06:57:25,069 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:25,069 INFO ]: Found error trace [2018-06-25 06:57:25,069 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:25,069 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:25,070 INFO ]: Analyzing trace with hash -364157961, now seen corresponding path program 1 times [2018-06-25 06:57:25,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:25,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:25,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:25,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:25,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:25,082 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:25,196 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:25,196 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:25,196 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:25,196 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:25,196 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:25,196 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:25,197 INFO ]: Start difference. First operand 7 states and 649 transitions. Second operand 3 states. [2018-06-25 06:57:25,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:25,856 INFO ]: Finished difference Result 8 states and 649 transitions. [2018-06-25 06:57:25,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:25,857 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:25,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:25,857 INFO ]: With dead ends: 8 [2018-06-25 06:57:25,857 INFO ]: Without dead ends: 7 [2018-06-25 06:57:25,858 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:25,858 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:25,859 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:25,859 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:25,859 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 329 transitions. [2018-06-25 06:57:25,859 INFO ]: Start accepts. Automaton has 7 states and 329 transitions. Word has length 6 [2018-06-25 06:57:25,859 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:25,859 INFO ]: Abstraction has 7 states and 329 transitions. [2018-06-25 06:57:25,859 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:25,859 INFO ]: Start isEmpty. Operand 7 states and 329 transitions. [2018-06-25 06:57:25,860 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:25,860 INFO ]: Found error trace [2018-06-25 06:57:25,860 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:25,860 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:25,860 INFO ]: Analyzing trace with hash 107761270, now seen corresponding path program 1 times [2018-06-25 06:57:25,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:25,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:25,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:25,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:25,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:25,872 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:25,931 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:25,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:25,931 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:25,931 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:25,931 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:25,931 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:25,932 INFO ]: Start difference. First operand 7 states and 329 transitions. Second operand 3 states. [2018-06-25 06:57:26,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:26,185 INFO ]: Finished difference Result 8 states and 329 transitions. [2018-06-25 06:57:26,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:26,185 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:26,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:26,185 INFO ]: With dead ends: 8 [2018-06-25 06:57:26,185 INFO ]: Without dead ends: 7 [2018-06-25 06:57:26,186 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 06:57:26,186 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:26,187 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:26,187 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:26,187 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2018-06-25 06:57:26,187 INFO ]: Start accepts. Automaton has 7 states and 265 transitions. Word has length 6 [2018-06-25 06:57:26,187 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:26,187 INFO ]: Abstraction has 7 states and 265 transitions. [2018-06-25 06:57:26,187 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:26,187 INFO ]: Start isEmpty. Operand 7 states and 265 transitions. [2018-06-25 06:57:26,188 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:26,188 INFO ]: Found error trace [2018-06-25 06:57:26,188 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:26,188 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:26,188 INFO ]: Analyzing trace with hash -836077192, now seen corresponding path program 1 times [2018-06-25 06:57:26,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:26,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:26,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,189 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:26,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,200 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:26,235 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:26,235 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:26,235 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:26,235 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:26,235 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:26,235 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:26,235 INFO ]: Start difference. First operand 7 states and 265 transitions. Second operand 3 states. [2018-06-25 06:57:26,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:26,434 INFO ]: Finished difference Result 8 states and 265 transitions. [2018-06-25 06:57:26,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:26,437 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:26,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:26,437 INFO ]: With dead ends: 8 [2018-06-25 06:57:26,437 INFO ]: Without dead ends: 7 [2018-06-25 06:57:26,438 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 06:57:26,438 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:26,439 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:26,439 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:26,439 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2018-06-25 06:57:26,439 INFO ]: Start accepts. Automaton has 7 states and 137 transitions. Word has length 6 [2018-06-25 06:57:26,439 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:26,439 INFO ]: Abstraction has 7 states and 137 transitions. [2018-06-25 06:57:26,439 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:26,439 INFO ]: Start isEmpty. Operand 7 states and 137 transitions. [2018-06-25 06:57:26,439 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:26,439 INFO ]: Found error trace [2018-06-25 06:57:26,440 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:26,440 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:26,440 INFO ]: Analyzing trace with hash -598732295, now seen corresponding path program 1 times [2018-06-25 06:57:26,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:26,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:26,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:26,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,454 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:26,582 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:26,582 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:26,582 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:26,582 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:26,582 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:26,582 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:26,582 INFO ]: Start difference. First operand 7 states and 137 transitions. Second operand 3 states. [2018-06-25 06:57:26,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:26,752 INFO ]: Finished difference Result 8 states and 137 transitions. [2018-06-25 06:57:26,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:26,752 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:26,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:26,752 INFO ]: With dead ends: 8 [2018-06-25 06:57:26,753 INFO ]: Without dead ends: 7 [2018-06-25 06:57:26,753 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:26,753 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:26,753 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:26,753 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:26,754 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-06-25 06:57:26,754 INFO ]: Start accepts. Automaton has 7 states and 105 transitions. Word has length 6 [2018-06-25 06:57:26,754 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:26,754 INFO ]: Abstraction has 7 states and 105 transitions. [2018-06-25 06:57:26,754 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:26,754 INFO ]: Start isEmpty. Operand 7 states and 105 transitions. [2018-06-25 06:57:26,754 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:26,754 INFO ]: Found error trace [2018-06-25 06:57:26,754 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:26,754 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:26,754 INFO ]: Analyzing trace with hash -245947273, now seen corresponding path program 1 times [2018-06-25 06:57:26,754 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:26,754 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:26,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:26,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:26,864 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:26,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:26,864 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:26,864 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:26,864 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:26,864 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:26,864 INFO ]: Start difference. First operand 7 states and 105 transitions. Second operand 3 states. [2018-06-25 06:57:26,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:26,977 INFO ]: Finished difference Result 8 states and 105 transitions. [2018-06-25 06:57:26,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:26,977 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:26,977 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:26,978 INFO ]: With dead ends: 8 [2018-06-25 06:57:26,978 INFO ]: Without dead ends: 7 [2018-06-25 06:57:26,978 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 06:57:26,978 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:26,978 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:26,979 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:26,982 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-06-25 06:57:26,982 INFO ]: Start accepts. Automaton has 7 states and 41 transitions. Word has length 6 [2018-06-25 06:57:26,982 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:26,982 INFO ]: Abstraction has 7 states and 41 transitions. [2018-06-25 06:57:26,982 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:26,982 INFO ]: Start isEmpty. Operand 7 states and 41 transitions. [2018-06-25 06:57:26,982 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:26,982 INFO ]: Found error trace [2018-06-25 06:57:26,982 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:26,982 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:26,982 INFO ]: Analyzing trace with hash -124966022, now seen corresponding path program 1 times [2018-06-25 06:57:26,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:26,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:26,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:26,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:26,991 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:27,018 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:27,018 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:27,018 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:27,018 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:27,018 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:27,018 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:27,019 INFO ]: Start difference. First operand 7 states and 41 transitions. Second operand 3 states. [2018-06-25 06:57:27,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:27,049 INFO ]: Finished difference Result 8 states and 41 transitions. [2018-06-25 06:57:27,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:27,049 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:57:27,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:27,049 INFO ]: With dead ends: 8 [2018-06-25 06:57:27,049 INFO ]: Without dead ends: 7 [2018-06-25 06:57:27,049 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 06:57:27,049 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:57:27,051 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:57:27,051 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:57:27,051 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-06-25 06:57:27,052 INFO ]: Start accepts. Automaton has 7 states and 33 transitions. Word has length 6 [2018-06-25 06:57:27,052 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:27,052 INFO ]: Abstraction has 7 states and 33 transitions. [2018-06-25 06:57:27,052 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:27,052 INFO ]: Start isEmpty. Operand 7 states and 33 transitions. [2018-06-25 06:57:27,052 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:57:27,052 INFO ]: Found error trace [2018-06-25 06:57:27,052 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:57:27,052 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:27,052 INFO ]: Analyzing trace with hash -302282054, now seen corresponding path program 1 times [2018-06-25 06:57:27,052 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:27,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:27,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:27,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:27,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:27,059 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:27,107 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:27,107 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:27,107 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 06:57:27,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:27,163 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:27,171 INFO ]: Computing forward predicates... [2018-06-25 06:57:27,239 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:27,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:27,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:57:27,274 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:57:27,274 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:57:27,274 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:57:27,274 INFO ]: Start difference. First operand 7 states and 33 transitions. Second operand 4 states. [2018-06-25 06:57:27,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:27,747 INFO ]: Finished difference Result 9 states and 34 transitions. [2018-06-25 06:57:27,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:57:27,748 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:57:27,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:27,748 INFO ]: With dead ends: 9 [2018-06-25 06:57:27,748 INFO ]: Without dead ends: 8 [2018-06-25 06:57:27,749 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:57:27,749 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:27,750 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:27,750 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:27,750 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-06-25 06:57:27,750 INFO ]: Start accepts. Automaton has 8 states and 18 transitions. Word has length 6 [2018-06-25 06:57:27,750 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:27,750 INFO ]: Abstraction has 8 states and 18 transitions. [2018-06-25 06:57:27,750 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:57:27,750 INFO ]: Start isEmpty. Operand 8 states and 18 transitions. [2018-06-25 06:57:27,750 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:27,750 INFO ]: Found error trace [2018-06-25 06:57:27,750 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:27,750 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:27,750 INFO ]: Analyzing trace with hash 102788080, now seen corresponding path program 1 times [2018-06-25 06:57:27,750 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:27,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:27,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:27,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:27,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:27,783 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:27,886 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:27,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:27,886 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 06:57:27,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:27,937 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:27,940 INFO ]: Computing forward predicates... [2018-06-25 06:57:27,998 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 06:57:28,118 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:28,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:28,145 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:57:28,145 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:57:28,145 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:57:28,145 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:57:28,145 INFO ]: Start difference. First operand 8 states and 18 transitions. Second operand 8 states. [2018-06-25 06:57:28,517 WARN ]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 06:57:28,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:28,774 INFO ]: Finished difference Result 11 states and 20 transitions. [2018-06-25 06:57:28,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:57:28,775 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:57:28,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:28,775 INFO ]: With dead ends: 11 [2018-06-25 06:57:28,775 INFO ]: Without dead ends: 8 [2018-06-25 06:57:28,775 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-25 06:57:28,775 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:28,776 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:28,776 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:28,776 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-25 06:57:28,776 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 7 [2018-06-25 06:57:28,776 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:28,776 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-25 06:57:28,776 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:57:28,776 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-25 06:57:28,777 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:28,777 INFO ]: Found error trace [2018-06-25 06:57:28,777 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:28,777 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:28,777 INFO ]: Analyzing trace with hash -1898873906, now seen corresponding path program 1 times [2018-06-25 06:57:28,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:28,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:28,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:28,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:28,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:28,788 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:28,814 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 06:57:28,814 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:57:28,814 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:57:28,814 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:57:28,814 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:57:28,814 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:57:28,814 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 3 states. [2018-06-25 06:57:28,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:28,832 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-25 06:57:28,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:57:28,832 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 06:57:28,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:28,832 INFO ]: With dead ends: 9 [2018-06-25 06:57:28,832 INFO ]: Without dead ends: 8 [2018-06-25 06:57:28,833 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 06:57:28,833 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:28,833 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:28,833 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:28,834 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-25 06:57:28,834 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-25 06:57:28,834 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:28,834 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-25 06:57:28,834 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:57:28,834 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-25 06:57:28,834 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:28,834 INFO ]: Found error trace [2018-06-25 06:57:28,834 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:28,834 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:28,834 INFO ]: Analyzing trace with hash -899826851, now seen corresponding path program 2 times [2018-06-25 06:57:28,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:28,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:28,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:28,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:57:28,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:28,848 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:29,595 WARN ]: Spent 694.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-06-25 06:57:29,853 WARN ]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:57:29,861 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:29,861 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:29,861 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:57:29,868 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 06:57:29,905 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 06:57:29,905 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:29,907 INFO ]: Computing forward predicates... [2018-06-25 06:57:30,021 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:30,055 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:30,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:57:30,056 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:57:30,056 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:57:30,056 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:57:30,056 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-06-25 06:57:30,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:30,161 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 06:57:30,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 06:57:30,161 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:57:30,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:30,161 INFO ]: With dead ends: 11 [2018-06-25 06:57:30,161 INFO ]: Without dead ends: 8 [2018-06-25 06:57:30,161 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:57:30,161 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:57:30,162 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:57:30,162 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:57:30,162 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-25 06:57:30,162 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-25 06:57:30,162 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:30,162 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-25 06:57:30,162 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:57:30,162 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-25 06:57:30,163 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:57:30,163 INFO ]: Found error trace [2018-06-25 06:57:30,163 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:57:30,163 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:57:30,163 INFO ]: Analyzing trace with hash -932023878, now seen corresponding path program 1 times [2018-06-25 06:57:30,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:57:30,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:57:30,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:30,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 06:57:30,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:57:30,176 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:30,339 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 06:57:30,536 WARN ]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 06:57:30,630 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:30,630 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:57:30,630 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) [2018-06-25 06:57:30,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:57:30,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:57:30,694 INFO ]: Computing forward predicates... [2018-06-25 06:57:30,981 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:57:31,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:57:31,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 06:57:31,014 INFO ]: Interpolant automaton has 6 states [2018-06-25 06:57:31,014 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 06:57:31,014 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:57:31,014 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2018-06-25 06:57:31,105 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:57:31,105 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 06:57:31,106 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:57:31,106 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 06:57:31,106 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:57:31,106 INFO ]: With dead ends: 4 [2018-06-25 06:57:31,106 INFO ]: Without dead ends: 0 [2018-06-25 06:57:31,106 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 06:57:31,106 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:57:31,106 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:57:31,106 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:57:31,106 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:57:31,106 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:57:31,106 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:57:31,106 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:57:31,106 INFO ]: Interpolant automaton has 6 states. [2018-06-25 06:57:31,106 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:57:31,106 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:57:31,109 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:57:31,112 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:57:31 BasicIcfg [2018-06-25 06:57:31,112 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:57:31,113 INFO ]: Toolchain (without parser) took 46591.10 ms. Allocated memory was 310.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 262.9 MB in the beginning and 468.4 MB in the end (delta: -205.5 MB). Peak memory consumption was 969.5 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:31,114 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 310.4 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:57:31,114 INFO ]: ChcToBoogie took 72.53 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 258.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:31,115 INFO ]: Boogie Preprocessor took 46.52 ms. Allocated memory is still 310.4 MB. Free memory is still 258.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:57:31,115 INFO ]: RCFGBuilder took 343.13 ms. Allocated memory is still 310.4 MB. Free memory was 258.9 MB in the beginning and 244.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:31,115 INFO ]: BlockEncodingV2 took 18456.65 ms. Allocated memory was 310.4 MB in the beginning and 899.2 MB in the end (delta: 588.8 MB). Free memory was 244.9 MB in the beginning and 576.1 MB in the end (delta: -331.2 MB). Peak memory consumption was 483.7 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:31,116 INFO ]: TraceAbstraction took 27650.79 ms. Allocated memory was 899.2 MB in the beginning and 1.5 GB in the end (delta: 586.2 MB). Free memory was 576.1 MB in the beginning and 468.4 MB in the end (delta: 107.8 MB). Peak memory consumption was 693.9 MB. Max. memory is 3.6 GB. [2018-06-25 06:57:31,120 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 310.4 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 72.53 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 258.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.52 ms. Allocated memory is still 310.4 MB. Free memory is still 258.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 343.13 ms. Allocated memory is still 310.4 MB. Free memory was 258.9 MB in the beginning and 244.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 18456.65 ms. Allocated memory was 310.4 MB in the beginning and 899.2 MB in the end (delta: 588.8 MB). Free memory was 244.9 MB in the beginning and 576.1 MB in the end (delta: -331.2 MB). Peak memory consumption was 483.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 27650.79 ms. Allocated memory was 899.2 MB in the beginning and 1.5 GB in the end (delta: 586.2 MB). Free memory was 576.1 MB in the beginning and 468.4 MB in the end (delta: 107.8 MB). Peak memory consumption was 693.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 25.9s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 20.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18682 SDtfs, 0 SDslu, 88 SDs, 0 SdLazy, 9509 SolverSat, 9263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=16, 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1521 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 12/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223_e7_213.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-57-31-131.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223_e7_213.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-57-31-131.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223_e7_213.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-57-31-131.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e7_223_e7_213.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-57-31-131.csv Received shutdown request...