java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:01:55,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:01:55,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:01:55,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:01:55,697 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:01:55,699 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:01:55,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:01:55,705 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:01:55,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:01:55,708 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:01:55,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:01:55,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:01:55,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:01:55,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:01:55,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:01:55,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:01:55,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:01:55,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:01:55,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:01:55,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:01:55,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:01:55,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:01:55,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:01:55,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:01:55,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:01:55,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:01:55,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:01:55,744 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:01:55,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:01:55,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:01:55,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:01:55,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:01:55,750 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:01:55,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:01:55,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:01:55,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:01:55,752 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:01:55,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:01:55,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:01:55,780 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:01:55,780 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:01:55,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:01:55,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:01:55,781 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:01:55,783 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:01:55,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:01:55,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:01:55,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:01:55,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:01:55,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:01:55,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:01:55,784 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:01:55,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:01:55,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:01:55,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:01:55,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:01:55,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:01:55,785 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:01:55,788 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:01:55,788 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:01:55,833 INFO ]: Repository-Root is: /tmp [2018-06-26 18:01:55,851 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:01:55,856 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:01:55,857 INFO ]: Initializing SmtParser... [2018-06-26 18:01:55,857 INFO ]: SmtParser initialized [2018-06-26 18:01:55,858 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-26 18:01:55,860 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:01:55,943 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 unknown [2018-06-26 18:01:56,182 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-26 18:01:56,186 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:01:56,193 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:01:56,194 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:01:56,194 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:01:56,194 INFO ]: ChcToBoogie initialized [2018-06-26 18:01:56,197 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,255 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56 Unit [2018-06-26 18:01:56,255 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:01:56,255 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:01:56,255 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:01:56,255 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:01:56,274 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,274 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,281 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,282 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,287 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,300 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,302 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,303 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:01:56,304 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:01:56,304 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:01:56,304 INFO ]: RCFGBuilder initialized [2018-06-26 18:01:56,305 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:01:56,329 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:01:56,329 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:01:56,329 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:01:56,329 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:01:56,329 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:01:56,329 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:01:56,738 INFO ]: Using library mode [2018-06-26 18:01:56,739 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:01:56 BoogieIcfgContainer [2018-06-26 18:01:56,739 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:01:56,739 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:01:56,739 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:01:56,740 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:01:56,741 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:01:56" (1/1) ... [2018-06-26 18:01:56,755 INFO ]: Initial Icfg 10 locations, 20 edges [2018-06-26 18:01:56,756 INFO ]: Using Remove infeasible edges [2018-06-26 18:01:56,757 INFO ]: Using Maximize final states [2018-06-26 18:01:56,757 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:01:56,757 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:01:56,759 INFO ]: Using Remove sink states [2018-06-26 18:01:56,760 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:01:56,760 INFO ]: Using Use SBE [2018-06-26 18:01:56,770 INFO ]: SBE split 0 edges [2018-06-26 18:01:56,775 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:01:56,776 INFO ]: 0 new accepting states [2018-06-26 18:01:56,805 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:01:56,807 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:01:56,812 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:01:56,813 INFO ]: 0 new accepting states [2018-06-26 18:01:56,813 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:01:56,813 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:01:56,813 INFO ]: Encoded RCFG 6 locations, 16 edges [2018-06-26 18:01:56,814 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:01:56 BasicIcfg [2018-06-26 18:01:56,814 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:01:56,814 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:01:56,815 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:01:56,819 INFO ]: TraceAbstraction initialized [2018-06-26 18:01:56,819 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:01:56" (1/4) ... [2018-06-26 18:01:56,820 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c16049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:01:56, skipping insertion in model container [2018-06-26 18:01:56,820 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:01:56" (2/4) ... [2018-06-26 18:01:56,820 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c16049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:01:56, skipping insertion in model container [2018-06-26 18:01:56,820 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:01:56" (3/4) ... [2018-06-26 18:01:56,821 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c16049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:01:56, skipping insertion in model container [2018-06-26 18:01:56,821 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:01:56" (4/4) ... [2018-06-26 18:01:56,822 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:01:56,832 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:01:56,840 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:01:56,877 INFO ]: Using default assertion order modulation [2018-06-26 18:01:56,878 INFO ]: Interprodecural is true [2018-06-26 18:01:56,878 INFO ]: Hoare is false [2018-06-26 18:01:56,878 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:01:56,878 INFO ]: Backedges is TWOTRACK [2018-06-26 18:01:56,878 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:01:56,878 INFO ]: Difference is false [2018-06-26 18:01:56,878 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:01:56,878 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:01:56,888 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:01:56,897 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:01:56,898 INFO ]: Found error trace [2018-06-26 18:01:56,901 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:01:56,901 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:56,906 INFO ]: Analyzing trace with hash 44945612, now seen corresponding path program 1 times [2018-06-26 18:01:56,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:56,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:56,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:56,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:56,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:56,984 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:57,055 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:57,057 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:01:57,057 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:01:57,058 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:01:57,070 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:01:57,070 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:01:57,073 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:01:57,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:57,217 INFO ]: Finished difference Result 7 states and 27 transitions. [2018-06-26 18:01:57,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:01:57,218 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:01:57,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:57,226 INFO ]: With dead ends: 7 [2018-06-26 18:01:57,226 INFO ]: Without dead ends: 7 [2018-06-26 18:01:57,228 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:01:57,241 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:01:57,270 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:01:57,272 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:01:57,272 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-06-26 18:01:57,273 INFO ]: Start accepts. Automaton has 7 states and 27 transitions. Word has length 5 [2018-06-26 18:01:57,274 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:57,274 INFO ]: Abstraction has 7 states and 27 transitions. [2018-06-26 18:01:57,274 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:01:57,274 INFO ]: Start isEmpty. Operand 7 states and 27 transitions. [2018-06-26 18:01:57,275 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:01:57,275 INFO ]: Found error trace [2018-06-26 18:01:57,275 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:01:57,275 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:57,275 INFO ]: Analyzing trace with hash 1392720243, now seen corresponding path program 1 times [2018-06-26 18:01:57,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:57,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:57,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:57,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:57,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:57,302 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:57,514 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:57,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:57,514 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:57,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:57,570 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:57,580 INFO ]: Computing forward predicates... [2018-06-26 18:01:57,671 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:57,691 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:01:57,691 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-26 18:01:57,691 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:01:57,692 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:01:57,692 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:01:57,692 INFO ]: Start difference. First operand 7 states and 27 transitions. Second operand 5 states. [2018-06-26 18:01:58,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:58,184 INFO ]: Finished difference Result 11 states and 63 transitions. [2018-06-26 18:01:58,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:01:58,184 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 18:01:58,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:58,185 INFO ]: With dead ends: 11 [2018-06-26 18:01:58,185 INFO ]: Without dead ends: 11 [2018-06-26 18:01:58,186 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:01:58,186 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:01:58,188 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:01:58,188 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:01:58,189 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-06-26 18:01:58,189 INFO ]: Start accepts. Automaton has 11 states and 63 transitions. Word has length 6 [2018-06-26 18:01:58,189 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:58,189 INFO ]: Abstraction has 11 states and 63 transitions. [2018-06-26 18:01:58,189 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:01:58,189 INFO ]: Start isEmpty. Operand 11 states and 63 transitions. [2018-06-26 18:01:58,190 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:01:58,190 INFO ]: Found error trace [2018-06-26 18:01:58,190 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:01:58,190 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:58,190 INFO ]: Analyzing trace with hash 1392750034, now seen corresponding path program 1 times [2018-06-26 18:01:58,190 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:58,190 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:58,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:58,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:58,191 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:58,204 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:58,256 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:58,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:58,256 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-26 18:01:58,280 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-26 18:01:58,314 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:58,315 INFO ]: Computing forward predicates... [2018-06-26 18:01:58,450 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:58,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:58,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 18:01:58,470 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:01:58,470 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:01:58,470 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:01:58,471 INFO ]: Start difference. First operand 11 states and 63 transitions. Second operand 6 states. [2018-06-26 18:01:58,599 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-26 18:01:59,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:59,318 INFO ]: Finished difference Result 21 states and 128 transitions. [2018-06-26 18:01:59,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:01:59,319 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 18:01:59,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:59,321 INFO ]: With dead ends: 21 [2018-06-26 18:01:59,321 INFO ]: Without dead ends: 21 [2018-06-26 18:01:59,321 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:01:59,321 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 18:01:59,327 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 18:01:59,327 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 18:01:59,328 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-06-26 18:01:59,328 INFO ]: Start accepts. Automaton has 17 states and 110 transitions. Word has length 6 [2018-06-26 18:01:59,328 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:59,328 INFO ]: Abstraction has 17 states and 110 transitions. [2018-06-26 18:01:59,328 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:01:59,329 INFO ]: Start isEmpty. Operand 17 states and 110 transitions. [2018-06-26 18:01:59,329 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:01:59,329 INFO ]: Found error trace [2018-06-26 18:01:59,329 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:01:59,329 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:59,329 INFO ]: Analyzing trace with hash 1392779825, now seen corresponding path program 1 times [2018-06-26 18:01:59,329 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:59,329 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:59,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:59,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:59,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:59,355 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:59,421 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:59,421 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:59,421 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:59,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:59,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:59,445 INFO ]: Computing forward predicates... [2018-06-26 18:01:59,458 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:59,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:59,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:01:59,477 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:01:59,477 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:01:59,477 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:01:59,477 INFO ]: Start difference. First operand 17 states and 110 transitions. Second operand 4 states. [2018-06-26 18:01:59,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:01:59,554 INFO ]: Finished difference Result 22 states and 149 transitions. [2018-06-26 18:01:59,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:01:59,555 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:01:59,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:01:59,556 INFO ]: With dead ends: 22 [2018-06-26 18:01:59,556 INFO ]: Without dead ends: 22 [2018-06-26 18:01:59,556 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:01:59,556 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:01:59,560 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-26 18:01:59,560 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 18:01:59,561 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 132 transitions. [2018-06-26 18:01:59,561 INFO ]: Start accepts. Automaton has 19 states and 132 transitions. Word has length 6 [2018-06-26 18:01:59,561 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:01:59,561 INFO ]: Abstraction has 19 states and 132 transitions. [2018-06-26 18:01:59,561 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:01:59,561 INFO ]: Start isEmpty. Operand 19 states and 132 transitions. [2018-06-26 18:01:59,561 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:01:59,561 INFO ]: Found error trace [2018-06-26 18:01:59,561 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:01:59,562 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:01:59,562 INFO ]: Analyzing trace with hash 1392869198, now seen corresponding path program 1 times [2018-06-26 18:01:59,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:01:59,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:01:59,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:59,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:59,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:01:59,573 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:59,745 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:59,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:01:59,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:01:59,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:01:59,764 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:01:59,765 INFO ]: Computing forward predicates... [2018-06-26 18:01:59,799 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:01:59,827 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:01:59,827 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 18:01:59,827 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:01:59,827 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:01:59,827 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:01:59,827 INFO ]: Start difference. First operand 19 states and 132 transitions. Second operand 6 states. [2018-06-26 18:02:00,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:00,049 INFO ]: Finished difference Result 28 states and 213 transitions. [2018-06-26 18:02:00,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:00,049 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-26 18:02:00,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:00,051 INFO ]: With dead ends: 28 [2018-06-26 18:02:00,051 INFO ]: Without dead ends: 28 [2018-06-26 18:02:00,051 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:00,051 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:02:00,055 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-26 18:02:00,055 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:02:00,056 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 179 transitions. [2018-06-26 18:02:00,056 INFO ]: Start accepts. Automaton has 24 states and 179 transitions. Word has length 6 [2018-06-26 18:02:00,056 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:00,056 INFO ]: Abstraction has 24 states and 179 transitions. [2018-06-26 18:02:00,056 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:02:00,056 INFO ]: Start isEmpty. Operand 24 states and 179 transitions. [2018-06-26 18:02:00,057 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:02:00,057 INFO ]: Found error trace [2018-06-26 18:02:00,057 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:02:00,057 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:00,057 INFO ]: Analyzing trace with hash 1392928780, now seen corresponding path program 1 times [2018-06-26 18:02:00,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:00,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:00,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:00,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,066 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,097 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:00,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:00,097 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:00,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:00,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,127 INFO ]: Computing forward predicates... [2018-06-26 18:02:00,138 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:00,158 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:00,158 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-26 18:02:00,158 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:02:00,158 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:02:00,158 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:02:00,158 INFO ]: Start difference. First operand 24 states and 179 transitions. Second operand 5 states. [2018-06-26 18:02:00,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:00,219 INFO ]: Finished difference Result 28 states and 191 transitions. [2018-06-26 18:02:00,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:02:00,219 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 18:02:00,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:00,220 INFO ]: With dead ends: 28 [2018-06-26 18:02:00,220 INFO ]: Without dead ends: 28 [2018-06-26 18:02:00,220 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:00,220 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:02:00,224 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-26 18:02:00,224 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 18:02:00,225 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2018-06-26 18:02:00,225 INFO ]: Start accepts. Automaton has 24 states and 163 transitions. Word has length 6 [2018-06-26 18:02:00,225 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:00,225 INFO ]: Abstraction has 24 states and 163 transitions. [2018-06-26 18:02:00,225 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:02:00,225 INFO ]: Start isEmpty. Operand 24 states and 163 transitions. [2018-06-26 18:02:00,226 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:00,226 INFO ]: Found error trace [2018-06-26 18:02:00,226 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:00,226 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:00,226 INFO ]: Analyzing trace with hash 225937677, now seen corresponding path program 1 times [2018-06-26 18:02:00,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:00,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:00,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:00,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,243 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,268 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:00,268 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:02:00,268 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:02:00,268 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:02:00,268 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:02:00,268 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:00,268 INFO ]: Start difference. First operand 24 states and 163 transitions. Second operand 3 states. [2018-06-26 18:02:00,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:00,325 INFO ]: Finished difference Result 29 states and 181 transitions. [2018-06-26 18:02:00,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:02:00,328 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:02:00,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:00,328 INFO ]: With dead ends: 29 [2018-06-26 18:02:00,328 INFO ]: Without dead ends: 29 [2018-06-26 18:02:00,329 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:00,329 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 18:02:00,333 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-06-26 18:02:00,333 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 18:02:00,334 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 180 transitions. [2018-06-26 18:02:00,334 INFO ]: Start accepts. Automaton has 28 states and 180 transitions. Word has length 7 [2018-06-26 18:02:00,334 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:00,334 INFO ]: Abstraction has 28 states and 180 transitions. [2018-06-26 18:02:00,334 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:02:00,334 INFO ]: Start isEmpty. Operand 28 states and 180 transitions. [2018-06-26 18:02:00,334 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:00,334 INFO ]: Found error trace [2018-06-26 18:02:00,334 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 18:02:00,334 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:00,335 INFO ]: Analyzing trace with hash 225967468, now seen corresponding path program 2 times [2018-06-26 18:02:00,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:00,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:00,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:00,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,347 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,404 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:00,404 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:00,404 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:00,413 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:00,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:00,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,446 INFO ]: Computing forward predicates... [2018-06-26 18:02:00,471 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:00,496 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:00,496 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-26 18:02:00,497 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:00,497 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:00,497 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:00,497 INFO ]: Start difference. First operand 28 states and 180 transitions. Second operand 7 states. [2018-06-26 18:02:00,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:00,848 INFO ]: Finished difference Result 34 states and 150 transitions. [2018-06-26 18:02:00,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:00,848 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 18:02:00,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:00,849 INFO ]: With dead ends: 34 [2018-06-26 18:02:00,849 INFO ]: Without dead ends: 34 [2018-06-26 18:02:00,849 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:00,849 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 18:02:00,852 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 25. [2018-06-26 18:02:00,852 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 18:02:00,853 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 110 transitions. [2018-06-26 18:02:00,853 INFO ]: Start accepts. Automaton has 25 states and 110 transitions. Word has length 7 [2018-06-26 18:02:00,853 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:00,853 INFO ]: Abstraction has 25 states and 110 transitions. [2018-06-26 18:02:00,853 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:00,853 INFO ]: Start isEmpty. Operand 25 states and 110 transitions. [2018-06-26 18:02:00,854 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:00,854 INFO ]: Found error trace [2018-06-26 18:02:00,854 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:00,854 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:00,854 INFO ]: Analyzing trace with hash 226205796, now seen corresponding path program 1 times [2018-06-26 18:02:00,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:00,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:00,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,855 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:00,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:00,866 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,970 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:00,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:00,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:00,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:00,997 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:00,999 INFO ]: Computing forward predicates... [2018-06-26 18:02:01,359 WARN ]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-26 18:02:01,372 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:01,391 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:01,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:02:01,392 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:02:01,392 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:02:01,392 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:01,392 INFO ]: Start difference. First operand 25 states and 110 transitions. Second operand 8 states. [2018-06-26 18:02:02,102 WARN ]: Spent 523.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-06-26 18:02:02,633 WARN ]: Spent 519.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-06-26 18:02:02,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:02,747 INFO ]: Finished difference Result 44 states and 167 transitions. [2018-06-26 18:02:02,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:02:02,747 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:02:02,747 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:02,749 INFO ]: With dead ends: 44 [2018-06-26 18:02:02,749 INFO ]: Without dead ends: 44 [2018-06-26 18:02:02,750 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:02:02,750 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 18:02:02,753 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-26 18:02:02,753 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 18:02:02,754 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 128 transitions. [2018-06-26 18:02:02,754 INFO ]: Start accepts. Automaton has 31 states and 128 transitions. Word has length 7 [2018-06-26 18:02:02,754 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:02,754 INFO ]: Abstraction has 31 states and 128 transitions. [2018-06-26 18:02:02,754 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:02:02,754 INFO ]: Start isEmpty. Operand 31 states and 128 transitions. [2018-06-26 18:02:02,755 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:02,755 INFO ]: Found error trace [2018-06-26 18:02:02,755 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:02,755 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:02,755 INFO ]: Analyzing trace with hash 226861198, now seen corresponding path program 1 times [2018-06-26 18:02:02,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:02,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:02,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:02,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:02,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:02,764 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:02,799 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:02,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:02,800 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:02,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:02,824 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:02,825 INFO ]: Computing forward predicates... [2018-06-26 18:02:02,913 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:02,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:02,932 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:02:02,932 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:02:02,932 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:02:02,932 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:02,932 INFO ]: Start difference. First operand 31 states and 128 transitions. Second operand 8 states. [2018-06-26 18:02:03,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:03,171 INFO ]: Finished difference Result 40 states and 157 transitions. [2018-06-26 18:02:03,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:03,172 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:02:03,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:03,173 INFO ]: With dead ends: 40 [2018-06-26 18:02:03,173 INFO ]: Without dead ends: 40 [2018-06-26 18:02:03,173 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:02:03,173 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 18:02:03,177 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-06-26 18:02:03,177 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 18:02:03,178 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2018-06-26 18:02:03,178 INFO ]: Start accepts. Automaton has 33 states and 134 transitions. Word has length 7 [2018-06-26 18:02:03,178 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:03,178 INFO ]: Abstraction has 33 states and 134 transitions. [2018-06-26 18:02:03,178 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:02:03,178 INFO ]: Start isEmpty. Operand 33 states and 134 transitions. [2018-06-26 18:02:03,178 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:03,178 INFO ]: Found error trace [2018-06-26 18:02:03,178 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:03,179 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:03,179 INFO ]: Analyzing trace with hash 226980362, now seen corresponding path program 1 times [2018-06-26 18:02:03,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:03,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:03,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:03,179 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:03,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:03,187 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:03,239 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:03,239 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:03,239 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:03,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:03,269 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:03,271 INFO ]: Computing forward predicates... [2018-06-26 18:02:03,304 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:03,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:03,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 18:02:03,323 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:02:03,323 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:02:03,323 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:02:03,324 INFO ]: Start difference. First operand 33 states and 134 transitions. Second operand 6 states. [2018-06-26 18:02:03,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:03,434 INFO ]: Finished difference Result 43 states and 173 transitions. [2018-06-26 18:02:03,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:03,434 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 18:02:03,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:03,434 INFO ]: With dead ends: 43 [2018-06-26 18:02:03,434 INFO ]: Without dead ends: 43 [2018-06-26 18:02:03,435 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:03,435 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 18:02:03,439 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-06-26 18:02:03,439 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:02:03,440 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2018-06-26 18:02:03,440 INFO ]: Start accepts. Automaton has 34 states and 138 transitions. Word has length 7 [2018-06-26 18:02:03,440 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:03,440 INFO ]: Abstraction has 34 states and 138 transitions. [2018-06-26 18:02:03,440 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:02:03,440 INFO ]: Start isEmpty. Operand 34 states and 138 transitions. [2018-06-26 18:02:03,441 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:02:03,441 INFO ]: Found error trace [2018-06-26 18:02:03,441 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:03,441 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:03,441 INFO ]: Analyzing trace with hash 232432115, now seen corresponding path program 1 times [2018-06-26 18:02:03,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:03,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:03,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:03,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:03,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:03,449 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:03,476 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:03,476 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:02:03,476 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:02:03,476 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:02:03,476 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:02:03,476 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:03,476 INFO ]: Start difference. First operand 34 states and 138 transitions. Second operand 3 states. [2018-06-26 18:02:03,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:03,514 INFO ]: Finished difference Result 28 states and 54 transitions. [2018-06-26 18:02:03,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:02:03,516 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:02:03,516 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:03,516 INFO ]: With dead ends: 28 [2018-06-26 18:02:03,516 INFO ]: Without dead ends: 15 [2018-06-26 18:02:03,517 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:02:03,517 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:02:03,518 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-26 18:02:03,518 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:03,518 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-26 18:02:03,518 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-26 18:02:03,518 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:03,518 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-26 18:02:03,518 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:02:03,518 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-26 18:02:03,518 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:02:03,518 INFO ]: Found error trace [2018-06-26 18:02:03,518 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:03,518 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:03,519 INFO ]: Analyzing trace with hash -1556609752, now seen corresponding path program 1 times [2018-06-26 18:02:03,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:03,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:03,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:03,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:03,519 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:03,529 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:03,573 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:03,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:03,573 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:03,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:03,609 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:03,611 INFO ]: Computing forward predicates... [2018-06-26 18:02:03,711 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:03,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:03,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-26 18:02:03,730 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:02:03,730 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:02:03,730 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:03,730 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 10 states. [2018-06-26 18:02:04,306 WARN ]: Spent 530.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-06-26 18:02:04,587 WARN ]: Spent 270.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-26 18:02:05,267 WARN ]: Spent 320.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-06-26 18:02:05,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:05,835 INFO ]: Finished difference Result 17 states and 29 transitions. [2018-06-26 18:02:05,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:05,835 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-26 18:02:05,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:05,836 INFO ]: With dead ends: 17 [2018-06-26 18:02:05,836 INFO ]: Without dead ends: 11 [2018-06-26 18:02:05,836 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=38, Invalid=117, Unknown=1, NotChecked=0, Total=156 [2018-06-26 18:02:05,836 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:05,837 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 18:02:05,837 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:02:05,837 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-26 18:02:05,837 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-26 18:02:05,837 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:05,837 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-26 18:02:05,837 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:02:05,837 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-26 18:02:05,837 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:02:05,837 INFO ]: Found error trace [2018-06-26 18:02:05,838 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:05,838 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:05,838 INFO ]: Analyzing trace with hash -1555954350, now seen corresponding path program 2 times [2018-06-26 18:02:05,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:05,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:05,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:05,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:05,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:05,847 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:05,935 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:05,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:05,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:05,941 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:05,979 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:05,979 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:05,981 INFO ]: Computing forward predicates... [2018-06-26 18:02:05,995 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:06,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:06,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 18:02:06,014 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:06,014 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:06,014 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:06,015 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2018-06-26 18:02:06,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:06,052 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-26 18:02:06,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:02:06,052 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 18:02:06,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:06,052 INFO ]: With dead ends: 12 [2018-06-26 18:02:06,052 INFO ]: Without dead ends: 12 [2018-06-26 18:02:06,052 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:06,052 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:02:06,053 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 18:02:06,053 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:06,053 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-26 18:02:06,054 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-26 18:02:06,054 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:06,054 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-26 18:02:06,054 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:06,054 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-26 18:02:06,054 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:02:06,054 INFO ]: Found error trace [2018-06-26 18:02:06,054 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:06,054 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:06,054 INFO ]: Analyzing trace with hash -1555835186, now seen corresponding path program 2 times [2018-06-26 18:02:06,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:06,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:06,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,054 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:06,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,060 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:06,097 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:06,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:06,097 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:06,102 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:06,117 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:06,117 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:06,119 INFO ]: Computing forward predicates... [2018-06-26 18:02:06,181 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:06,200 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:06,200 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-06-26 18:02:06,200 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:02:06,200 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:02:06,200 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:06,200 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 9 states. [2018-06-26 18:02:06,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:06,244 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-26 18:02:06,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:02:06,245 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-26 18:02:06,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:06,245 INFO ]: With dead ends: 13 [2018-06-26 18:02:06,245 INFO ]: Without dead ends: 13 [2018-06-26 18:02:06,245 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:06,245 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:02:06,246 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-26 18:02:06,246 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:06,246 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-26 18:02:06,247 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-26 18:02:06,247 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:06,247 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-26 18:02:06,247 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:02:06,247 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-26 18:02:06,247 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:06,247 INFO ]: Found error trace [2018-06-26 18:02:06,247 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:06,247 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:06,247 INFO ]: Analyzing trace with hash -990240413, now seen corresponding path program 1 times [2018-06-26 18:02:06,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:06,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:06,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,248 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:06,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:06,258 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:06,333 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:06,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:06,333 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:06,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:06,368 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:06,370 INFO ]: Computing forward predicates... [2018-06-26 18:02:07,898 WARN ]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-26 18:02:07,905 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:07,932 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:07,933 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 18:02:07,933 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:02:07,933 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:02:07,933 INFO ]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2018-06-26 18:02:07,933 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 12 states. [2018-06-26 18:02:08,527 WARN ]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-26 18:02:09,311 WARN ]: Spent 666.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-06-26 18:02:09,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:09,895 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-26 18:02:09,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:09,901 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-26 18:02:09,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:09,901 INFO ]: With dead ends: 16 [2018-06-26 18:02:09,901 INFO ]: Without dead ends: 11 [2018-06-26 18:02:09,902 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=51, Invalid=184, Unknown=5, NotChecked=0, Total=240 [2018-06-26 18:02:09,902 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:09,902 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:02:09,902 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:09,903 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-26 18:02:09,903 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 9 [2018-06-26 18:02:09,903 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:09,903 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-26 18:02:09,903 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:02:09,903 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-26 18:02:09,903 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:09,903 INFO ]: Found error trace [2018-06-26 18:02:09,903 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:09,903 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:09,906 INFO ]: Analyzing trace with hash -989316892, now seen corresponding path program 2 times [2018-06-26 18:02:09,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:09,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:09,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:09,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:09,915 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,060 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:10,060 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:10,060 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:10,066 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:10,084 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:10,084 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:10,086 INFO ]: Computing forward predicates... [2018-06-26 18:02:11,557 WARN ]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-26 18:02:11,560 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:11,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:11,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-26 18:02:11,580 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:02:11,580 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:02:11,580 INFO ]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2018-06-26 18:02:11,580 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 12 states. [2018-06-26 18:02:12,036 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-06-26 18:02:13,734 WARN ]: Spent 340.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-06-26 18:02:14,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:14,352 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-26 18:02:14,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:02:14,352 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-26 18:02:14,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:14,353 INFO ]: With dead ends: 14 [2018-06-26 18:02:14,353 INFO ]: Without dead ends: 11 [2018-06-26 18:02:14,353 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=46, Invalid=158, Unknown=6, NotChecked=0, Total=210 [2018-06-26 18:02:14,353 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:02:14,353 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:02:14,353 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:14,354 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-26 18:02:14,354 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 9 [2018-06-26 18:02:14,354 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:14,354 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-26 18:02:14,354 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:02:14,354 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-26 18:02:14,354 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:14,354 INFO ]: Found error trace [2018-06-26 18:02:14,354 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:14,354 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:14,354 INFO ]: Analyzing trace with hash -988661490, now seen corresponding path program 3 times [2018-06-26 18:02:14,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:14,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:14,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:14,354 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:14,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:14,362 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:14,514 INFO ]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:14,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:14,514 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:14,520 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:14,538 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:02:14,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:14,539 INFO ]: Computing forward predicates... [2018-06-26 18:02:14,631 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:14,650 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:02:14,650 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-26 18:02:14,650 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:02:14,651 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:02:14,651 INFO ]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:02:14,651 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 11 states. [2018-06-26 18:02:15,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:15,673 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-26 18:02:15,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:02:15,673 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-26 18:02:15,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:15,673 INFO ]: With dead ends: 12 [2018-06-26 18:02:15,673 INFO ]: Without dead ends: 12 [2018-06-26 18:02:15,673 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:02:15,674 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:02:15,674 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-26 18:02:15,674 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:02:15,674 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-26 18:02:15,675 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 9 [2018-06-26 18:02:15,675 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:15,675 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-26 18:02:15,675 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:02:15,675 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-26 18:02:15,675 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:02:15,675 INFO ]: Found error trace [2018-06-26 18:02:15,675 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:15,675 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:15,675 INFO ]: Analyzing trace with hash -984699287, now seen corresponding path program 1 times [2018-06-26 18:02:15,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:15,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:15,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:15,676 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:15,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:15,691 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:15,966 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:15,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:15,966 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:15,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:16,000 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:16,002 INFO ]: Computing forward predicates... [2018-06-26 18:02:16,068 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:16,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:16,087 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 18:02:16,087 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:02:16,087 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:02:16,087 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:02:16,087 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 7 states. [2018-06-26 18:02:16,156 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:16,156 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-26 18:02:16,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:02:16,156 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 18:02:16,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:16,156 INFO ]: With dead ends: 13 [2018-06-26 18:02:16,156 INFO ]: Without dead ends: 13 [2018-06-26 18:02:16,156 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:02:16,156 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:02:16,157 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 18:02:16,158 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:02:16,158 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-26 18:02:16,158 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-26 18:02:16,158 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:16,158 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-26 18:02:16,158 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:02:16,158 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-26 18:02:16,158 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:16,158 INFO ]: Found error trace [2018-06-26 18:02:16,158 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:16,159 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:16,159 INFO ]: Analyzing trace with hash -584030937, now seen corresponding path program 2 times [2018-06-26 18:02:16,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:16,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:16,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:16,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:16,168 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:17,077 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-26 18:02:17,078 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:17,078 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:17,078 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:02:17,092 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:17,117 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:17,117 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:17,118 INFO ]: Computing forward predicates... [2018-06-26 18:02:20,886 WARN ]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-26 18:02:20,889 INFO ]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:20,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:20,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:02:20,908 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:02:20,908 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:02:20,908 INFO ]: CoverageRelationStatistics Valid=44, Invalid=128, Unknown=10, NotChecked=0, Total=182 [2018-06-26 18:02:20,909 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 14 states. [2018-06-26 18:02:26,807 WARN ]: Spent 359.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-06-26 18:02:30,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:30,099 INFO ]: Finished difference Result 16 states and 25 transitions. [2018-06-26 18:02:30,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:30,099 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-26 18:02:30,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:30,099 INFO ]: With dead ends: 16 [2018-06-26 18:02:30,099 INFO ]: Without dead ends: 13 [2018-06-26 18:02:30,099 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=58, Invalid=198, Unknown=16, NotChecked=0, Total=272 [2018-06-26 18:02:30,099 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:02:30,100 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 18:02:30,100 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:30,100 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-26 18:02:30,100 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-26 18:02:30,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:30,100 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-26 18:02:30,100 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:02:30,100 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-26 18:02:30,100 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:30,100 INFO ]: Found error trace [2018-06-26 18:02:30,100 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:30,100 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:30,100 INFO ]: Analyzing trace with hash -583107416, now seen corresponding path program 3 times [2018-06-26 18:02:30,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:30,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:30,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:30,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:30,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:30,209 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:30,317 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:30,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:30,317 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:30,326 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:02:30,374 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:02:30,374 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:30,376 INFO ]: Computing forward predicates... [2018-06-26 18:02:30,430 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:30,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:30,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 18:02:30,466 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:02:30,466 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:02:30,466 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:02:30,466 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 9 states. [2018-06-26 18:02:30,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:30,576 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-26 18:02:30,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:02:30,576 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 18:02:30,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:30,576 INFO ]: With dead ends: 17 [2018-06-26 18:02:30,576 INFO ]: Without dead ends: 17 [2018-06-26 18:02:30,576 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:02:30,576 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:02:30,577 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-26 18:02:30,577 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:30,578 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-26 18:02:30,578 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-26 18:02:30,578 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:30,578 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-26 18:02:30,578 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:02:30,578 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-26 18:02:30,578 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:30,578 INFO ]: Found error trace [2018-06-26 18:02:30,578 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:30,578 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:30,578 INFO ]: Analyzing trace with hash -580336853, now seen corresponding path program 1 times [2018-06-26 18:02:30,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:30,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:30,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:30,579 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:30,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:30,590 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:30,861 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:30,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:30,862 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:30,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:30,885 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:30,886 INFO ]: Computing forward predicates... [2018-06-26 18:02:34,448 WARN ]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-26 18:02:34,450 INFO ]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:34,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:34,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-26 18:02:34,470 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:02:34,470 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:02:34,470 INFO ]: CoverageRelationStatistics Valid=44, Invalid=129, Unknown=9, NotChecked=0, Total=182 [2018-06-26 18:02:34,470 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 14 states. [2018-06-26 18:02:35,492 WARN ]: Spent 358.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-06-26 18:02:39,392 WARN ]: Spent 371.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-06-26 18:02:40,481 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:40,481 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-26 18:02:40,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:40,481 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-26 18:02:40,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:40,481 INFO ]: With dead ends: 17 [2018-06-26 18:02:40,481 INFO ]: Without dead ends: 13 [2018-06-26 18:02:40,482 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=58, Invalid=199, Unknown=15, NotChecked=0, Total=272 [2018-06-26 18:02:40,482 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:02:40,483 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 18:02:40,483 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:40,483 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-26 18:02:40,483 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-26 18:02:40,483 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:40,483 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-26 18:02:40,483 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:02:40,483 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-26 18:02:40,483 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:02:40,483 INFO ]: Found error trace [2018-06-26 18:02:40,483 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:40,483 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:40,484 INFO ]: Analyzing trace with hash -578489811, now seen corresponding path program 2 times [2018-06-26 18:02:40,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:40,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:40,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:40,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:02:40,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:40,495 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:40,557 INFO ]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:40,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:40,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:40,566 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:02:40,587 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:02:40,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:40,589 INFO ]: Computing forward predicates... [2018-06-26 18:02:40,652 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:40,672 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:40,672 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-26 18:02:40,672 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:02:40,672 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:02:40,672 INFO ]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:02:40,672 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 13 states. [2018-06-26 18:02:41,118 WARN ]: Spent 347.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-06-26 18:02:41,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:02:41,131 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-26 18:02:41,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:02:41,132 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-26 18:02:41,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:02:41,132 INFO ]: With dead ends: 16 [2018-06-26 18:02:41,132 INFO ]: Without dead ends: 16 [2018-06-26 18:02:41,132 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-06-26 18:02:41,132 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 18:02:41,133 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-26 18:02:41,133 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:02:41,133 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-26 18:02:41,133 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-26 18:02:41,134 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:02:41,134 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-26 18:02:41,134 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:02:41,134 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-26 18:02:41,134 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:02:41,134 INFO ]: Found error trace [2018-06-26 18:02:41,134 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:02:41,134 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:02:41,134 INFO ]: Analyzing trace with hash -896756531, now seen corresponding path program 4 times [2018-06-26 18:02:41,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:02:41,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:02:41,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:41,135 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:02:41,135 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:02:41,155 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:41,238 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:41,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:02:41,238 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:02:41,243 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:02:41,266 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:02:41,266 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:02:41,268 INFO ]: Computing forward predicates... [2018-06-26 18:02:44,088 WARN ]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-06-26 18:02:48,172 WARN ]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-26 18:02:48,175 INFO ]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:02:48,195 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:02:48,195 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 18:02:48,196 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:02:48,196 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:02:48,196 INFO ]: CoverageRelationStatistics Valid=48, Invalid=184, Unknown=8, NotChecked=0, Total=240 [2018-06-26 18:02:48,196 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 16 states. [2018-06-26 18:02:52,130 WARN ]: Spent 726.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-06-26 18:02:58,295 WARN ]: Spent 816.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-06-26 18:03:04,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:03:04,277 INFO ]: Finished difference Result 17 states and 23 transitions. [2018-06-26 18:03:04,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:03:04,277 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-26 18:03:04,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:03:04,277 INFO ]: With dead ends: 17 [2018-06-26 18:03:04,277 INFO ]: Without dead ends: 13 [2018-06-26 18:03:04,277 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=69, Invalid=298, Unknown=13, NotChecked=0, Total=380 [2018-06-26 18:03:04,277 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:03:04,278 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 18:03:04,278 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:03:04,279 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-26 18:03:04,279 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-26 18:03:04,279 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:03:04,279 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-26 18:03:04,279 INFO ]: Interpolant automaton has 16 states. [2018-06-26 18:03:04,279 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-26 18:03:04,279 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:03:04,279 INFO ]: Found error trace [2018-06-26 18:03:04,279 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:03:04,279 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:03:04,279 INFO ]: Analyzing trace with hash -876439069, now seen corresponding path program 3 times [2018-06-26 18:03:04,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:03:04,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:03:04,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:04,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:03:04,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:03:04,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:04,381 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:04,381 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:03:04,381 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:03:04,386 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:03:04,409 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 18:03:04,409 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:03:04,411 INFO ]: Computing forward predicates... [2018-06-26 18:03:09,037 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-26 18:03:10,869 WARN ]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-26 18:03:10,880 INFO ]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:03:10,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:03:10,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 18:03:10,898 INFO ]: Interpolant automaton has 16 states [2018-06-26 18:03:10,898 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 18:03:10,898 INFO ]: CoverageRelationStatistics Valid=59, Invalid=169, Unknown=12, NotChecked=0, Total=240 [2018-06-26 18:03:10,898 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 16 states. [2018-06-26 18:03:11,898 WARN ]: Spent 482.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 Received shutdown request... [2018-06-26 18:03:14,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:03:14,072 WARN ]: Verification canceled [2018-06-26 18:03:14,075 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:03:14,076 WARN ]: Timeout [2018-06-26 18:03:14,076 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:03:14 BasicIcfg [2018-06-26 18:03:14,076 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:03:14,077 INFO ]: Toolchain (without parser) took 77890.07 ms. Allocated memory was 309.3 MB in the beginning and 557.3 MB in the end (delta: 248.0 MB). Free memory was 263.7 MB in the beginning and 428.6 MB in the end (delta: -165.0 MB). Peak memory consumption was 83.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:14,077 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:03:14,077 INFO ]: ChcToBoogie took 61.12 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:14,078 INFO ]: Boogie Preprocessor took 48.23 ms. Allocated memory is still 309.3 MB. Free memory is still 259.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:03:14,078 INFO ]: RCFGBuilder took 435.05 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 243.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:14,078 INFO ]: BlockEncodingV2 took 74.33 ms. Allocated memory is still 309.3 MB. Free memory was 243.7 MB in the beginning and 241.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:14,079 INFO ]: TraceAbstraction took 77261.42 ms. Allocated memory was 309.3 MB in the beginning and 557.3 MB in the end (delta: 248.0 MB). Free memory was 241.7 MB in the beginning and 428.6 MB in the end (delta: -186.9 MB). Peak memory consumption was 61.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:03:14,081 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 20 edges - StatisticsResult: Encoded RCFG 6 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.12 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.23 ms. Allocated memory is still 309.3 MB. Free memory is still 259.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 435.05 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 243.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 74.33 ms. Allocated memory is still 309.3 MB. Free memory was 243.7 MB in the beginning and 241.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 77261.42 ms. Allocated memory was 309.3 MB in the beginning and 557.3 MB in the end (delta: 248.0 MB). Free memory was 241.7 MB in the beginning and 428.6 MB in the end (delta: -186.9 MB). Peak memory consumption was 61.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (13states) and interpolant automaton (currently 9 states, 16 states before enhancement), while ReachableStatesComputation was computing reachable states (12 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 77.2s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 47.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 24 SDslu, 358 SDs, 0 SdLazy, 1650 SolverSat, 462 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 128 SyntacticMatches, 11 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 49.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=11, 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.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 71 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 332 ConstructedInterpolants, 49 QuantifiedInterpolants, 19774 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3325 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 47 InterpolantComputations, 8 PerfectInterpolantSequences, 58/360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-03-14-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-03-14-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-03-14-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-03-14-091.csv Completed graceful shutdown