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/llreve-bench/smt2/loop__simple-loop.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:45:30,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:45:30,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:45:30,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:45:30,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:45:30,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:45:30,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:45:30,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:45:30,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:45:30,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:45:30,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:45:30,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:45:30,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:45:30,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:45:30,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:45:30,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:45:30,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:45:30,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:45:30,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:45:30,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:45:30,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:45:30,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:45:30,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:45:30,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:45:30,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:45:30,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:45:30,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:45:30,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:45:30,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:45:30,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:45:30,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:45:30,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:45:30,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:45:30,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:45:30,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:45:30,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:45:30,092 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:45:30,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:45:30,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:45:30,112 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:45:30,112 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:45:30,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:45:30,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:45:30,114 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:45:30,114 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:45:30,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:45:30,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:45:30,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:45:30,115 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:45:30,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:45:30,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:45:30,115 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:45:30,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:45:30,116 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:45:30,116 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:45:30,116 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:45:30,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:45:30,116 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:45:30,118 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:45:30,119 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:45:30,162 INFO ]: Repository-Root is: /tmp [2018-06-26 18:45:30,172 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:45:30,174 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:45:30,175 INFO ]: Initializing SmtParser... [2018-06-26 18:45:30,175 INFO ]: SmtParser initialized [2018-06-26 18:45:30,176 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 [2018-06-26 18:45:30,177 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:45:30,265 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@431833c4 [2018-06-26 18:45:30,406 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__simple-loop.smt2 [2018-06-26 18:45:30,412 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:45:30,418 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:45:30,418 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:45:30,418 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:45:30,418 INFO ]: ChcToBoogie initialized [2018-06-26 18:45:30,422 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,474 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30 Unit [2018-06-26 18:45:30,474 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:45:30,474 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:45:30,474 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:45:30,474 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:45:30,496 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,496 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,500 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,500 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,503 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,504 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,505 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,506 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:45:30,508 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:45:30,508 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:45:30,508 INFO ]: RCFGBuilder initialized [2018-06-26 18:45:30,509 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (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:45:30,526 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:45:30,526 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:45:30,526 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:45:30,526 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:45:30,526 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:45:30,526 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:45:30,682 INFO ]: Using library mode [2018-06-26 18:45:30,683 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:30 BoogieIcfgContainer [2018-06-26 18:45:30,683 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:45:30,683 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:45:30,683 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:45:30,684 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:45:30,685 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:30" (1/1) ... [2018-06-26 18:45:30,700 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-26 18:45:30,701 INFO ]: Using Remove infeasible edges [2018-06-26 18:45:30,701 INFO ]: Using Maximize final states [2018-06-26 18:45:30,702 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:45:30,702 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:45:30,704 INFO ]: Using Remove sink states [2018-06-26 18:45:30,704 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:45:30,705 INFO ]: Using Use SBE [2018-06-26 18:45:30,709 INFO ]: SBE split 0 edges [2018-06-26 18:45:30,714 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 18:45:30,716 INFO ]: 0 new accepting states [2018-06-26 18:45:30,734 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 18:45:30,736 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:45:30,739 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:45:30,739 INFO ]: 0 new accepting states [2018-06-26 18:45:30,739 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:45:30,740 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:45:30,740 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-26 18:45:30,740 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:45:30 BasicIcfg [2018-06-26 18:45:30,740 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:45:30,741 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:45:30,741 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:45:30,745 INFO ]: TraceAbstraction initialized [2018-06-26 18:45:30,745 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:45:30" (1/4) ... [2018-06-26 18:45:30,746 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1b00c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:45:30, skipping insertion in model container [2018-06-26 18:45:30,746 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:45:30" (2/4) ... [2018-06-26 18:45:30,746 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1b00c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:45:30, skipping insertion in model container [2018-06-26 18:45:30,746 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:45:30" (3/4) ... [2018-06-26 18:45:30,746 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1b00c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:45:30, skipping insertion in model container [2018-06-26 18:45:30,746 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:45:30" (4/4) ... [2018-06-26 18:45:30,748 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:45:30,755 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:45:30,761 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:45:30,802 INFO ]: Using default assertion order modulation [2018-06-26 18:45:30,802 INFO ]: Interprodecural is true [2018-06-26 18:45:30,802 INFO ]: Hoare is false [2018-06-26 18:45:30,803 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:45:30,803 INFO ]: Backedges is TWOTRACK [2018-06-26 18:45:30,803 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:45:30,803 INFO ]: Difference is false [2018-06-26 18:45:30,803 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:45:30,803 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:45:30,816 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 18:45:30,826 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:45:30,826 INFO ]: Found error trace [2018-06-26 18:45:30,827 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:45:30,827 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:30,832 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-26 18:45:30,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:30,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:30,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:30,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:30,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:30,898 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:30,976 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:45:30,978 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:30,978 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:30,980 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:30,991 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:30,992 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:30,994 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 18:45:31,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:31,134 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-26 18:45:31,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:31,136 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:45:31,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:31,146 INFO ]: With dead ends: 7 [2018-06-26 18:45:31,146 INFO ]: Without dead ends: 7 [2018-06-26 18:45:31,149 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:45:31,166 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 18:45:31,205 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 18:45:31,207 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:45:31,207 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-26 18:45:31,210 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-26 18:45:31,210 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:31,210 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-26 18:45:31,210 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:31,210 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-26 18:45:31,210 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:31,210 INFO ]: Found error trace [2018-06-26 18:45:31,211 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:31,211 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:31,211 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-26 18:45:31,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:31,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:31,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:31,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:31,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:31,221 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:31,294 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:45:31,294 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:31,294 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:31,295 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:31,295 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:31,295 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:31,296 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 3 states. [2018-06-26 18:45:31,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:31,410 INFO ]: Finished difference Result 9 states and 17 transitions. [2018-06-26 18:45:31,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:31,412 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:45:31,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:31,412 INFO ]: With dead ends: 9 [2018-06-26 18:45:31,412 INFO ]: Without dead ends: 9 [2018-06-26 18:45:31,413 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:45:31,413 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:45:31,414 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 18:45:31,414 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 18:45:31,415 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-26 18:45:31,415 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 6 [2018-06-26 18:45:31,415 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:31,415 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-26 18:45:31,415 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:31,415 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-26 18:45:31,415 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:45:31,415 INFO ]: Found error trace [2018-06-26 18:45:31,415 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:45:31,415 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:31,416 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-26 18:45:31,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:31,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:31,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:31,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:31,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:31,432 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:31,542 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:45:31,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:31,542 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:45:31,552 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:31,576 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:31,581 INFO ]: Computing forward predicates... [2018-06-26 18:45:31,602 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:45:31,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:31,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:45:31,624 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:45:31,624 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:45:31,624 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:45:31,624 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 4 states. [2018-06-26 18:45:31,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:31,712 INFO ]: Finished difference Result 10 states and 20 transitions. [2018-06-26 18:45:31,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:45:31,713 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:45:31,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:31,713 INFO ]: With dead ends: 10 [2018-06-26 18:45:31,713 INFO ]: Without dead ends: 10 [2018-06-26 18:45:31,713 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:45:31,714 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:45:31,714 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-26 18:45:31,714 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:45:31,715 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-26 18:45:31,715 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-26 18:45:31,715 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:31,715 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-26 18:45:31,715 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:45:31,715 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-26 18:45:31,715 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:45:31,715 INFO ]: Found error trace [2018-06-26 18:45:31,715 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:31,715 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:31,716 INFO ]: Analyzing trace with hash 1484954627, now seen corresponding path program 1 times [2018-06-26 18:45:31,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:31,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:31,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:31,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:31,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:31,725 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:31,781 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:45:31,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:31,782 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:45:31,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:31,816 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:31,818 INFO ]: Computing forward predicates... [2018-06-26 18:45:31,829 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:45:31,858 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:31,858 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:45:31,858 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:45:31,858 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:45:31,858 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:45:31,859 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 5 states. [2018-06-26 18:45:32,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:32,061 INFO ]: Finished difference Result 11 states and 23 transitions. [2018-06-26 18:45:32,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:45:32,065 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 18:45:32,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:32,065 INFO ]: With dead ends: 11 [2018-06-26 18:45:32,065 INFO ]: Without dead ends: 11 [2018-06-26 18:45:32,065 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:45:32,065 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:45:32,067 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-26 18:45:32,067 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:45:32,067 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-06-26 18:45:32,068 INFO ]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 7 [2018-06-26 18:45:32,069 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:32,069 INFO ]: Abstraction has 9 states and 17 transitions. [2018-06-26 18:45:32,069 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:45:32,069 INFO ]: Start isEmpty. Operand 9 states and 17 transitions. [2018-06-26 18:45:32,069 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:45:32,069 INFO ]: Found error trace [2018-06-26 18:45:32,070 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:32,070 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:32,070 INFO ]: Analyzing trace with hash -1212295958, now seen corresponding path program 2 times [2018-06-26 18:45:32,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:32,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:32,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:32,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:32,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:32,088 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:32,178 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:45:32,178 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:32,178 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:45:32,187 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:45:32,201 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:45:32,201 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:32,203 INFO ]: Computing forward predicates... [2018-06-26 18:45:32,210 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:45:32,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:32,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 18:45:32,232 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:45:32,232 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:45:32,232 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:45:32,232 INFO ]: Start difference. First operand 9 states and 17 transitions. Second operand 6 states. [2018-06-26 18:45:32,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:32,284 INFO ]: Finished difference Result 12 states and 26 transitions. [2018-06-26 18:45:32,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:45:32,284 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 18:45:32,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:32,284 INFO ]: With dead ends: 12 [2018-06-26 18:45:32,284 INFO ]: Without dead ends: 12 [2018-06-26 18:45:32,285 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:45:32,285 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:45:32,286 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 18:45:32,286 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:45:32,287 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-26 18:45:32,287 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 8 [2018-06-26 18:45:32,287 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:32,287 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-26 18:45:32,287 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:45:32,287 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-26 18:45:32,287 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:45:32,287 INFO ]: Found error trace [2018-06-26 18:45:32,287 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:32,287 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:32,288 INFO ]: Analyzing trace with hash 1072281827, now seen corresponding path program 3 times [2018-06-26 18:45:32,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:32,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:32,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:32,288 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:32,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:32,298 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:32,386 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:45:32,386 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:32,386 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:45:32,392 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:45:32,425 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:45:32,426 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:32,427 INFO ]: Computing forward predicates... [2018-06-26 18:45:32,577 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:45:32,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:32,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-06-26 18:45:32,598 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:45:32,598 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:45:32,598 INFO ]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:45:32,598 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 9 states. [2018-06-26 18:45:33,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:33,314 INFO ]: Finished difference Result 23 states and 59 transitions. [2018-06-26 18:45:33,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:45:33,315 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-26 18:45:33,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:33,316 INFO ]: With dead ends: 23 [2018-06-26 18:45:33,316 INFO ]: Without dead ends: 23 [2018-06-26 18:45:33,316 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:45:33,316 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 18:45:33,318 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 11. [2018-06-26 18:45:33,318 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:45:33,319 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-26 18:45:33,319 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 9 [2018-06-26 18:45:33,320 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:33,320 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-26 18:45:33,320 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:45:33,320 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-26 18:45:33,320 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:45:33,320 INFO ]: Found error trace [2018-06-26 18:45:33,320 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-26 18:45:33,320 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:33,320 INFO ]: Analyzing trace with hash -1119327349, now seen corresponding path program 4 times [2018-06-26 18:45:33,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:33,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:33,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:33,321 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:33,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:33,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:33,397 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:45:33,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:33,397 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:45:33,403 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:45:33,414 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:45:33,414 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:33,416 INFO ]: Computing forward predicates... [2018-06-26 18:45:33,424 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:45:33,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:33,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 18:45:33,444 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:45:33,444 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:45:33,444 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:45:33,444 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 8 states. [2018-06-26 18:45:33,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:33,523 INFO ]: Finished difference Result 17 states and 41 transitions. [2018-06-26 18:45:33,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:45:33,523 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 18:45:33,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:33,524 INFO ]: With dead ends: 17 [2018-06-26 18:45:33,524 INFO ]: Without dead ends: 17 [2018-06-26 18:45:33,524 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:45:33,524 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 18:45:33,526 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-26 18:45:33,526 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:45:33,527 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-06-26 18:45:33,527 INFO ]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 10 [2018-06-26 18:45:33,527 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:33,527 INFO ]: Abstraction has 12 states and 26 transitions. [2018-06-26 18:45:33,527 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:45:33,527 INFO ]: Start isEmpty. Operand 12 states and 26 transitions. [2018-06-26 18:45:33,527 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:45:33,527 INFO ]: Found error trace [2018-06-26 18:45:33,527 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2018-06-26 18:45:33,527 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:33,527 INFO ]: Analyzing trace with hash -368364220, now seen corresponding path program 5 times [2018-06-26 18:45:33,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:33,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:33,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:33,528 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:33,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:33,545 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:33,575 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:45:33,575 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:33,575 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:45:33,581 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:45:33,609 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:45:33,609 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:33,610 INFO ]: Computing forward predicates... [2018-06-26 18:45:33,615 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:45:33,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:33,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:45:33,646 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:45:33,646 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:45:33,647 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:45:33,647 INFO ]: Start difference. First operand 12 states and 26 transitions. Second operand 5 states. [2018-06-26 18:45:33,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:33,748 INFO ]: Finished difference Result 30 states and 80 transitions. [2018-06-26 18:45:33,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:45:33,749 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-26 18:45:33,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:33,750 INFO ]: With dead ends: 30 [2018-06-26 18:45:33,750 INFO ]: Without dead ends: 30 [2018-06-26 18:45:33,750 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:45:33,750 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 18:45:33,752 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 12. [2018-06-26 18:45:33,752 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:45:33,752 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-06-26 18:45:33,752 INFO ]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 11 [2018-06-26 18:45:33,753 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:33,753 INFO ]: Abstraction has 12 states and 26 transitions. [2018-06-26 18:45:33,753 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:45:33,753 INFO ]: Start isEmpty. Operand 12 states and 26 transitions. [2018-06-26 18:45:33,753 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:45:33,753 INFO ]: Found error trace [2018-06-26 18:45:33,753 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-06-26 18:45:33,753 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:33,753 INFO ]: Analyzing trace with hash -339735069, now seen corresponding path program 6 times [2018-06-26 18:45:33,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:33,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:33,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:33,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:33,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:33,764 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:33,836 INFO ]: Checked inductivity of 21 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:45:33,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:33,836 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:45:33,842 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:45:33,857 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:45:33,857 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:33,859 INFO ]: Computing forward predicates... [2018-06-26 18:45:33,919 INFO ]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:45:33,942 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:33,942 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-06-26 18:45:33,942 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:45:33,942 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:45:33,943 INFO ]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:45:33,943 INFO ]: Start difference. First operand 12 states and 26 transitions. Second operand 8 states. [2018-06-26 18:45:34,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:34,095 INFO ]: Finished difference Result 34 states and 85 transitions. [2018-06-26 18:45:34,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 18:45:34,096 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-26 18:45:34,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:34,096 INFO ]: With dead ends: 34 [2018-06-26 18:45:34,097 INFO ]: Without dead ends: 31 [2018-06-26 18:45:34,097 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:45:34,097 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 18:45:34,099 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 13. [2018-06-26 18:45:34,099 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:45:34,099 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-06-26 18:45:34,099 INFO ]: Start accepts. Automaton has 13 states and 27 transitions. Word has length 11 [2018-06-26 18:45:34,099 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:34,099 INFO ]: Abstraction has 13 states and 27 transitions. [2018-06-26 18:45:34,099 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:45:34,099 INFO ]: Start isEmpty. Operand 13 states and 27 transitions. [2018-06-26 18:45:34,100 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:45:34,100 INFO ]: Found error trace [2018-06-26 18:45:34,100 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:34,100 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:34,100 INFO ]: Analyzing trace with hash -1745664660, now seen corresponding path program 1 times [2018-06-26 18:45:34,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:34,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:34,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,101 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:34,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,105 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:34,158 INFO ]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 18:45:34,159 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:45:34,159 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:45:34,159 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:45:34,159 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:45:34,159 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:45:34,159 INFO ]: Start difference. First operand 13 states and 27 transitions. Second operand 3 states. [2018-06-26 18:45:34,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:34,212 INFO ]: Finished difference Result 13 states and 20 transitions. [2018-06-26 18:45:34,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:45:34,212 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 18:45:34,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:34,213 INFO ]: With dead ends: 13 [2018-06-26 18:45:34,213 INFO ]: Without dead ends: 13 [2018-06-26 18:45:34,213 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:45:34,213 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:45:34,214 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 18:45:34,214 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:45:34,215 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-26 18:45:34,215 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 12 [2018-06-26 18:45:34,215 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:34,215 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-26 18:45:34,215 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:45:34,215 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-26 18:45:34,215 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:45:34,215 INFO ]: Found error trace [2018-06-26 18:45:34,215 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:34,215 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:34,215 INFO ]: Analyzing trace with hash -1810308788, now seen corresponding path program 1 times [2018-06-26 18:45:34,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:34,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:34,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:34,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,227 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:34,331 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:34,331 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:34,331 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:45:34,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:34,352 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:34,354 INFO ]: Computing forward predicates... [2018-06-26 18:45:34,362 INFO ]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:34,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:34,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 18:45:34,385 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:45:34,385 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:45:34,385 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:45:34,386 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 9 states. [2018-06-26 18:45:34,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:34,409 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-26 18:45:34,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:45:34,410 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-26 18:45:34,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:34,410 INFO ]: With dead ends: 14 [2018-06-26 18:45:34,410 INFO ]: Without dead ends: 14 [2018-06-26 18:45:34,411 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:45:34,411 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:45:34,412 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 18:45:34,412 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:45:34,412 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-06-26 18:45:34,412 INFO ]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 12 [2018-06-26 18:45:34,412 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:34,412 INFO ]: Abstraction has 14 states and 22 transitions. [2018-06-26 18:45:34,412 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:45:34,412 INFO ]: Start isEmpty. Operand 14 states and 22 transitions. [2018-06-26 18:45:34,413 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:45:34,413 INFO ]: Found error trace [2018-06-26 18:45:34,413 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:34,413 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:34,414 INFO ]: Analyzing trace with hash -285323198, now seen corresponding path program 2 times [2018-06-26 18:45:34,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:34,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:34,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:45:34,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,424 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:34,530 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:34,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:34,531 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:45:34,537 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:45:34,549 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:45:34,549 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:34,550 INFO ]: Computing forward predicates... [2018-06-26 18:45:34,561 INFO ]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:34,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:34,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 18:45:34,581 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:45:34,582 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:45:34,582 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:45:34,582 INFO ]: Start difference. First operand 14 states and 22 transitions. Second operand 10 states. [2018-06-26 18:45:34,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:34,662 INFO ]: Finished difference Result 15 states and 24 transitions. [2018-06-26 18:45:34,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 18:45:34,662 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-26 18:45:34,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:34,663 INFO ]: With dead ends: 15 [2018-06-26 18:45:34,663 INFO ]: Without dead ends: 15 [2018-06-26 18:45:34,663 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:45:34,663 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:45:34,665 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 18:45:34,665 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:45:34,665 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-26 18:45:34,665 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 13 [2018-06-26 18:45:34,665 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:34,665 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-26 18:45:34,665 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:45:34,665 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-26 18:45:34,666 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:45:34,666 INFO ]: Found error trace [2018-06-26 18:45:34,666 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-26 18:45:34,666 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:45:34,666 INFO ]: Analyzing trace with hash -255410164, now seen corresponding path program 3 times [2018-06-26 18:45:34,666 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:45:34,666 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:45:34,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,667 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:45:34,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:45:34,690 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:35,061 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:45:35,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:45:35,061 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:45:35,071 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:45:35,081 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:45:35,081 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:45:35,082 INFO ]: Computing forward predicates... [2018-06-26 18:45:35,117 INFO ]: Checked inductivity of 45 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 18:45:35,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:45:35,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-06-26 18:45:35,135 INFO ]: Interpolant automaton has 14 states [2018-06-26 18:45:35,135 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 18:45:35,135 INFO ]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:45:35,135 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 14 states. [2018-06-26 18:45:35,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:45:35,279 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 18:45:35,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:45:35,279 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-26 18:45:35,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:45:35,279 INFO ]: With dead ends: 13 [2018-06-26 18:45:35,279 INFO ]: Without dead ends: 0 [2018-06-26 18:45:35,279 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2018-06-26 18:45:35,279 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:45:35,279 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:45:35,279 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:45:35,279 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:45:35,279 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-06-26 18:45:35,279 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:45:35,279 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:45:35,279 INFO ]: Interpolant automaton has 14 states. [2018-06-26 18:45:35,279 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:45:35,279 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:45:35,281 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:45:35,282 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:45:35 BasicIcfg [2018-06-26 18:45:35,282 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:45:35,283 INFO ]: Toolchain (without parser) took 4870.93 ms. Allocated memory was 305.1 MB in the beginning and 339.2 MB in the end (delta: 34.1 MB). Free memory was 262.6 MB in the beginning and 271.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:35,284 INFO ]: SmtParser took 0.04 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:45:35,284 INFO ]: ChcToBoogie took 55.87 ms. Allocated memory is still 305.1 MB. Free memory was 262.6 MB in the beginning and 259.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:35,285 INFO ]: Boogie Preprocessor took 31.80 ms. Allocated memory is still 305.1 MB. Free memory was 259.6 MB in the beginning and 258.6 MB in the end (delta: 997.2 kB). Peak memory consumption was 997.2 kB. Max. memory is 3.6 GB. [2018-06-26 18:45:35,285 INFO ]: RCFGBuilder took 175.13 ms. Allocated memory is still 305.1 MB. Free memory was 258.6 MB in the beginning and 252.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:35,286 INFO ]: BlockEncodingV2 took 56.88 ms. Allocated memory is still 305.1 MB. Free memory was 252.6 MB in the beginning and 250.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:45:35,286 INFO ]: TraceAbstraction took 4541.29 ms. Allocated memory was 305.1 MB in the beginning and 339.2 MB in the end (delta: 34.1 MB). Free memory was 249.7 MB in the beginning and 271.2 MB in the end (delta: -21.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:45:35,289 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.04 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.87 ms. Allocated memory is still 305.1 MB. Free memory was 262.6 MB in the beginning and 259.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.80 ms. Allocated memory is still 305.1 MB. Free memory was 259.6 MB in the beginning and 258.6 MB in the end (delta: 997.2 kB). Peak memory consumption was 997.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 175.13 ms. Allocated memory is still 305.1 MB. Free memory was 258.6 MB in the beginning and 252.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 56.88 ms. Allocated memory is still 305.1 MB. Free memory was 252.6 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4541.29 ms. Allocated memory was 305.1 MB in the beginning and 339.2 MB in the end (delta: 34.1 MB). Free memory was 249.7 MB in the beginning and 271.2 MB in the end (delta: -21.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 1 SDslu, 123 SDs, 0 SdLazy, 178 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=12, 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, 13 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 225 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 4118 SizeOfPredicates, 8 NumberOfNonLiveVariables, 692 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 181/401 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-45-35-299.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-45-35-299.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-45-35-299.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__simple-loop.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-45-35-299.csv Received shutdown request...