java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-27 00:05:54,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-27 00:05:54,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-27 00:05:54,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-27 00:05:54,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-27 00:05:54,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-27 00:05:54,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-27 00:05:54,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-27 00:05:54,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-27 00:05:54,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-27 00:05:54,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-27 00:05:54,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-27 00:05:54,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-27 00:05:54,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-27 00:05:54,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-27 00:05:54,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-27 00:05:54,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-27 00:05:54,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-27 00:05:54,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-27 00:05:54,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-27 00:05:54,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-27 00:05:54,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-27 00:05:54,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-27 00:05:54,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-27 00:05:54,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-27 00:05:54,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-27 00:05:54,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-27 00:05:54,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-27 00:05:54,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-27 00:05:54,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-27 00:05:54,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-27 00:05:54,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-27 00:05:54,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-27 00:05:54,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-27 00:05:54,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-27 00:05:54,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-27 00:05:54,867 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-27 00:05:54,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-27 00:05:54,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-27 00:05:54,882 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-27 00:05:54,882 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-27 00:05:54,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-27 00:05:54,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-27 00:05:54,884 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-27 00:05:54,884 INFO L133 SettingsManager]: * Use SBE=true [2018-06-27 00:05:54,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-27 00:05:54,885 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-27 00:05:54,885 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-27 00:05:54,885 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-27 00:05:54,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:05:54,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-27 00:05:54,886 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-27 00:05:54,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-27 00:05:54,886 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-27 00:05:54,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-27 00:05:54,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-27 00:05:54,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-27 00:05:54,887 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-27 00:05:54,892 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-27 00:05:54,893 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-27 00:05:54,944 INFO ]: Repository-Root is: /tmp [2018-06-27 00:05:54,962 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-27 00:05:54,966 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-27 00:05:54,967 INFO ]: Initializing SmtParser... [2018-06-27 00:05:54,968 INFO ]: SmtParser initialized [2018-06-27 00:05:54,968 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 [2018-06-27 00:05:54,969 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-27 00:05:55,052 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 unknown [2018-06-27 00:05:55,288 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 [2018-06-27 00:05:55,292 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-27 00:05:55,301 INFO ]: Walking toolchain with 5 elements. [2018-06-27 00:05:55,301 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-27 00:05:55,302 INFO ]: Initializing ChcToBoogie... [2018-06-27 00:05:55,302 INFO ]: ChcToBoogie initialized [2018-06-27 00:05:55,305 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,364 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55 Unit [2018-06-27 00:05:55,364 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-27 00:05:55,365 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-27 00:05:55,365 INFO ]: Initializing Boogie Preprocessor... [2018-06-27 00:05:55,365 INFO ]: Boogie Preprocessor initialized [2018-06-27 00:05:55,387 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,387 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,396 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,396 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,400 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,401 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,409 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,411 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-27 00:05:55,411 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-27 00:05:55,411 INFO ]: Initializing RCFGBuilder... [2018-06-27 00:05:55,411 INFO ]: RCFGBuilder initialized [2018-06-27 00:05:55,417 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-27 00:05:55,431 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-27 00:05:55,431 INFO ]: Found specification of procedure gotoProc [2018-06-27 00:05:55,431 INFO ]: Found implementation of procedure gotoProc [2018-06-27 00:05:55,432 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-27 00:05:55,432 INFO ]: Found specification of procedure Ultimate.START [2018-06-27 00:05:55,432 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-27 00:05:55,786 INFO ]: Using library mode [2018-06-27 00:05:55,787 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:05:55 BoogieIcfgContainer [2018-06-27 00:05:55,787 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-27 00:05:55,787 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-27 00:05:55,787 INFO ]: Initializing BlockEncodingV2... [2018-06-27 00:05:55,788 INFO ]: BlockEncodingV2 initialized [2018-06-27 00:05:55,789 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:05:55" (1/1) ... [2018-06-27 00:05:55,806 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-27 00:05:55,807 INFO ]: Using Remove infeasible edges [2018-06-27 00:05:55,807 INFO ]: Using Maximize final states [2018-06-27 00:05:55,808 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-27 00:05:55,808 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-27 00:05:55,814 INFO ]: Using Remove sink states [2018-06-27 00:05:55,814 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-27 00:05:55,814 INFO ]: Using Use SBE [2018-06-27 00:05:55,822 WARN ]: expecting exponential blowup for input size 12 [2018-06-27 00:05:56,414 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:05:56,414 WARN ]: expecting exponential blowup for input size 11 [2018-06-27 00:05:56,716 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-27 00:05:56,717 INFO ]: SBE split 2 edges [2018-06-27 00:05:56,735 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-27 00:05:56,738 INFO ]: 0 new accepting states [2018-06-27 00:06:09,719 INFO ]: Removed 2066 edges and 2 locations by large block encoding [2018-06-27 00:06:09,723 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:06:09,745 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-27 00:06:09,749 INFO ]: 0 new accepting states [2018-06-27 00:06:09,751 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:06:09,752 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:06:09,759 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-27 00:06:09,763 INFO ]: 0 new accepting states [2018-06-27 00:06:09,765 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-27 00:06:09,766 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-27 00:06:09,780 INFO ]: Encoded RCFG 6 locations, 2056 edges [2018-06-27 00:06:09,781 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:06:09 BasicIcfg [2018-06-27 00:06:09,781 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-27 00:06:09,782 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-27 00:06:09,782 INFO ]: Initializing TraceAbstraction... [2018-06-27 00:06:09,786 INFO ]: TraceAbstraction initialized [2018-06-27 00:06:09,786 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 27.06 12:05:55" (1/4) ... [2018-06-27 00:06:09,787 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6013af2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 27.06 12:06:09, skipping insertion in model container [2018-06-27 00:06:09,787 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 27.06 12:05:55" (2/4) ... [2018-06-27 00:06:09,787 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6013af2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 12:06:09, skipping insertion in model container [2018-06-27 00:06:09,787 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 12:05:55" (3/4) ... [2018-06-27 00:06:09,787 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6013af2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:06:09, skipping insertion in model container [2018-06-27 00:06:09,787 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 27.06 12:06:09" (4/4) ... [2018-06-27 00:06:09,789 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-27 00:06:09,799 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-27 00:06:09,807 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-27 00:06:09,864 INFO ]: Using default assertion order modulation [2018-06-27 00:06:09,865 INFO ]: Interprodecural is true [2018-06-27 00:06:09,865 INFO ]: Hoare is false [2018-06-27 00:06:09,865 INFO ]: Compute interpolants for FPandBP [2018-06-27 00:06:09,865 INFO ]: Backedges is TWOTRACK [2018-06-27 00:06:09,865 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-27 00:06:09,865 INFO ]: Difference is false [2018-06-27 00:06:09,865 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-27 00:06:09,865 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-27 00:06:09,888 INFO ]: Start isEmpty. Operand 6 states. [2018-06-27 00:06:09,912 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:06:09,912 INFO ]: Found error trace [2018-06-27 00:06:09,913 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:06:09,914 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:09,919 INFO ]: Analyzing trace with hash 161092713, now seen corresponding path program 1 times [2018-06-27 00:06:09,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:09,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:09,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:09,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:09,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:10,019 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:10,105 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:10,107 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:10,107 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:10,108 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:10,118 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:10,118 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:10,120 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-27 00:06:13,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:13,175 INFO ]: Finished difference Result 8 states and 2060 transitions. [2018-06-27 00:06:13,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:13,176 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:06:13,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:13,195 INFO ]: With dead ends: 8 [2018-06-27 00:06:13,195 INFO ]: Without dead ends: 8 [2018-06-27 00:06:13,197 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:13,216 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:06:13,282 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-27 00:06:13,283 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:13,289 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2059 transitions. [2018-06-27 00:06:13,290 INFO ]: Start accepts. Automaton has 7 states and 2059 transitions. Word has length 5 [2018-06-27 00:06:13,291 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:13,291 INFO ]: Abstraction has 7 states and 2059 transitions. [2018-06-27 00:06:13,291 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:13,291 INFO ]: Start isEmpty. Operand 7 states and 2059 transitions. [2018-06-27 00:06:13,293 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:06:13,293 INFO ]: Found error trace [2018-06-27 00:06:13,293 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:06:13,293 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:13,293 INFO ]: Analyzing trace with hash 161093674, now seen corresponding path program 1 times [2018-06-27 00:06:13,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:13,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:13,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:13,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:13,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:13,318 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:13,388 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:13,388 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:13,388 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:13,389 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:13,389 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:13,389 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:13,389 INFO ]: Start difference. First operand 7 states and 2059 transitions. Second operand 3 states. [2018-06-27 00:06:16,018 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:16,018 INFO ]: Finished difference Result 9 states and 2061 transitions. [2018-06-27 00:06:16,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:16,019 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:06:16,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:16,022 INFO ]: With dead ends: 9 [2018-06-27 00:06:16,022 INFO ]: Without dead ends: 9 [2018-06-27 00:06:16,022 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:16,022 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-27 00:06:16,035 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-27 00:06:16,035 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:16,040 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:06:16,041 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:06:16,041 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:16,041 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:06:16,041 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:16,041 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:06:16,042 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:06:16,042 INFO ]: Found error trace [2018-06-27 00:06:16,042 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:06:16,042 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:16,042 INFO ]: Analyzing trace with hash 161152295, now seen corresponding path program 1 times [2018-06-27 00:06:16,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:16,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:16,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:16,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:16,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:16,055 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:16,080 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:16,080 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:16,080 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:16,080 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:16,080 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:16,080 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:16,081 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:06:18,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:18,776 INFO ]: Finished difference Result 11 states and 2063 transitions. [2018-06-27 00:06:18,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:18,776 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:06:18,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:18,778 INFO ]: With dead ends: 11 [2018-06-27 00:06:18,778 INFO ]: Without dead ends: 11 [2018-06-27 00:06:18,779 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:18,779 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 00:06:18,793 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 00:06:18,794 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:18,798 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:06:18,798 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:06:18,799 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:18,799 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:06:18,799 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:18,799 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:06:18,800 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:06:18,800 INFO ]: Found error trace [2018-06-27 00:06:18,800 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:06:18,800 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:18,800 INFO ]: Analyzing trace with hash 161212838, now seen corresponding path program 1 times [2018-06-27 00:06:18,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:18,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:18,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:18,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:18,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:18,814 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:18,888 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:18,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:18,888 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:18,889 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:18,889 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:18,889 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:18,889 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:06:20,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:20,675 INFO ]: Finished difference Result 11 states and 2063 transitions. [2018-06-27 00:06:20,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:20,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:06:20,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:20,678 INFO ]: With dead ends: 11 [2018-06-27 00:06:20,678 INFO ]: Without dead ends: 11 [2018-06-27 00:06:20,678 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:20,678 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 00:06:20,688 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-27 00:06:20,688 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:20,692 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2060 transitions. [2018-06-27 00:06:20,692 INFO ]: Start accepts. Automaton has 8 states and 2060 transitions. Word has length 5 [2018-06-27 00:06:20,692 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:20,692 INFO ]: Abstraction has 8 states and 2060 transitions. [2018-06-27 00:06:20,692 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:20,692 INFO ]: Start isEmpty. Operand 8 states and 2060 transitions. [2018-06-27 00:06:20,693 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:06:20,693 INFO ]: Found error trace [2018-06-27 00:06:20,693 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:06:20,693 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:20,693 INFO ]: Analyzing trace with hash 161808658, now seen corresponding path program 1 times [2018-06-27 00:06:20,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:20,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:20,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:20,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:20,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:20,715 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:20,778 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:20,778 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:20,778 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:20,778 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:20,778 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:20,778 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:20,778 INFO ]: Start difference. First operand 8 states and 2060 transitions. Second operand 3 states. [2018-06-27 00:06:22,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:22,538 INFO ]: Finished difference Result 12 states and 2067 transitions. [2018-06-27 00:06:22,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:22,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:06:22,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:22,541 INFO ]: With dead ends: 12 [2018-06-27 00:06:22,541 INFO ]: Without dead ends: 12 [2018-06-27 00:06:22,542 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:22,542 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-27 00:06:22,549 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-27 00:06:22,549 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-27 00:06:22,553 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2065 transitions. [2018-06-27 00:06:22,553 INFO ]: Start accepts. Automaton has 10 states and 2065 transitions. Word has length 5 [2018-06-27 00:06:22,553 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:22,553 INFO ]: Abstraction has 10 states and 2065 transitions. [2018-06-27 00:06:22,553 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:22,553 INFO ]: Start isEmpty. Operand 10 states and 2065 transitions. [2018-06-27 00:06:22,554 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-27 00:06:22,554 INFO ]: Found error trace [2018-06-27 00:06:22,554 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-27 00:06:22,554 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:22,554 INFO ]: Analyzing trace with hash 161799048, now seen corresponding path program 1 times [2018-06-27 00:06:22,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:22,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:22,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:22,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:22,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:22,565 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:22,611 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:22,611 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:22,611 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:22,611 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:22,612 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:22,612 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:22,612 INFO ]: Start difference. First operand 10 states and 2065 transitions. Second operand 3 states. [2018-06-27 00:06:24,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:24,093 INFO ]: Finished difference Result 11 states and 2061 transitions. [2018-06-27 00:06:24,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:24,094 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-27 00:06:24,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:24,095 INFO ]: With dead ends: 11 [2018-06-27 00:06:24,095 INFO ]: Without dead ends: 11 [2018-06-27 00:06: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-27 00:06:24,096 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-27 00:06:24,102 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 7. [2018-06-27 00:06:24,102 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:24,108 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2057 transitions. [2018-06-27 00:06:24,108 INFO ]: Start accepts. Automaton has 7 states and 2057 transitions. Word has length 5 [2018-06-27 00:06:24,108 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:24,108 INFO ]: Abstraction has 7 states and 2057 transitions. [2018-06-27 00:06:24,108 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:24,108 INFO ]: Start isEmpty. Operand 7 states and 2057 transitions. [2018-06-27 00:06:24,110 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:24,110 INFO ]: Found error trace [2018-06-27 00:06:24,110 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:24,110 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:24,110 INFO ]: Analyzing trace with hash 579687228, now seen corresponding path program 1 times [2018-06-27 00:06:24,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:24,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:24,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:24,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:24,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:24,129 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:24,176 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:24,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:24,176 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:24,176 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:24,176 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:24,176 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:24,177 INFO ]: Start difference. First operand 7 states and 2057 transitions. Second operand 3 states. [2018-06-27 00:06:25,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:25,931 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-27 00:06:25,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:25,932 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:25,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:25,934 INFO ]: With dead ends: 8 [2018-06-27 00:06:25,934 INFO ]: Without dead ends: 7 [2018-06-27 00:06:25,934 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:25,934 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:25,938 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:25,938 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:25,939 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2018-06-27 00:06:25,939 INFO ]: Start accepts. Automaton has 7 states and 1033 transitions. Word has length 6 [2018-06-27 00:06:25,939 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:25,939 INFO ]: Abstraction has 7 states and 1033 transitions. [2018-06-27 00:06:25,939 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:25,939 INFO ]: Start isEmpty. Operand 7 states and 1033 transitions. [2018-06-27 00:06:25,939 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:25,939 INFO ]: Found error trace [2018-06-27 00:06:25,939 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:25,940 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:25,940 INFO ]: Analyzing trace with hash 582457791, now seen corresponding path program 1 times [2018-06-27 00:06:25,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:25,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:25,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:25,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:25,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:25,965 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:25,996 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:25,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:25,996 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:25,996 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:25,996 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:25,996 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:25,996 INFO ]: Start difference. First operand 7 states and 1033 transitions. Second operand 3 states. [2018-06-27 00:06:26,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:26,809 INFO ]: Finished difference Result 8 states and 1033 transitions. [2018-06-27 00:06:26,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:26,809 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:26,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:26,810 INFO ]: With dead ends: 8 [2018-06-27 00:06:26,810 INFO ]: Without dead ends: 7 [2018-06-27 00:06:26,810 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:26,810 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:26,812 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:26,812 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:26,813 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2018-06-27 00:06:26,813 INFO ]: Start accepts. Automaton has 7 states and 777 transitions. Word has length 6 [2018-06-27 00:06:26,813 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:26,813 INFO ]: Abstraction has 7 states and 777 transitions. [2018-06-27 00:06:26,813 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:26,813 INFO ]: Start isEmpty. Operand 7 states and 777 transitions. [2018-06-27 00:06:26,814 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:26,814 INFO ]: Found error trace [2018-06-27 00:06:26,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:26,814 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:26,814 INFO ]: Analyzing trace with hash -365998276, now seen corresponding path program 1 times [2018-06-27 00:06:26,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:26,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:26,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:26,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:26,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:26,827 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:26,876 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:26,876 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:26,876 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:26,876 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:26,876 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:26,876 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:26,876 INFO ]: Start difference. First operand 7 states and 777 transitions. Second operand 3 states. [2018-06-27 00:06:27,488 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:27,488 INFO ]: Finished difference Result 8 states and 777 transitions. [2018-06-27 00:06:27,489 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:27,489 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:27,489 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:27,490 INFO ]: With dead ends: 8 [2018-06-27 00:06:27,490 INFO ]: Without dead ends: 7 [2018-06-27 00:06:27,490 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:27,490 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:27,492 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:27,492 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:27,492 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 521 transitions. [2018-06-27 00:06:27,492 INFO ]: Start accepts. Automaton has 7 states and 521 transitions. Word has length 6 [2018-06-27 00:06:27,492 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:27,492 INFO ]: Abstraction has 7 states and 521 transitions. [2018-06-27 00:06:27,492 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:27,492 INFO ]: Start isEmpty. Operand 7 states and 521 transitions. [2018-06-27 00:06:27,492 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:27,492 INFO ]: Found error trace [2018-06-27 00:06:27,492 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:27,492 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:27,492 INFO ]: Analyzing trace with hash -365074755, now seen corresponding path program 1 times [2018-06-27 00:06:27,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:27,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:27,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:27,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:27,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:27,510 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:27,537 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:27,537 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:27,556 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:27,556 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:27,556 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:27,556 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:27,556 INFO ]: Start difference. First operand 7 states and 521 transitions. Second operand 3 states. [2018-06-27 00:06:27,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:27,957 INFO ]: Finished difference Result 8 states and 521 transitions. [2018-06-27 00:06:27,957 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:27,957 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:27,957 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:27,957 INFO ]: With dead ends: 8 [2018-06-27 00:06:27,957 INFO ]: Without dead ends: 7 [2018-06-27 00:06:27,958 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:27,958 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:27,959 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:27,959 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:27,959 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 265 transitions. [2018-06-27 00:06:27,959 INFO ]: Start accepts. Automaton has 7 states and 265 transitions. Word has length 6 [2018-06-27 00:06:27,959 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:27,959 INFO ]: Abstraction has 7 states and 265 transitions. [2018-06-27 00:06:27,959 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:27,959 INFO ]: Start isEmpty. Operand 7 states and 265 transitions. [2018-06-27 00:06:27,959 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:27,959 INFO ]: Found error trace [2018-06-27 00:06:27,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:27,960 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:27,960 INFO ]: Analyzing trace with hash -838841028, now seen corresponding path program 1 times [2018-06-27 00:06:27,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:27,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:27,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:27,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:27,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:27,974 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:28,009 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:28,009 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:28,009 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:28,009 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:28,009 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:28,009 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,009 INFO ]: Start difference. First operand 7 states and 265 transitions. Second operand 3 states. [2018-06-27 00:06:28,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:28,219 INFO ]: Finished difference Result 8 states and 265 transitions. [2018-06-27 00:06:28,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:28,219 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:28,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:28,219 INFO ]: With dead ends: 8 [2018-06-27 00:06:28,219 INFO ]: Without dead ends: 7 [2018-06-27 00:06:28,220 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,220 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:28,220 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:28,220 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:28,221 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2018-06-27 00:06:28,221 INFO ]: Start accepts. Automaton has 7 states and 201 transitions. Word has length 6 [2018-06-27 00:06:28,221 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:28,221 INFO ]: Abstraction has 7 states and 201 transitions. [2018-06-27 00:06:28,221 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:28,221 INFO ]: Start isEmpty. Operand 7 states and 201 transitions. [2018-06-27 00:06:28,221 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:28,221 INFO ]: Found error trace [2018-06-27 00:06:28,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:28,221 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:28,221 INFO ]: Analyzing trace with hash 345112894, now seen corresponding path program 1 times [2018-06-27 00:06:28,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:28,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:28,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:28,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,231 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:28,266 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:28,266 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:28,266 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:28,266 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:28,266 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:28,266 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,266 INFO ]: Start difference. First operand 7 states and 201 transitions. Second operand 3 states. [2018-06-27 00:06:28,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:28,423 INFO ]: Finished difference Result 8 states and 201 transitions. [2018-06-27 00:06:28,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:28,423 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:28,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:28,424 INFO ]: With dead ends: 8 [2018-06-27 00:06:28,424 INFO ]: Without dead ends: 7 [2018-06-27 00:06:28,424 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,424 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:28,425 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:28,425 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:28,425 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2018-06-27 00:06:28,425 INFO ]: Start accepts. Automaton has 7 states and 153 transitions. Word has length 6 [2018-06-27 00:06:28,425 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:28,425 INFO ]: Abstraction has 7 states and 153 transitions. [2018-06-27 00:06:28,425 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:28,425 INFO ]: Start isEmpty. Operand 7 states and 153 transitions. [2018-06-27 00:06:28,425 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:28,425 INFO ]: Found error trace [2018-06-27 00:06:28,425 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:28,426 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:28,426 INFO ]: Analyzing trace with hash -126806337, now seen corresponding path program 1 times [2018-06-27 00:06:28,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:28,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:28,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:28,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,437 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:28,550 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:28,550 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:28,550 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:28,550 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:28,550 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:28,550 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,550 INFO ]: Start difference. First operand 7 states and 153 transitions. Second operand 3 states. [2018-06-27 00:06:28,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:28,683 INFO ]: Finished difference Result 8 states and 153 transitions. [2018-06-27 00:06:28,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:28,683 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:28,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:28,683 INFO ]: With dead ends: 8 [2018-06-27 00:06:28,683 INFO ]: Without dead ends: 7 [2018-06-27 00:06:28,683 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,683 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:28,684 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:28,684 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:28,684 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-06-27 00:06:28,685 INFO ]: Start accepts. Automaton has 7 states and 105 transitions. Word has length 6 [2018-06-27 00:06:28,685 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:28,685 INFO ]: Abstraction has 7 states and 105 transitions. [2018-06-27 00:06:28,685 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:28,685 INFO ]: Start isEmpty. Operand 7 states and 105 transitions. [2018-06-27 00:06:28,685 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:28,685 INFO ]: Found error trace [2018-06-27 00:06:28,685 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:28,685 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:28,685 INFO ]: Analyzing trace with hash -1069721278, now seen corresponding path program 1 times [2018-06-27 00:06:28,685 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:28,685 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:28,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:28,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,697 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:28,765 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:28,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:28,765 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:28,765 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:28,765 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:28,765 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,765 INFO ]: Start difference. First operand 7 states and 105 transitions. Second operand 3 states. [2018-06-27 00:06:28,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:28,847 INFO ]: Finished difference Result 8 states and 105 transitions. [2018-06-27 00:06:28,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:28,847 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:28,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:28,847 INFO ]: With dead ends: 8 [2018-06-27 00:06:28,847 INFO ]: Without dead ends: 7 [2018-06-27 00:06:28,847 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,848 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:28,848 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:28,848 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:28,849 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-06-27 00:06:28,849 INFO ]: Start accepts. Automaton has 7 states and 73 transitions. Word has length 6 [2018-06-27 00:06:28,849 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:28,849 INFO ]: Abstraction has 7 states and 73 transitions. [2018-06-27 00:06:28,849 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:28,849 INFO ]: Start isEmpty. Operand 7 states and 73 transitions. [2018-06-27 00:06:28,849 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:28,849 INFO ]: Found error trace [2018-06-27 00:06:28,849 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:28,849 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:28,849 INFO ]: Analyzing trace with hash 349730499, now seen corresponding path program 1 times [2018-06-27 00:06:28,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:28,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:28,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,850 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:28,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,860 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:28,894 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:28,894 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:28,894 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:28,894 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:28,894 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:28,894 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,895 INFO ]: Start difference. First operand 7 states and 73 transitions. Second operand 3 states. [2018-06-27 00:06:28,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:28,950 INFO ]: Finished difference Result 8 states and 73 transitions. [2018-06-27 00:06:28,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:28,951 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:28,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:28,951 INFO ]: With dead ends: 8 [2018-06-27 00:06:28,951 INFO ]: Without dead ends: 7 [2018-06-27 00:06:28,952 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:28,952 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:28,952 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:28,952 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:28,953 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-06-27 00:06:28,953 INFO ]: Start accepts. Automaton has 7 states and 57 transitions. Word has length 6 [2018-06-27 00:06:28,953 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:28,953 INFO ]: Abstraction has 7 states and 57 transitions. [2018-06-27 00:06:28,953 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:28,953 INFO ]: Start isEmpty. Operand 7 states and 57 transitions. [2018-06-27 00:06:28,953 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:28,953 INFO ]: Found error trace [2018-06-27 00:06:28,953 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:28,953 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:28,953 INFO ]: Analyzing trace with hash 520581884, now seen corresponding path program 1 times [2018-06-27 00:06:28,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:28,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:28,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:28,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:28,961 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:29,070 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:29,070 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:29,070 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:29,070 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:29,070 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:29,070 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:29,070 INFO ]: Start difference. First operand 7 states and 57 transitions. Second operand 3 states. [2018-06-27 00:06:29,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:29,656 INFO ]: Finished difference Result 8 states and 57 transitions. [2018-06-27 00:06:29,657 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:29,657 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:29,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:29,657 INFO ]: With dead ends: 8 [2018-06-27 00:06:29,657 INFO ]: Without dead ends: 7 [2018-06-27 00:06:29,658 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:29,658 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:29,658 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:29,658 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:29,659 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-06-27 00:06:29,659 INFO ]: Start accepts. Automaton has 7 states and 41 transitions. Word has length 6 [2018-06-27 00:06:29,659 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:29,659 INFO ]: Abstraction has 7 states and 41 transitions. [2018-06-27 00:06:29,659 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:29,659 INFO ]: Start isEmpty. Operand 7 states and 41 transitions. [2018-06-27 00:06:29,659 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:29,659 INFO ]: Found error trace [2018-06-27 00:06:29,659 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:29,659 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:29,659 INFO ]: Analyzing trace with hash -68624514, now seen corresponding path program 1 times [2018-06-27 00:06:29,659 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:29,659 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:29,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:29,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:29,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:29,670 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:29,729 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:29,729 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-27 00:06:29,729 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-27 00:06:29,729 INFO ]: Interpolant automaton has 3 states [2018-06-27 00:06:29,729 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-27 00:06:29,729 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:29,729 INFO ]: Start difference. First operand 7 states and 41 transitions. Second operand 3 states. [2018-06-27 00:06:29,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:29,760 INFO ]: Finished difference Result 8 states and 41 transitions. [2018-06-27 00:06:29,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-27 00:06:29,760 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-27 00:06:29,760 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:29,760 INFO ]: With dead ends: 8 [2018-06-27 00:06:29,760 INFO ]: Without dead ends: 7 [2018-06-27 00:06:29,760 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-27 00:06:29,760 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-27 00:06:29,761 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-27 00:06:29,761 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-27 00:06:29,761 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-06-27 00:06:29,761 INFO ]: Start accepts. Automaton has 7 states and 17 transitions. Word has length 6 [2018-06-27 00:06:29,761 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:29,761 INFO ]: Abstraction has 7 states and 17 transitions. [2018-06-27 00:06:29,761 INFO ]: Interpolant automaton has 3 states. [2018-06-27 00:06:29,761 INFO ]: Start isEmpty. Operand 7 states and 17 transitions. [2018-06-27 00:06:29,761 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-27 00:06:29,761 INFO ]: Found error trace [2018-06-27 00:06:29,762 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-27 00:06:29,762 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:29,762 INFO ]: Analyzing trace with hash 418071053, now seen corresponding path program 1 times [2018-06-27 00:06:29,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:29,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:29,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:29,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:29,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:29,770 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:29,899 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:29,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:06:29,899 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:06:29,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:29,967 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:29,976 INFO ]: Computing forward predicates... [2018-06-27 00:06:30,048 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:30,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:06:30,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-27 00:06:30,082 INFO ]: Interpolant automaton has 4 states [2018-06-27 00:06:30,082 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-27 00:06:30,082 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-27 00:06:30,083 INFO ]: Start difference. First operand 7 states and 17 transitions. Second operand 4 states. [2018-06-27 00:06:30,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:30,145 INFO ]: Finished difference Result 9 states and 18 transitions. [2018-06-27 00:06:30,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:06:30,145 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-27 00:06:30,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:30,146 INFO ]: With dead ends: 9 [2018-06-27 00:06:30,146 INFO ]: Without dead ends: 8 [2018-06-27 00:06:30,146 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-27 00:06:30,146 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:06:30,147 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:06:30,147 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:30,147 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-27 00:06:30,147 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-27 00:06:30,147 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:30,147 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-27 00:06:30,147 INFO ]: Interpolant automaton has 4 states. [2018-06-27 00:06:30,147 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-27 00:06:30,147 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:06:30,147 INFO ]: Found error trace [2018-06-27 00:06:30,147 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:06:30,147 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:30,147 INFO ]: Analyzing trace with hash -216288376, now seen corresponding path program 1 times [2018-06-27 00:06:30,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:30,147 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:30,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:30,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:30,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:30,166 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:30,638 WARN ]: Spent 405.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2018-06-27 00:06:30,852 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-27 00:06:30,996 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:30,996 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:06:30,996 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-27 00:06:31,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:06:31,069 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:31,072 INFO ]: Computing forward predicates... [2018-06-27 00:06:31,282 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-27 00:06:31,722 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:31,741 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:06:31,741 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 00:06:31,741 INFO ]: Interpolant automaton has 7 states [2018-06-27 00:06:31,741 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 00:06:31,741 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:06:31,741 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 7 states. [2018-06-27 00:06:31,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:31,973 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-27 00:06:31,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:06:31,974 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 00:06:31,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:31,974 INFO ]: With dead ends: 10 [2018-06-27 00:06:31,974 INFO ]: Without dead ends: 8 [2018-06-27 00:06:31,974 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-27 00:06:31,974 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:06:31,975 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:06:31,975 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:31,975 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-27 00:06:31,975 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-27 00:06:31,975 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:31,975 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-27 00:06:31,975 INFO ]: Interpolant automaton has 7 states. [2018-06-27 00:06:31,975 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-27 00:06:31,975 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:06:31,975 INFO ]: Found error trace [2018-06-27 00:06:31,975 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:06:31,975 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:31,975 INFO ]: Analyzing trace with hash -1843392815, now seen corresponding path program 1 times [2018-06-27 00:06:31,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:31,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:31,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:31,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:31,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:31,987 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:32,178 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-06-27 00:06:32,211 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:32,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:06:32,211 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:06:32,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:32,247 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:32,250 INFO ]: Computing forward predicates... [2018-06-27 00:06:32,746 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:32,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:06:32,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 00:06:32,765 INFO ]: Interpolant automaton has 7 states [2018-06-27 00:06:32,766 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 00:06:32,766 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:06:32,766 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-06-27 00:06:32,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:32,832 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-27 00:06:32,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:06:32,832 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 00:06:32,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:32,833 INFO ]: With dead ends: 10 [2018-06-27 00:06:32,833 INFO ]: Without dead ends: 8 [2018-06-27 00:06:32,833 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-27 00:06:32,833 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:06:32,834 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:06:32,834 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:32,834 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-27 00:06:32,834 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-27 00:06:32,834 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:32,834 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-27 00:06:32,834 INFO ]: Interpolant automaton has 7 states. [2018-06-27 00:06:32,834 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-27 00:06:32,834 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:06:32,834 INFO ]: Found error trace [2018-06-27 00:06:32,834 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:06:32,834 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:32,835 INFO ]: Analyzing trace with hash 990893134, now seen corresponding path program 1 times [2018-06-27 00:06:32,835 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:32,835 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:32,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:32,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:32,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:32,847 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:33,010 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-27 00:06:33,237 WARN ]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-27 00:06:33,380 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:33,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:06:33,380 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-27 00:06:33,394 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-27 00:06:33,448 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:33,450 INFO ]: Computing forward predicates... [2018-06-27 00:06:33,579 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-27 00:06:33,710 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:33,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:06:33,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-27 00:06:33,730 INFO ]: Interpolant automaton has 8 states [2018-06-27 00:06:33,730 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-27 00:06:33,730 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-27 00:06:33,730 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 8 states. [2018-06-27 00:06:33,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:33,824 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-27 00:06:33,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-27 00:06:33,824 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-27 00:06:33,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:33,824 INFO ]: With dead ends: 10 [2018-06-27 00:06:33,824 INFO ]: Without dead ends: 8 [2018-06-27 00:06:33,824 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-27 00:06:33,824 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-27 00:06:33,825 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-27 00:06:33,825 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-27 00:06:33,825 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-27 00:06:33,825 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-27 00:06:33,825 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:33,825 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-27 00:06:33,825 INFO ]: Interpolant automaton has 8 states. [2018-06-27 00:06:33,825 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-27 00:06:33,825 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-27 00:06:33,825 INFO ]: Found error trace [2018-06-27 00:06:33,826 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-27 00:06:33,826 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-27 00:06:33,826 INFO ]: Analyzing trace with hash 1447175612, now seen corresponding path program 1 times [2018-06-27 00:06:33,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-27 00:06:33,826 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-27 00:06:33,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:33,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:33,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-27 00:06:33,845 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:33,966 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:33,967 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-27 00:06:33,967 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-27 00:06:33,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-27 00:06:34,020 INFO ]: Conjunction of SSA is unsat [2018-06-27 00:06:34,022 INFO ]: Computing forward predicates... [2018-06-27 00:06:34,191 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:06:34,193 WARN ]: expecting exponential blowup for input size 6 [2018-06-27 00:06:34,306 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-27 00:06:34,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-27 00:06:34,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-27 00:06:34,341 INFO ]: Interpolant automaton has 7 states [2018-06-27 00:06:34,341 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-27 00:06:34,341 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-27 00:06:34,341 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 7 states. [2018-06-27 00:06:34,624 WARN ]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-27 00:06:35,080 WARN ]: Spent 382.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-06-27 00:06:35,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-27 00:06:35,083 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-27 00:06:35,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-27 00:06:35,084 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-27 00:06:35,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-27 00:06:35,084 INFO ]: With dead ends: 4 [2018-06-27 00:06:35,084 INFO ]: Without dead ends: 0 [2018-06-27 00:06:35,085 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-27 00:06:35,085 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-27 00:06:35,085 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-27 00:06:35,085 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-27 00:06:35,085 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-27 00:06:35,085 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-27 00:06:35,085 INFO ]: Finished accepts. word is rejected. [2018-06-27 00:06:35,085 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-27 00:06:35,085 INFO ]: Interpolant automaton has 7 states. [2018-06-27 00:06:35,085 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-27 00:06:35,085 INFO ]: Finished isEmpty. No accepting run. [2018-06-27 00:06:35,086 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-27 00:06:35,087 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 12:06:35 BasicIcfg [2018-06-27 00:06:35,087 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-27 00:06:35,088 INFO ]: Toolchain (without parser) took 39795.16 ms. Allocated memory was 308.8 MB in the beginning and 1.3 GB in the end (delta: 953.7 MB). Free memory was 261.3 MB in the beginning and 410.8 MB in the end (delta: -149.5 MB). Peak memory consumption was 804.2 MB. Max. memory is 3.6 GB. [2018-06-27 00:06:35,088 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-27 00:06:35,089 INFO ]: ChcToBoogie took 63.21 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 258.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:06:35,089 INFO ]: Boogie Preprocessor took 45.50 ms. Allocated memory is still 308.8 MB. Free memory was 258.3 MB in the beginning and 257.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-27 00:06:35,089 INFO ]: RCFGBuilder took 375.69 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-27 00:06:35,090 INFO ]: BlockEncodingV2 took 13993.58 ms. Allocated memory was 308.8 MB in the beginning and 784.9 MB in the end (delta: 476.1 MB). Free memory was 243.3 MB in the beginning and 561.6 MB in the end (delta: -318.4 MB). Peak memory consumption was 442.5 MB. Max. memory is 3.6 GB. [2018-06-27 00:06:35,090 INFO ]: TraceAbstraction took 25305.32 ms. Allocated memory was 784.9 MB in the beginning and 1.3 GB in the end (delta: 477.6 MB). Free memory was 561.6 MB in the beginning and 410.8 MB in the end (delta: 150.8 MB). Peak memory consumption was 628.5 MB. Max. memory is 3.6 GB. [2018-06-27 00:06:35,093 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2056 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.21 ms. Allocated memory is still 308.8 MB. Free memory was 261.3 MB in the beginning and 258.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.50 ms. Allocated memory is still 308.8 MB. Free memory was 258.3 MB in the beginning and 257.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 375.69 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 243.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13993.58 ms. Allocated memory was 308.8 MB in the beginning and 784.9 MB in the end (delta: 476.1 MB). Free memory was 243.3 MB in the beginning and 561.6 MB in the end (delta: -318.4 MB). Peak memory consumption was 442.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 25305.32 ms. Allocated memory was 784.9 MB in the beginning and 1.3 GB in the end (delta: 477.6 MB). Free memory was 561.6 MB in the beginning and 410.8 MB in the end (delta: 150.8 MB). Peak memory consumption was 628.5 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.2s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 19.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17648 SDtfs, 3 SDslu, 107 SDs, 0 SdLazy, 8484 SolverSat, 9241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 14 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 1791 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 11/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-27_00-06-35-102.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-27_00-06-35-102.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-27_00-06-35-102.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-27_00-06-35-102.csv Received shutdown request...