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/hopv/lia/termination/Ackermann02.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:24:32,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:24:32,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:24:32,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:24:32,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:24:32,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:24:32,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:24:32,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:24:32,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:24:32,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:24:32,305 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:24:32,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:24:32,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:24:32,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:24:32,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:24:32,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:24:32,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:24:32,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:24:32,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:24:32,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:24:32,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:24:32,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:24:32,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:24:32,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:24:32,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:24:32,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:24:32,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:24:32,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:24:32,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:24:32,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:24:32,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:24:32,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:24:32,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:24:32,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:24:32,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:24:32,340 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:24:32,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:24:32,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:24:32,361 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:24:32,361 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:24:32,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:24:32,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:24:32,363 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:24:32,363 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:24:32,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:24:32,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:24:32,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:24:32,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:24:32,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:24:32,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:24:32,364 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:24:32,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:24:32,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:24:32,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:24:32,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:24:32,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:24:32,366 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:24:32,367 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:24:32,368 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:24:32,414 INFO ]: Repository-Root is: /tmp [2018-06-24 21:24:32,430 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:24:32,433 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:24:32,440 INFO ]: Initializing SmtParser... [2018-06-24 21:24:32,440 INFO ]: SmtParser initialized [2018-06-24 21:24:32,441 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann02.smt2 [2018-06-24 21:24:32,442 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-24 21:24:32,509 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann02.smt2 unknown [2018-06-24 21:24:32,919 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann02.smt2 [2018-06-24 21:24:32,924 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:24:32,937 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:24:32,938 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:24:32,938 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:24:32,939 INFO ]: ChcToBoogie initialized [2018-06-24 21:24:32,942 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:24:32" (1/1) ... [2018-06-24 21:24:33,051 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33 Unit [2018-06-24 21:24:33,051 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:24:33,058 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:24:33,058 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:24:33,058 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:24:33,076 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,076 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,096 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,096 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,115 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,118 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,120 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (1/1) ... [2018-06-24 21:24:33,124 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:24:33,133 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:24:33,133 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:24:33,133 INFO ]: RCFGBuilder initialized [2018-06-24 21:24:33,134 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (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-24 21:24:33,163 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:24:33,163 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:24:33,163 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:24:33,163 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:24:33,163 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:24:33,163 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-24 21:24:34,082 INFO ]: Using library mode [2018-06-24 21:24:34,082 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:24:34 BoogieIcfgContainer [2018-06-24 21:24:34,082 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:24:34,083 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:24:34,083 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:24:34,084 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:24:34,084 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:24:34" (1/1) ... [2018-06-24 21:24:34,112 INFO ]: Initial Icfg 48 locations, 77 edges [2018-06-24 21:24:34,114 INFO ]: Using Remove infeasible edges [2018-06-24 21:24:34,115 INFO ]: Using Maximize final states [2018-06-24 21:24:34,115 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:24:34,116 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:24:34,117 INFO ]: Using Remove sink states [2018-06-24 21:24:34,121 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:24:34,121 INFO ]: Using Use SBE [2018-06-24 21:24:34,193 INFO ]: SBE split 3 edges [2018-06-24 21:24:34,200 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 21:24:34,203 INFO ]: 0 new accepting states [2018-06-24 21:24:34,813 INFO ]: Removed 51 edges and 13 locations by large block encoding [2018-06-24 21:24:34,815 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 21:24:34,817 INFO ]: Removed 3 edges and 0 locations because of local infeasibility [2018-06-24 21:24:34,818 INFO ]: 0 new accepting states [2018-06-24 21:24:34,818 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:24:34,819 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:24:34,819 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:24:34,819 INFO ]: 0 new accepting states [2018-06-24 21:24:34,819 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:24:34,820 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:24:34,820 INFO ]: Encoded RCFG 32 locations, 62 edges [2018-06-24 21:24:34,820 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:24:34 BasicIcfg [2018-06-24 21:24:34,820 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:24:34,823 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:24:34,823 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:24:34,826 INFO ]: TraceAbstraction initialized [2018-06-24 21:24:34,826 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:24:32" (1/4) ... [2018-06-24 21:24:34,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf4f997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:24:34, skipping insertion in model container [2018-06-24 21:24:34,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:24:33" (2/4) ... [2018-06-24 21:24:34,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf4f997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:24:34, skipping insertion in model container [2018-06-24 21:24:34,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:24:34" (3/4) ... [2018-06-24 21:24:34,828 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf4f997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:24:34, skipping insertion in model container [2018-06-24 21:24:34,828 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:24:34" (4/4) ... [2018-06-24 21:24:34,829 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:24:34,838 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:24:34,846 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:24:34,889 INFO ]: Using default assertion order modulation [2018-06-24 21:24:34,890 INFO ]: Interprodecural is true [2018-06-24 21:24:34,890 INFO ]: Hoare is false [2018-06-24 21:24:34,890 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:24:34,890 INFO ]: Backedges is TWOTRACK [2018-06-24 21:24:34,890 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:24:34,890 INFO ]: Difference is false [2018-06-24 21:24:34,890 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:24:34,890 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:24:34,899 INFO ]: Start isEmpty. Operand 32 states. [2018-06-24 21:24:34,917 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:24:34,917 INFO ]: Found error trace [2018-06-24 21:24:34,919 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:24:34,919 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:34,925 INFO ]: Analyzing trace with hash 43341403, now seen corresponding path program 1 times [2018-06-24 21:24:34,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:34,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:34,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:34,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:34,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:35,026 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:35,140 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:24:35,142 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:35,142 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:35,143 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:35,154 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:35,155 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:35,157 INFO ]: Start difference. First operand 32 states. Second operand 3 states. [2018-06-24 21:24:35,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:35,586 INFO ]: Finished difference Result 46 states and 88 transitions. [2018-06-24 21:24:35,586 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:35,588 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:24:35,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:35,605 INFO ]: With dead ends: 46 [2018-06-24 21:24:35,605 INFO ]: Without dead ends: 45 [2018-06-24 21:24:35,606 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-24 21:24:35,620 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 21:24:35,660 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-06-24 21:24:35,663 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 21:24:35,667 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 62 transitions. [2018-06-24 21:24:35,668 INFO ]: Start accepts. Automaton has 32 states and 62 transitions. Word has length 5 [2018-06-24 21:24:35,669 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:35,669 INFO ]: Abstraction has 32 states and 62 transitions. [2018-06-24 21:24:35,669 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:35,669 INFO ]: Start isEmpty. Operand 32 states and 62 transitions. [2018-06-24 21:24:35,672 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:24:35,672 INFO ]: Found error trace [2018-06-24 21:24:35,673 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:24:35,673 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:35,673 INFO ]: Analyzing trace with hash 43460567, now seen corresponding path program 1 times [2018-06-24 21:24:35,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:35,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:35,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:35,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:35,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:35,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:35,779 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:24:35,779 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:35,779 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:35,781 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:35,781 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:35,781 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:35,781 INFO ]: Start difference. First operand 32 states and 62 transitions. Second operand 3 states. [2018-06-24 21:24:36,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:36,321 INFO ]: Finished difference Result 49 states and 99 transitions. [2018-06-24 21:24:36,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:36,322 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:24:36,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:36,324 INFO ]: With dead ends: 49 [2018-06-24 21:24:36,324 INFO ]: Without dead ends: 49 [2018-06-24 21:24:36,325 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-24 21:24:36,325 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:24:36,336 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-24 21:24:36,336 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:24:36,339 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 99 transitions. [2018-06-24 21:24:36,339 INFO ]: Start accepts. Automaton has 49 states and 99 transitions. Word has length 5 [2018-06-24 21:24:36,339 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:36,339 INFO ]: Abstraction has 49 states and 99 transitions. [2018-06-24 21:24:36,339 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:36,339 INFO ]: Start isEmpty. Operand 49 states and 99 transitions. [2018-06-24 21:24:36,344 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:24:36,344 INFO ]: Found error trace [2018-06-24 21:24:36,344 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:36,344 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:36,344 INFO ]: Analyzing trace with hash 184460100, now seen corresponding path program 1 times [2018-06-24 21:24:36,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:36,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:36,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:36,345 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:36,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:36,369 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:36,465 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:36,465 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:36,465 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:36,465 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:36,465 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:36,465 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:36,465 INFO ]: Start difference. First operand 49 states and 99 transitions. Second operand 3 states. [2018-06-24 21:24:36,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:36,667 INFO ]: Finished difference Result 66 states and 126 transitions. [2018-06-24 21:24:36,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:36,669 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:24:36,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:36,672 INFO ]: With dead ends: 66 [2018-06-24 21:24:36,672 INFO ]: Without dead ends: 66 [2018-06-24 21:24:36,672 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-24 21:24:36,672 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 21:24:36,686 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-24 21:24:36,686 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:24:36,688 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 126 transitions. [2018-06-24 21:24:36,688 INFO ]: Start accepts. Automaton has 66 states and 126 transitions. Word has length 11 [2018-06-24 21:24:36,689 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:36,689 INFO ]: Abstraction has 66 states and 126 transitions. [2018-06-24 21:24:36,690 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:36,691 INFO ]: Start isEmpty. Operand 66 states and 126 transitions. [2018-06-24 21:24:36,694 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:24:36,695 INFO ]: Found error trace [2018-06-24 21:24:36,695 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:36,695 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:36,695 INFO ]: Analyzing trace with hash 644310454, now seen corresponding path program 1 times [2018-06-24 21:24:36,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:36,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:36,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:36,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:36,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:36,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:36,770 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:36,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:36,770 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:36,770 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:36,770 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:36,770 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:36,770 INFO ]: Start difference. First operand 66 states and 126 transitions. Second operand 3 states. [2018-06-24 21:24:37,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:37,033 INFO ]: Finished difference Result 87 states and 171 transitions. [2018-06-24 21:24:37,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:37,033 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:24:37,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:37,037 INFO ]: With dead ends: 87 [2018-06-24 21:24:37,037 INFO ]: Without dead ends: 87 [2018-06-24 21:24:37,037 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-24 21:24:37,038 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-24 21:24:37,049 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-24 21:24:37,049 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 21:24:37,052 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 171 transitions. [2018-06-24 21:24:37,052 INFO ]: Start accepts. Automaton has 87 states and 171 transitions. Word has length 11 [2018-06-24 21:24:37,053 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:37,053 INFO ]: Abstraction has 87 states and 171 transitions. [2018-06-24 21:24:37,053 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:37,053 INFO ]: Start isEmpty. Operand 87 states and 171 transitions. [2018-06-24 21:24:37,056 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:24:37,056 INFO ]: Found error trace [2018-06-24 21:24:37,056 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:37,056 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:37,056 INFO ]: Analyzing trace with hash -495675118, now seen corresponding path program 1 times [2018-06-24 21:24:37,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:37,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:37,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:37,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:37,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:37,101 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:37,265 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:37,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:37,265 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-24 21:24:37,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:37,347 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:37,356 INFO ]: Computing forward predicates... [2018-06-24 21:24:37,488 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:24:37,512 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:37,512 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-06-24 21:24:37,512 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:24:37,513 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:24:37,513 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:24:37,513 INFO ]: Start difference. First operand 87 states and 171 transitions. Second operand 7 states. [2018-06-24 21:24:39,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:39,288 INFO ]: Finished difference Result 288 states and 655 transitions. [2018-06-24 21:24:39,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:24:39,288 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-24 21:24:39,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:39,306 INFO ]: With dead ends: 288 [2018-06-24 21:24:39,306 INFO ]: Without dead ends: 259 [2018-06-24 21:24:39,307 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:24:39,307 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-24 21:24:39,371 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 115. [2018-06-24 21:24:39,371 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-24 21:24:39,375 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 238 transitions. [2018-06-24 21:24:39,375 INFO ]: Start accepts. Automaton has 115 states and 238 transitions. Word has length 12 [2018-06-24 21:24:39,375 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:39,375 INFO ]: Abstraction has 115 states and 238 transitions. [2018-06-24 21:24:39,375 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:24:39,375 INFO ]: Start isEmpty. Operand 115 states and 238 transitions. [2018-06-24 21:24:39,382 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:24:39,383 INFO ]: Found error trace [2018-06-24 21:24:39,383 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:39,383 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:39,383 INFO ]: Analyzing trace with hash -1554468453, now seen corresponding path program 1 times [2018-06-24 21:24:39,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:39,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:39,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:39,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:39,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:39,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:39,509 INFO ]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:24:39,509 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:39,509 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:24:39,509 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:24:39,509 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:24:39,509 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:24:39,510 INFO ]: Start difference. First operand 115 states and 238 transitions. Second operand 4 states. [2018-06-24 21:24:39,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:39,671 INFO ]: Finished difference Result 149 states and 382 transitions. [2018-06-24 21:24:39,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:24:39,672 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-24 21:24:39,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:39,677 INFO ]: With dead ends: 149 [2018-06-24 21:24:39,677 INFO ]: Without dead ends: 149 [2018-06-24 21:24:39,678 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:24:39,678 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-24 21:24:39,701 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 108. [2018-06-24 21:24:39,701 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-24 21:24:39,704 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 226 transitions. [2018-06-24 21:24:39,704 INFO ]: Start accepts. Automaton has 108 states and 226 transitions. Word has length 17 [2018-06-24 21:24:39,704 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:39,704 INFO ]: Abstraction has 108 states and 226 transitions. [2018-06-24 21:24:39,704 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:24:39,704 INFO ]: Start isEmpty. Operand 108 states and 226 transitions. [2018-06-24 21:24:39,711 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:24:39,712 INFO ]: Found error trace [2018-06-24 21:24:39,712 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:39,712 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:39,712 INFO ]: Analyzing trace with hash 1059532282, now seen corresponding path program 1 times [2018-06-24 21:24:39,712 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:39,712 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:39,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:39,713 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:39,713 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:39,735 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:39,776 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:24:39,776 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:24:39,776 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:24:39,777 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:24:39,777 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:24:39,777 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:24:39,777 INFO ]: Start difference. First operand 108 states and 226 transitions. Second operand 3 states. [2018-06-24 21:24:39,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:39,958 INFO ]: Finished difference Result 125 states and 260 transitions. [2018-06-24 21:24:39,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:24:39,958 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-24 21:24:39,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:39,961 INFO ]: With dead ends: 125 [2018-06-24 21:24:39,961 INFO ]: Without dead ends: 125 [2018-06-24 21:24:39,961 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-24 21:24:39,961 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-24 21:24:39,975 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-06-24 21:24:39,975 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-24 21:24:39,978 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 260 transitions. [2018-06-24 21:24:39,978 INFO ]: Start accepts. Automaton has 125 states and 260 transitions. Word has length 17 [2018-06-24 21:24:39,978 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:39,978 INFO ]: Abstraction has 125 states and 260 transitions. [2018-06-24 21:24:39,978 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:24:39,978 INFO ]: Start isEmpty. Operand 125 states and 260 transitions. [2018-06-24 21:24:39,985 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:24:39,985 INFO ]: Found error trace [2018-06-24 21:24:39,985 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:39,986 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:39,986 INFO ]: Analyzing trace with hash -1861835300, now seen corresponding path program 1 times [2018-06-24 21:24:39,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:39,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:39,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:39,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:39,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:40,011 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:40,173 INFO ]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 21:24:40,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:40,173 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-24 21:24:40,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:40,284 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:40,289 INFO ]: Computing forward predicates... [2018-06-24 21:24:40,324 INFO ]: Checked inductivity of 35 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:24:40,359 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:24:40,360 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-06-24 21:24:40,360 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:24:40,360 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:24:40,360 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:24:40,360 INFO ]: Start difference. First operand 125 states and 260 transitions. Second operand 8 states. [2018-06-24 21:24:42,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:42,050 INFO ]: Finished difference Result 381 states and 1120 transitions. [2018-06-24 21:24:42,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:24:42,051 INFO ]: Start accepts. Automaton has 8 states. Word has length 27 [2018-06-24 21:24:42,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:42,066 INFO ]: With dead ends: 381 [2018-06-24 21:24:42,066 INFO ]: Without dead ends: 360 [2018-06-24 21:24:42,066 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:24:42,067 INFO ]: Start minimizeSevpa. Operand 360 states. [2018-06-24 21:24:42,111 INFO ]: Finished minimizeSevpa. Reduced states from 360 to 215. [2018-06-24 21:24:42,112 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-24 21:24:42,116 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 461 transitions. [2018-06-24 21:24:42,116 INFO ]: Start accepts. Automaton has 215 states and 461 transitions. Word has length 27 [2018-06-24 21:24:42,116 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:42,116 INFO ]: Abstraction has 215 states and 461 transitions. [2018-06-24 21:24:42,116 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:24:42,116 INFO ]: Start isEmpty. Operand 215 states and 461 transitions. [2018-06-24 21:24:42,131 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 21:24:42,131 INFO ]: Found error trace [2018-06-24 21:24:42,131 INFO ]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:42,131 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:42,131 INFO ]: Analyzing trace with hash -86415890, now seen corresponding path program 1 times [2018-06-24 21:24:42,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:42,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:42,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:42,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:42,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:42,168 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:42,284 INFO ]: Checked inductivity of 88 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-24 21:24:42,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:42,284 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:24:42,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:42,456 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:42,463 INFO ]: Computing forward predicates... [2018-06-24 21:24:42,729 INFO ]: Checked inductivity of 88 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 21:24:42,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:42,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 21:24:42,751 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:24:42,751 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:24:42,751 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:24:42,751 INFO ]: Start difference. First operand 215 states and 461 transitions. Second operand 15 states. [2018-06-24 21:24:45,927 WARN ]: Spent 147.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-06-24 21:24:47,733 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:24:49,289 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:24:51,439 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:24:54,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:54,377 INFO ]: Finished difference Result 1143 states and 4414 transitions. [2018-06-24 21:24:54,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-06-24 21:24:54,377 INFO ]: Start accepts. Automaton has 15 states. Word has length 40 [2018-06-24 21:24:54,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:54,478 INFO ]: With dead ends: 1143 [2018-06-24 21:24:54,478 INFO ]: Without dead ends: 1143 [2018-06-24 21:24:54,486 INFO ]: 0 DeclaredPredicates, 246 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13910 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3195, Invalid=30845, Unknown=0, NotChecked=0, Total=34040 [2018-06-24 21:24:54,487 INFO ]: Start minimizeSevpa. Operand 1143 states. [2018-06-24 21:24:54,780 INFO ]: Finished minimizeSevpa. Reduced states from 1143 to 384. [2018-06-24 21:24:54,780 INFO ]: Start removeUnreachable. Operand 384 states. [2018-06-24 21:24:54,791 INFO ]: Finished removeUnreachable. Reduced from 384 states to 384 states and 878 transitions. [2018-06-24 21:24:54,791 INFO ]: Start accepts. Automaton has 384 states and 878 transitions. Word has length 40 [2018-06-24 21:24:54,791 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:54,791 INFO ]: Abstraction has 384 states and 878 transitions. [2018-06-24 21:24:54,791 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:24:54,791 INFO ]: Start isEmpty. Operand 384 states and 878 transitions. [2018-06-24 21:24:54,821 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 21:24:54,821 INFO ]: Found error trace [2018-06-24 21:24:54,821 INFO ]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:54,821 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:54,821 INFO ]: Analyzing trace with hash -1911995977, now seen corresponding path program 1 times [2018-06-24 21:24:54,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:54,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:54,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:54,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:54,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:54,843 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:55,033 INFO ]: Checked inductivity of 59 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 21:24:55,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:24:55,033 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:24:55,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:24:55,220 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:24:55,225 INFO ]: Computing forward predicates... [2018-06-24 21:24:55,308 INFO ]: Checked inductivity of 59 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 21:24:55,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:24:55,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-24 21:24:55,343 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:24:55,343 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:24:55,343 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:24:55,344 INFO ]: Start difference. First operand 384 states and 878 transitions. Second operand 12 states. [2018-06-24 21:24:59,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:24:59,480 INFO ]: Finished difference Result 1135 states and 4260 transitions. [2018-06-24 21:24:59,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-24 21:24:59,481 INFO ]: Start accepts. Automaton has 12 states. Word has length 34 [2018-06-24 21:24:59,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:24:59,575 INFO ]: With dead ends: 1135 [2018-06-24 21:24:59,575 INFO ]: Without dead ends: 1135 [2018-06-24 21:24:59,576 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=1667, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 21:24:59,577 INFO ]: Start minimizeSevpa. Operand 1135 states. [2018-06-24 21:24:59,773 INFO ]: Finished minimizeSevpa. Reduced states from 1135 to 415. [2018-06-24 21:24:59,774 INFO ]: Start removeUnreachable. Operand 415 states. [2018-06-24 21:24:59,782 INFO ]: Finished removeUnreachable. Reduced from 415 states to 415 states and 935 transitions. [2018-06-24 21:24:59,782 INFO ]: Start accepts. Automaton has 415 states and 935 transitions. Word has length 34 [2018-06-24 21:24:59,784 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:24:59,784 INFO ]: Abstraction has 415 states and 935 transitions. [2018-06-24 21:24:59,784 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:24:59,784 INFO ]: Start isEmpty. Operand 415 states and 935 transitions. [2018-06-24 21:24:59,819 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:24:59,819 INFO ]: Found error trace [2018-06-24 21:24:59,819 INFO ]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:24:59,819 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:24:59,819 INFO ]: Analyzing trace with hash -776366637, now seen corresponding path program 1 times [2018-06-24 21:24:59,819 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:24:59,819 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:24:59,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:59,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:24:59,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:24:59,862 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:00,542 INFO ]: Checked inductivity of 116 backedges. 59 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 21:25:00,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:00,542 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) [2018-06-24 21:25:00,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:25:00,723 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:00,731 INFO ]: Computing forward predicates... [2018-06-24 21:25:00,888 INFO ]: Checked inductivity of 116 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 21:25:00,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:00,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 21:25:00,927 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:25:00,928 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:25:00,928 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:25:00,928 INFO ]: Start difference. First operand 415 states and 935 transitions. Second operand 15 states. [2018-06-24 21:25:07,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:07,624 INFO ]: Finished difference Result 1288 states and 5341 transitions. [2018-06-24 21:25:07,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-06-24 21:25:07,624 INFO ]: Start accepts. Automaton has 15 states. Word has length 46 [2018-06-24 21:25:07,624 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:07,700 INFO ]: With dead ends: 1288 [2018-06-24 21:25:07,700 INFO ]: Without dead ends: 1251 [2018-06-24 21:25:07,701 INFO ]: 0 DeclaredPredicates, 184 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=725, Invalid=7285, Unknown=0, NotChecked=0, Total=8010 [2018-06-24 21:25:07,702 INFO ]: Start minimizeSevpa. Operand 1251 states. [2018-06-24 21:25:08,019 INFO ]: Finished minimizeSevpa. Reduced states from 1251 to 425. [2018-06-24 21:25:08,019 INFO ]: Start removeUnreachable. Operand 425 states. [2018-06-24 21:25:08,029 INFO ]: Finished removeUnreachable. Reduced from 425 states to 425 states and 978 transitions. [2018-06-24 21:25:08,029 INFO ]: Start accepts. Automaton has 425 states and 978 transitions. Word has length 46 [2018-06-24 21:25:08,029 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:08,029 INFO ]: Abstraction has 425 states and 978 transitions. [2018-06-24 21:25:08,029 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:25:08,029 INFO ]: Start isEmpty. Operand 425 states and 978 transitions. [2018-06-24 21:25:08,160 INFO ]: Finished isEmpty. Found accepting run of length 68 [2018-06-24 21:25:08,160 INFO ]: Found error trace [2018-06-24 21:25:08,160 INFO ]: trace histogram [12, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:08,160 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:08,161 INFO ]: Analyzing trace with hash -2056737231, now seen corresponding path program 1 times [2018-06-24 21:25:08,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:08,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:08,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:08,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:08,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:08,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:08,936 INFO ]: Checked inductivity of 264 backedges. 81 proven. 16 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-06-24 21:25:08,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:08,936 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-24 21:25:08,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:09,174 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:09,187 INFO ]: Computing forward predicates... [2018-06-24 21:25:09,468 INFO ]: Checked inductivity of 264 backedges. 74 proven. 48 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-06-24 21:25:09,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:09,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:25:09,488 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:25:09,488 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:25:09,488 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:25:09,488 INFO ]: Start difference. First operand 425 states and 978 transitions. Second operand 16 states. [2018-06-24 21:25:20,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:20,793 INFO ]: Finished difference Result 1866 states and 9192 transitions. [2018-06-24 21:25:20,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-06-24 21:25:20,793 INFO ]: Start accepts. Automaton has 16 states. Word has length 67 [2018-06-24 21:25:20,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:20,930 INFO ]: With dead ends: 1866 [2018-06-24 21:25:20,930 INFO ]: Without dead ends: 1866 [2018-06-24 21:25:20,935 INFO ]: 0 DeclaredPredicates, 313 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20019 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3804, Invalid=44376, Unknown=0, NotChecked=0, Total=48180 [2018-06-24 21:25:20,936 INFO ]: Start minimizeSevpa. Operand 1866 states. [2018-06-24 21:25:21,797 INFO ]: Finished minimizeSevpa. Reduced states from 1866 to 559. [2018-06-24 21:25:21,797 INFO ]: Start removeUnreachable. Operand 559 states. [2018-06-24 21:25:21,845 INFO ]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1401 transitions. [2018-06-24 21:25:21,845 INFO ]: Start accepts. Automaton has 559 states and 1401 transitions. Word has length 67 [2018-06-24 21:25:21,846 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:21,846 INFO ]: Abstraction has 559 states and 1401 transitions. [2018-06-24 21:25:21,846 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:25:21,847 INFO ]: Start isEmpty. Operand 559 states and 1401 transitions. [2018-06-24 21:25:21,899 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:25:21,899 INFO ]: Found error trace [2018-06-24 21:25:21,899 INFO ]: trace histogram [8, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:21,899 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:21,901 INFO ]: Analyzing trace with hash 2089552187, now seen corresponding path program 1 times [2018-06-24 21:25:21,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:21,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:21,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:21,902 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:21,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:21,922 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:22,008 INFO ]: Checked inductivity of 127 backedges. 41 proven. 15 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-24 21:25:22,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:22,008 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) [2018-06-24 21:25:22,023 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:25:22,187 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:22,193 INFO ]: Computing forward predicates... [2018-06-24 21:25:22,202 INFO ]: Checked inductivity of 127 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-24 21:25:22,234 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:25:22,234 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 21:25:22,234 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:25:22,235 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:25:22,235 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:25:22,235 INFO ]: Start difference. First operand 559 states and 1401 transitions. Second operand 3 states. [2018-06-24 21:25:22,643 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:22,643 INFO ]: Finished difference Result 577 states and 1441 transitions. [2018-06-24 21:25:22,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:25:22,644 INFO ]: Start accepts. Automaton has 3 states. Word has length 46 [2018-06-24 21:25:22,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:22,654 INFO ]: With dead ends: 577 [2018-06-24 21:25:22,654 INFO ]: Without dead ends: 555 [2018-06-24 21:25:22,654 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 47 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-24 21:25:22,654 INFO ]: Start minimizeSevpa. Operand 555 states. [2018-06-24 21:25:22,700 INFO ]: Finished minimizeSevpa. Reduced states from 555 to 555. [2018-06-24 21:25:22,700 INFO ]: Start removeUnreachable. Operand 555 states. [2018-06-24 21:25:22,714 INFO ]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1388 transitions. [2018-06-24 21:25:22,714 INFO ]: Start accepts. Automaton has 555 states and 1388 transitions. Word has length 46 [2018-06-24 21:25:22,714 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:22,714 INFO ]: Abstraction has 555 states and 1388 transitions. [2018-06-24 21:25:22,714 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:25:22,714 INFO ]: Start isEmpty. Operand 555 states and 1388 transitions. [2018-06-24 21:25:22,730 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-24 21:25:22,730 INFO ]: Found error trace [2018-06-24 21:25:22,731 INFO ]: trace histogram [13, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:22,731 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:22,731 INFO ]: Analyzing trace with hash -1930753266, now seen corresponding path program 2 times [2018-06-24 21:25:22,731 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:22,731 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:22,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:22,732 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:22,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:22,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:22,965 INFO ]: Checked inductivity of 329 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-06-24 21:25:22,965 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:25:22,965 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:25:22,966 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:25:22,966 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:25:22,966 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:25:22,966 INFO ]: Start difference. First operand 555 states and 1388 transitions. Second operand 4 states. [2018-06-24 21:25:23,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:23,056 INFO ]: Finished difference Result 740 states and 2398 transitions. [2018-06-24 21:25:23,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:25:23,056 INFO ]: Start accepts. Automaton has 4 states. Word has length 74 [2018-06-24 21:25:23,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:23,073 INFO ]: With dead ends: 740 [2018-06-24 21:25:23,073 INFO ]: Without dead ends: 740 [2018-06-24 21:25:23,073 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:25:23,074 INFO ]: Start minimizeSevpa. Operand 740 states. [2018-06-24 21:25:23,157 INFO ]: Finished minimizeSevpa. Reduced states from 740 to 545. [2018-06-24 21:25:23,157 INFO ]: Start removeUnreachable. Operand 545 states. [2018-06-24 21:25:23,169 INFO ]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1348 transitions. [2018-06-24 21:25:23,169 INFO ]: Start accepts. Automaton has 545 states and 1348 transitions. Word has length 74 [2018-06-24 21:25:23,170 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:23,170 INFO ]: Abstraction has 545 states and 1348 transitions. [2018-06-24 21:25:23,170 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:25:23,170 INFO ]: Start isEmpty. Operand 545 states and 1348 transitions. [2018-06-24 21:25:23,184 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-24 21:25:23,184 INFO ]: Found error trace [2018-06-24 21:25:23,184 INFO ]: trace histogram [15, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:25:23,184 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:25:23,184 INFO ]: Analyzing trace with hash -671692867, now seen corresponding path program 1 times [2018-06-24 21:25:23,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:25:23,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:25:23,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:23,185 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:25:23,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:25:23,254 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:24,175 INFO ]: Checked inductivity of 453 backedges. 193 proven. 73 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-06-24 21:25:24,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:25:24,175 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-24 21:25:24,183 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:25:24,412 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:25:24,420 INFO ]: Computing forward predicates... [2018-06-24 21:25:24,536 INFO ]: Checked inductivity of 453 backedges. 104 proven. 90 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-06-24 21:25:24,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:25:24,557 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2018-06-24 21:25:24,557 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:25:24,558 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:25:24,558 INFO ]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:25:24,558 INFO ]: Start difference. First operand 545 states and 1348 transitions. Second operand 21 states. [2018-06-24 21:25:27,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:25:27,389 INFO ]: Finished difference Result 952 states and 2174 transitions. [2018-06-24 21:25:27,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-06-24 21:25:27,390 INFO ]: Start accepts. Automaton has 21 states. Word has length 86 [2018-06-24 21:25:27,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:25:27,390 INFO ]: With dead ends: 952 [2018-06-24 21:25:27,390 INFO ]: Without dead ends: 0 [2018-06-24 21:25:27,391 INFO ]: 0 DeclaredPredicates, 207 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2989 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1320, Invalid=8780, Unknown=0, NotChecked=0, Total=10100 [2018-06-24 21:25:27,391 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:25:27,391 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:25:27,391 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:25:27,391 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:25:27,391 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2018-06-24 21:25:27,391 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:25:27,391 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:25:27,392 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:25:27,392 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:25:27,392 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:25:27,394 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:25:27,397 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:25:27 BasicIcfg [2018-06-24 21:25:27,397 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:25:27,398 INFO ]: Toolchain (without parser) took 54473.99 ms. Allocated memory was 306.7 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 245.1 MB in the beginning and 902.2 MB in the end (delta: -657.1 MB). Peak memory consumption was 371.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:27,399 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:25:27,399 INFO ]: ChcToBoogie took 119.51 ms. Allocated memory is still 306.7 MB. Free memory was 245.1 MB in the beginning and 242.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:27,399 INFO ]: Boogie Preprocessor took 65.36 ms. Allocated memory is still 306.7 MB. Free memory was 242.1 MB in the beginning and 240.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:27,399 INFO ]: RCFGBuilder took 949.30 ms. Allocated memory is still 306.7 MB. Free memory was 240.1 MB in the beginning and 206.1 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:27,400 INFO ]: BlockEncodingV2 took 737.64 ms. Allocated memory was 306.7 MB in the beginning and 323.5 MB in the end (delta: 16.8 MB). Free memory was 206.1 MB in the beginning and 280.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:27,400 INFO ]: TraceAbstraction took 52574.57 ms. Allocated memory was 323.5 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 278.6 MB in the beginning and 902.3 MB in the end (delta: -623.7 MB). Peak memory consumption was 387.7 MB. Max. memory is 3.6 GB. [2018-06-24 21:25:27,402 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 48 locations, 77 edges - StatisticsResult: Encoded RCFG 32 locations, 62 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 119.51 ms. Allocated memory is still 306.7 MB. Free memory was 245.1 MB in the beginning and 242.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 65.36 ms. Allocated memory is still 306.7 MB. Free memory was 242.1 MB in the beginning and 240.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 949.30 ms. Allocated memory is still 306.7 MB. Free memory was 240.1 MB in the beginning and 206.1 MB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 737.64 ms. Allocated memory was 306.7 MB in the beginning and 323.5 MB in the end (delta: 16.8 MB). Free memory was 206.1 MB in the beginning and 280.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52574.57 ms. Allocated memory was 323.5 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 278.6 MB in the beginning and 902.3 MB in the end (delta: -623.7 MB). Peak memory consumption was 387.7 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, 32 locations, 1 error locations. SAFE Result, 52.5s OverallTime, 15 OverallIterations, 15 TraceHistogramMax, 42.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3031 SDtfs, 2019 SDslu, 13495 SDs, 0 SdLazy, 38373 SolverSat, 4945 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1201 GetRequests, 522 SyntacticMatches, 1 SemanticMatches, 678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40295 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred 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: 2.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4150 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 78530 SizeOfPredicates, 55 NumberOfNonLiveVariables, 9484 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 2351/2657 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/Ackermann02.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-25-27-415.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann02.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-25-27-415.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann02.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-25-27-415.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann02.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-25-27-415.csv Received shutdown request...