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__digits10_inl.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:42:19,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:42:19,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:42:19,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:42:19,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:42:19,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:42:19,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:42:19,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:42:19,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:42:19,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:42:19,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:42:19,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:42:19,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:42:19,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:42:19,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:42:19,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:42:19,628 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:42:19,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:42:19,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:42:19,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:42:19,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:42:19,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:42:19,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:42:19,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:42:19,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:42:19,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:42:19,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:42:19,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:42:19,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:42:19,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:42:19,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:42:19,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:42:19,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:42:19,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:42:19,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:42:19,660 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:42:19,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:42:19,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:42:19,687 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:42:19,687 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:42:19,688 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:42:19,688 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:42:19,689 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:42:19,689 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:42:19,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:42:19,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:42:19,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:42:19,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:42:19,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:42:19,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:42:19,691 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:42:19,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:42:19,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:42:19,691 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:42:19,692 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:42:19,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:42:19,692 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:42:19,694 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:42:19,694 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:42:19,740 INFO ]: Repository-Root is: /tmp [2018-06-24 21:42:19,757 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:42:19,763 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:42:19,764 INFO ]: Initializing SmtParser... [2018-06-24 21:42:19,764 INFO ]: SmtParser initialized [2018-06-24 21:42:19,765 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-24 21:42:19,766 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:42:19,861 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@69181c1f [2018-06-24 21:42:20,289 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-24 21:42:20,295 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:42:20,303 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:42:20,304 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:42:20,304 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:42:20,304 INFO ]: ChcToBoogie initialized [2018-06-24 21:42:20,307 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,374 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20 Unit [2018-06-24 21:42:20,375 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:42:20,375 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:42:20,375 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:42:20,375 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:42:20,396 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,396 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,404 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,404 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,428 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,431 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,432 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (1/1) ... [2018-06-24 21:42:20,434 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:42:20,435 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:42:20,435 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:42:20,435 INFO ]: RCFGBuilder initialized [2018-06-24 21:42:20,436 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (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:42:20,455 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:42:20,455 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:42:20,455 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:42:20,455 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:42:20,455 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:42:20,455 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:42:21,083 INFO ]: Using library mode [2018-06-24 21:42:21,083 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:21 BoogieIcfgContainer [2018-06-24 21:42:21,083 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:42:21,084 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:42:21,084 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:42:21,085 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:42:21,085 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:21" (1/1) ... [2018-06-24 21:42:21,105 INFO ]: Initial Icfg 10 locations, 38 edges [2018-06-24 21:42:21,107 INFO ]: Using Remove infeasible edges [2018-06-24 21:42:21,107 INFO ]: Using Maximize final states [2018-06-24 21:42:21,108 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:42:21,108 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:42:21,110 INFO ]: Using Remove sink states [2018-06-24 21:42:21,113 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:42:21,113 INFO ]: Using Use SBE [2018-06-24 21:42:21,136 INFO ]: SBE split 0 edges [2018-06-24 21:42:21,141 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:42:21,143 INFO ]: 0 new accepting states [2018-06-24 21:42:21,173 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:42:21,175 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:21,179 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:42:21,179 INFO ]: 0 new accepting states [2018-06-24 21:42:21,179 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:42:21,180 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:42:21,184 INFO ]: Encoded RCFG 6 locations, 34 edges [2018-06-24 21:42:21,184 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:21 BasicIcfg [2018-06-24 21:42:21,184 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:42:21,185 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:42:21,185 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:42:21,189 INFO ]: TraceAbstraction initialized [2018-06-24 21:42:21,190 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:42:20" (1/4) ... [2018-06-24 21:42:21,190 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f700cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:42:21, skipping insertion in model container [2018-06-24 21:42:21,190 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:42:20" (2/4) ... [2018-06-24 21:42:21,191 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f700cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:42:21, skipping insertion in model container [2018-06-24 21:42:21,191 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:42:21" (3/4) ... [2018-06-24 21:42:21,191 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f700cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:21, skipping insertion in model container [2018-06-24 21:42:21,191 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:42:21" (4/4) ... [2018-06-24 21:42:21,194 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:42:21,206 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:42:21,214 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:42:21,246 INFO ]: Using default assertion order modulation [2018-06-24 21:42:21,247 INFO ]: Interprodecural is true [2018-06-24 21:42:21,247 INFO ]: Hoare is false [2018-06-24 21:42:21,247 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:42:21,247 INFO ]: Backedges is TWOTRACK [2018-06-24 21:42:21,247 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:42:21,247 INFO ]: Difference is false [2018-06-24 21:42:21,247 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:42:21,247 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:42:21,256 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:42:21,265 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:42:21,265 INFO ]: Found error trace [2018-06-24 21:42:21,266 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:42:21,266 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:21,271 INFO ]: Analyzing trace with hash 34417442, now seen corresponding path program 1 times [2018-06-24 21:42:21,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:21,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:21,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:21,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:21,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:21,356 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:21,409 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:42:21,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:21,411 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:21,412 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:21,422 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:21,423 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:21,424 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:42:21,987 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:21,987 INFO ]: Finished difference Result 7 states and 63 transitions. [2018-06-24 21:42:21,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:21,988 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:42:21,989 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:21,997 INFO ]: With dead ends: 7 [2018-06-24 21:42:21,997 INFO ]: Without dead ends: 7 [2018-06-24 21:42:21,999 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:42:22,011 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:42:22,030 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:42:22,031 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:42:22,033 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-06-24 21:42:22,034 INFO ]: Start accepts. Automaton has 7 states and 63 transitions. Word has length 5 [2018-06-24 21:42:22,035 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:22,035 INFO ]: Abstraction has 7 states and 63 transitions. [2018-06-24 21:42:22,035 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:22,036 INFO ]: Start isEmpty. Operand 7 states and 63 transitions. [2018-06-24 21:42:22,036 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:22,036 INFO ]: Found error trace [2018-06-24 21:42:22,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:22,036 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:22,036 INFO ]: Analyzing trace with hash 1065960608, now seen corresponding path program 1 times [2018-06-24 21:42:22,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:22,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:22,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:22,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:22,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:22,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:22,229 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:22,229 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:22,229 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) [2018-06-24 21:42:22,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:42:22,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:22,318 INFO ]: Computing forward predicates... [2018-06-24 21:42:22,419 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:22,455 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:42:22,455 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-24 21:42:22,455 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:42:22,456 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:42:22,456 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:42:22,456 INFO ]: Start difference. First operand 7 states and 63 transitions. Second operand 5 states. [2018-06-24 21:42:23,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:23,963 INFO ]: Finished difference Result 15 states and 246 transitions. [2018-06-24 21:42:23,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:42:23,964 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:42:23,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:23,967 INFO ]: With dead ends: 15 [2018-06-24 21:42:23,967 INFO ]: Without dead ends: 15 [2018-06-24 21:42:23,968 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:42:23,968 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:42:23,972 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-24 21:42:23,972 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:42:23,973 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2018-06-24 21:42:23,973 INFO ]: Start accepts. Automaton has 9 states and 112 transitions. Word has length 6 [2018-06-24 21:42:23,973 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:23,973 INFO ]: Abstraction has 9 states and 112 transitions. [2018-06-24 21:42:23,973 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:42:23,973 INFO ]: Start isEmpty. Operand 9 states and 112 transitions. [2018-06-24 21:42:23,974 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:23,974 INFO ]: Found error trace [2018-06-24 21:42:23,974 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:23,974 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:23,974 INFO ]: Analyzing trace with hash 1065990399, now seen corresponding path program 1 times [2018-06-24 21:42:23,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:23,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:23,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:23,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:23,975 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:23,986 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:24,024 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:24,024 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:24,024 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:24,024 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:24,024 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:24,024 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:24,024 INFO ]: Start difference. First operand 9 states and 112 transitions. Second operand 3 states. [2018-06-24 21:42:24,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:24,135 INFO ]: Finished difference Result 11 states and 138 transitions. [2018-06-24 21:42:24,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:24,136 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:42:24,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:24,136 INFO ]: With dead ends: 11 [2018-06-24 21:42:24,136 INFO ]: Without dead ends: 9 [2018-06-24 21:42:24,137 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:42:24,137 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:42:24,139 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:42:24,139 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:42:24,140 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-06-24 21:42:24,140 INFO ]: Start accepts. Automaton has 9 states and 106 transitions. Word has length 6 [2018-06-24 21:42:24,140 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:24,140 INFO ]: Abstraction has 9 states and 106 transitions. [2018-06-24 21:42:24,140 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:24,140 INFO ]: Start isEmpty. Operand 9 states and 106 transitions. [2018-06-24 21:42:24,141 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:24,141 INFO ]: Found error trace [2018-06-24 21:42:24,141 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:24,141 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:24,141 INFO ]: Analyzing trace with hash 1066020190, now seen corresponding path program 1 times [2018-06-24 21:42:24,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:24,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:24,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:24,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:24,209 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:24,209 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:24,209 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:24,210 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:24,210 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:24,210 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:24,210 INFO ]: Start difference. First operand 9 states and 106 transitions. Second operand 3 states. [2018-06-24 21:42:24,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:24,345 INFO ]: Finished difference Result 11 states and 128 transitions. [2018-06-24 21:42:24,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:24,345 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:42:24,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:24,346 INFO ]: With dead ends: 11 [2018-06-24 21:42:24,346 INFO ]: Without dead ends: 9 [2018-06-24 21:42:24,346 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:42:24,346 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:42:24,348 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:42:24,349 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:42:24,350 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-06-24 21:42:24,350 INFO ]: Start accepts. Automaton has 9 states and 80 transitions. Word has length 6 [2018-06-24 21:42:24,350 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:24,350 INFO ]: Abstraction has 9 states and 80 transitions. [2018-06-24 21:42:24,350 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:24,350 INFO ]: Start isEmpty. Operand 9 states and 80 transitions. [2018-06-24 21:42:24,350 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:42:24,350 INFO ]: Found error trace [2018-06-24 21:42:24,350 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:42:24,350 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:24,350 INFO ]: Analyzing trace with hash 1066139354, now seen corresponding path program 1 times [2018-06-24 21:42:24,350 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:24,350 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:24,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:24,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:24,391 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:24,391 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:42:24,391 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:42:24,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:24,409 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:24,410 INFO ]: Computing forward predicates... [2018-06-24 21:42:24,412 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:24,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:42:24,432 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:42:24,432 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:42:24,432 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:42:24,432 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:24,432 INFO ]: Start difference. First operand 9 states and 80 transitions. Second operand 4 states. [2018-06-24 21:42:24,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:24,691 INFO ]: Finished difference Result 14 states and 173 transitions. [2018-06-24 21:42:24,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:42:24,691 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:42:24,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:24,692 INFO ]: With dead ends: 14 [2018-06-24 21:42:24,692 INFO ]: Without dead ends: 14 [2018-06-24 21:42:24,692 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:42:24,692 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 21:42:24,695 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 21:42:24,695 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:42:24,696 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2018-06-24 21:42:24,696 INFO ]: Start accepts. Automaton has 11 states and 117 transitions. Word has length 6 [2018-06-24 21:42:24,696 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:24,696 INFO ]: Abstraction has 11 states and 117 transitions. [2018-06-24 21:42:24,696 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:42:24,696 INFO ]: Start isEmpty. Operand 11 states and 117 transitions. [2018-06-24 21:42:24,697 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:24,697 INFO ]: Found error trace [2018-06-24 21:42:24,697 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:24,697 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:24,697 INFO ]: Analyzing trace with hash -1290706637, now seen corresponding path program 1 times [2018-06-24 21:42:24,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:24,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:24,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:24,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,707 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:24,731 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:24,732 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:24,732 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:24,732 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:24,732 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:24,732 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:24,732 INFO ]: Start difference. First operand 11 states and 117 transitions. Second operand 3 states. [2018-06-24 21:42:24,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:24,809 INFO ]: Finished difference Result 16 states and 146 transitions. [2018-06-24 21:42:24,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:24,809 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:24,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:24,809 INFO ]: With dead ends: 16 [2018-06-24 21:42:24,809 INFO ]: Without dead ends: 12 [2018-06-24 21:42:24,810 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:24,810 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:42:24,812 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 21:42:24,812 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:42:24,813 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2018-06-24 21:42:24,813 INFO ]: Start accepts. Automaton has 11 states and 77 transitions. Word has length 7 [2018-06-24 21:42:24,813 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:24,813 INFO ]: Abstraction has 11 states and 77 transitions. [2018-06-24 21:42:24,813 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:24,813 INFO ]: Start isEmpty. Operand 11 states and 77 transitions. [2018-06-24 21:42:24,813 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:24,813 INFO ]: Found error trace [2018-06-24 21:42:24,813 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:24,813 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:24,813 INFO ]: Analyzing trace with hash -1288859595, now seen corresponding path program 1 times [2018-06-24 21:42:24,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:24,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:24,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:24,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:24,823 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:24,880 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:24,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:24,880 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:24,880 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:24,880 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:24,880 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:24,880 INFO ]: Start difference. First operand 11 states and 77 transitions. Second operand 3 states. [2018-06-24 21:42:25,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:25,070 INFO ]: Finished difference Result 16 states and 112 transitions. [2018-06-24 21:42:25,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:25,071 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:25,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:25,072 INFO ]: With dead ends: 16 [2018-06-24 21:42:25,072 INFO ]: Without dead ends: 16 [2018-06-24 21:42:25,072 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:42:25,072 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:42:25,074 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 21:42:25,074 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:42:25,075 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 95 transitions. [2018-06-24 21:42:25,078 INFO ]: Start accepts. Automaton has 13 states and 95 transitions. Word has length 7 [2018-06-24 21:42:25,078 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:25,078 INFO ]: Abstraction has 13 states and 95 transitions. [2018-06-24 21:42:25,078 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:25,078 INFO ]: Start isEmpty. Operand 13 states and 95 transitions. [2018-06-24 21:42:25,078 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:25,078 INFO ]: Found error trace [2018-06-24 21:42:25,078 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:25,079 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:25,079 INFO ]: Analyzing trace with hash -1288442521, now seen corresponding path program 1 times [2018-06-24 21:42:25,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:25,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:25,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:25,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:25,191 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:25,191 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:25,192 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:25,192 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:25,192 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:25,192 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:25,192 INFO ]: Start difference. First operand 13 states and 95 transitions. Second operand 3 states. [2018-06-24 21:42:25,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:25,245 INFO ]: Finished difference Result 13 states and 38 transitions. [2018-06-24 21:42:25,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:25,245 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:25,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:25,246 INFO ]: With dead ends: 13 [2018-06-24 21:42:25,246 INFO ]: Without dead ends: 10 [2018-06-24 21:42:25,246 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:42:25,246 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:42:25,247 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:42:25,247 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:42:25,247 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-06-24 21:42:25,247 INFO ]: Start accepts. Automaton has 8 states and 18 transitions. Word has length 7 [2018-06-24 21:42:25,247 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:25,247 INFO ]: Abstraction has 8 states and 18 transitions. [2018-06-24 21:42:25,247 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:25,247 INFO ]: Start isEmpty. Operand 8 states and 18 transitions. [2018-06-24 21:42:25,247 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:25,248 INFO ]: Found error trace [2018-06-24 21:42:25,248 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:25,248 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:25,248 INFO ]: Analyzing trace with hash -1302712410, now seen corresponding path program 1 times [2018-06-24 21:42:25,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:25,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:25,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:25,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:25,291 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:25,291 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:25,291 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:25,291 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:25,291 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:25,291 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:25,291 INFO ]: Start difference. First operand 8 states and 18 transitions. Second operand 3 states. [2018-06-24 21:42:25,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:25,341 INFO ]: Finished difference Result 11 states and 22 transitions. [2018-06-24 21:42:25,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:25,341 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:25,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:25,342 INFO ]: With dead ends: 11 [2018-06-24 21:42:25,342 INFO ]: Without dead ends: 10 [2018-06-24 21:42:25,342 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:42:25,342 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:42:25,343 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:42:25,343 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:42:25,343 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-24 21:42:25,343 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 7 [2018-06-24 21:42:25,343 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:25,343 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-24 21:42:25,343 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:25,344 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-24 21:42:25,344 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:25,344 INFO ]: Found error trace [2018-06-24 21:42:25,344 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:25,344 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:25,344 INFO ]: Analyzing trace with hash -1300865368, now seen corresponding path program 1 times [2018-06-24 21:42:25,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:25,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:25,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,345 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:25,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,352 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:25,411 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:25,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:25,411 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:25,412 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:25,412 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:25,412 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:25,412 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 3 states. [2018-06-24 21:42:25,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:25,485 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-24 21:42:25,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:25,485 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:25,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:25,486 INFO ]: With dead ends: 11 [2018-06-24 21:42:25,486 INFO ]: Without dead ends: 10 [2018-06-24 21:42:25,486 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:42:25,486 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:42:25,487 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:42:25,487 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:42:25,487 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 21:42:25,487 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-24 21:42:25,487 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:25,487 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 21:42:25,487 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:25,487 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 21:42:25,488 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:42:25,488 INFO ]: Found error trace [2018-06-24 21:42:25,488 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:42:25,488 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:42:25,488 INFO ]: Analyzing trace with hash -1308253536, now seen corresponding path program 1 times [2018-06-24 21:42:25,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:42:25,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:42:25,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:42:25,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:42:25,495 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:42:25,514 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:42:25,514 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:42:25,514 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:42:25,514 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:42:25,514 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:42:25,514 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:42:25,515 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2018-06-24 21:42:25,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:42:25,538 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-24 21:42:25,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:42:25,538 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:42:25,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:42:25,538 INFO ]: With dead ends: 4 [2018-06-24 21:42:25,538 INFO ]: Without dead ends: 0 [2018-06-24 21:42:25,538 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:42:25,538 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:42:25,538 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:42:25,538 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:42:25,539 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:42:25,539 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-24 21:42:25,539 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:42:25,539 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:42:25,539 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:42:25,539 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:42:25,539 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:42:25,540 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:42:25,541 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:42:25 BasicIcfg [2018-06-24 21:42:25,541 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:42:25,542 INFO ]: Toolchain (without parser) took 5245.89 ms. Allocated memory was 307.8 MB in the beginning and 345.5 MB in the end (delta: 37.7 MB). Free memory was 254.3 MB in the beginning and 297.8 MB in the end (delta: -43.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:25,543 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:25,543 INFO ]: ChcToBoogie took 70.79 ms. Allocated memory is still 307.8 MB. Free memory was 254.3 MB in the beginning and 252.3 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:42:25,544 INFO ]: Boogie Preprocessor took 59.30 ms. Allocated memory is still 307.8 MB. Free memory was 252.3 MB in the beginning and 250.3 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:42:25,544 INFO ]: RCFGBuilder took 648.50 ms. Allocated memory is still 307.8 MB. Free memory was 250.3 MB in the beginning and 226.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:25,545 INFO ]: BlockEncodingV2 took 100.54 ms. Allocated memory is still 307.8 MB. Free memory was 226.4 MB in the beginning and 222.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:42:25,545 INFO ]: TraceAbstraction took 4356.16 ms. Allocated memory was 307.8 MB in the beginning and 345.5 MB in the end (delta: 37.7 MB). Free memory was 222.4 MB in the beginning and 300.5 MB in the end (delta: -78.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:42:25,548 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 38 edges - StatisticsResult: Encoded RCFG 6 locations, 34 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.79 ms. Allocated memory is still 307.8 MB. Free memory was 254.3 MB in the beginning and 252.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.30 ms. Allocated memory is still 307.8 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 648.50 ms. Allocated memory is still 307.8 MB. Free memory was 250.3 MB in the beginning and 226.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 100.54 ms. Allocated memory is still 307.8 MB. Free memory was 226.4 MB in the beginning and 222.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4356.16 ms. Allocated memory was 307.8 MB in the beginning and 345.5 MB in the end (delta: 37.7 MB). Free memory was 222.4 MB in the beginning and 300.5 MB in the end (delta: -78.1 MB). There was no memory consumed. 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.3s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 6 SDslu, 46 SDs, 0 SdLazy, 501 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=7, 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, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 698 SizeOfPredicates, 5 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 21/24 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__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-42-25-559.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-42-25-559.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-42-25-559.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-42-25-559.csv Received shutdown request...