java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__loop2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:59:24,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:59:24,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:59:24,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:59:24,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:59:24,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:59:24,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:59:24,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:59:24,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:59:24,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:59:24,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:59:24,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:59:24,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:59:24,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:59:24,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:59:24,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:59:24,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:59:24,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:59:24,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:59:24,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:59:24,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:59:24,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:59:24,970 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:59:24,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:59:24,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:59:24,972 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:59:24,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:59:24,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:59:24,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:59:24,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:59:24,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:59:24,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:59:24,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:59:24,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:59:24,984 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:59:24,985 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:59:25,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:59:25,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:59:25,006 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:59:25,006 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:59:25,009 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:59:25,009 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:59:25,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:59:25,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:59:25,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:59:25,010 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:59:25,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:59:25,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:59:25,010 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:59:25,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:59:25,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:59:25,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:59:25,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:59:25,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:59:25,012 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:59:25,014 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:59:25,015 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:59:25,072 INFO ]: Repository-Root is: /tmp [2018-06-22 11:59:25,086 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:59:25,093 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:59:25,094 INFO ]: Initializing SmtParser... [2018-06-22 11:59:25,094 INFO ]: SmtParser initialized [2018-06-22 11:59:25,095 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__loop2.smt2 [2018-06-22 11:59:25,097 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-22 11:59:25,181 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@4b0832ad [2018-06-22 11:59:25,337 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__loop2.smt2 [2018-06-22 11:59:25,340 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:59:25,345 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:59:25,346 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:59:25,346 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:59:25,346 INFO ]: ChcToBoogie initialized [2018-06-22 11:59:25,349 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,395 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25 Unit [2018-06-22 11:59:25,395 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:59:25,395 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:59:25,396 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:59:25,396 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:59:25,418 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,422 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,428 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,428 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,431 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,432 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,433 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (1/1) ... [2018-06-22 11:59:25,435 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:59:25,435 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:59:25,435 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:59:25,435 INFO ]: RCFGBuilder initialized [2018-06-22 11:59:25,436 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (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-22 11:59:25,451 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:59:25,451 INFO ]: Found specification of procedure False [2018-06-22 11:59:25,451 INFO ]: Found implementation of procedure False [2018-06-22 11:59:25,451 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:59:25,451 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:59:25,451 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:59:25,451 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:59:25,451 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:59:25,451 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-22 11:59:25,790 INFO ]: Using library mode [2018-06-22 11:59:25,790 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:25 BoogieIcfgContainer [2018-06-22 11:59:25,790 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:59:25,791 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:59:25,791 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:59:25,794 INFO ]: TraceAbstraction initialized [2018-06-22 11:59:25,795 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:59:25" (1/3) ... [2018-06-22 11:59:25,796 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257336b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:59:25, skipping insertion in model container [2018-06-22 11:59:25,796 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:59:25" (2/3) ... [2018-06-22 11:59:25,796 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257336b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:59:25, skipping insertion in model container [2018-06-22 11:59:25,796 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:59:25" (3/3) ... [2018-06-22 11:59:25,798 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:59:25,806 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:59:25,813 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:59:25,856 INFO ]: Using default assertion order modulation [2018-06-22 11:59:25,857 INFO ]: Interprodecural is true [2018-06-22 11:59:25,857 INFO ]: Hoare is false [2018-06-22 11:59:25,857 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:59:25,857 INFO ]: Backedges is TWOTRACK [2018-06-22 11:59:25,857 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:59:25,857 INFO ]: Difference is false [2018-06-22 11:59:25,857 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:59:25,857 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:59:25,872 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:59:25,898 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:59:25,898 INFO ]: Found error trace [2018-06-22 11:59:25,900 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:25,900 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:25,904 INFO ]: Analyzing trace with hash -1283464881, now seen corresponding path program 1 times [2018-06-22 11:59:25,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:25,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:25,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:25,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:25,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:25,977 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:26,076 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:59:26,078 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:26,078 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:26,080 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:26,093 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:26,094 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:26,095 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:59:26,197 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:26,197 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:59:26,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:26,200 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:59:26,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:26,214 INFO ]: With dead ends: 15 [2018-06-22 11:59:26,214 INFO ]: Without dead ends: 15 [2018-06-22 11:59:26,217 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 11:59:26,236 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:59:26,259 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:59:26,260 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:59:26,261 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:59:26,262 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:59:26,263 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:26,263 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:59:26,263 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:26,263 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:59:26,266 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:26,266 INFO ]: Found error trace [2018-06-22 11:59:26,266 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:26,267 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:26,267 INFO ]: Analyzing trace with hash -176390316, now seen corresponding path program 1 times [2018-06-22 11:59:26,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:26,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:26,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:26,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:26,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:26,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:26,633 WARN ]: Spent 205.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 11:59:26,723 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:26,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:26,723 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:26,724 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:26,725 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:26,725 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:26,725 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 5 states. [2018-06-22 11:59:26,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:26,927 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 11:59:26,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:59:26,927 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:59:26,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:26,929 INFO ]: With dead ends: 19 [2018-06-22 11:59:26,929 INFO ]: Without dead ends: 19 [2018-06-22 11:59:26,929 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:26,930 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:59:26,935 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 11:59:26,935 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:59:26,936 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:59:26,936 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 13 [2018-06-22 11:59:26,936 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:26,936 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:59:26,936 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:26,936 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:59:26,937 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:26,937 INFO ]: Found error trace [2018-06-22 11:59:26,937 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:26,937 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:26,937 INFO ]: Analyzing trace with hash -28614159, now seen corresponding path program 1 times [2018-06-22 11:59:26,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:26,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:26,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:26,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:26,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:26,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:27,063 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:27,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:27,063 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:27,065 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:27,065 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:27,065 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:27,065 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-22 11:59:27,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:27,161 INFO ]: Finished difference Result 21 states and 34 transitions. [2018-06-22 11:59:27,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:27,162 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:27,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:27,163 INFO ]: With dead ends: 21 [2018-06-22 11:59:27,163 INFO ]: Without dead ends: 21 [2018-06-22 11:59:27,163 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 11:59:27,163 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:59:27,172 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:59:27,172 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:59:27,173 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-22 11:59:27,173 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 13 [2018-06-22 11:59:27,173 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:27,173 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-22 11:59:27,173 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:27,173 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-22 11:59:27,174 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:59:27,174 INFO ]: Found error trace [2018-06-22 11:59:27,174 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:27,174 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:27,175 INFO ]: Analyzing trace with hash 68860537, now seen corresponding path program 1 times [2018-06-22 11:59:27,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:27,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:27,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:27,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:27,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:27,184 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:27,229 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:59:27,229 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:27,229 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:59:27,229 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:27,229 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:27,229 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:27,230 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. [2018-06-22 11:59:27,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:27,381 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-22 11:59:27,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:59:27,382 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:59:27,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:27,383 INFO ]: With dead ends: 21 [2018-06-22 11:59:27,383 INFO ]: Without dead ends: 21 [2018-06-22 11:59:27,383 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 11:59:27,384 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:59:27,390 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:59:27,390 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:59:27,391 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-22 11:59:27,391 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 13 [2018-06-22 11:59:27,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:27,391 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-22 11:59:27,391 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:27,391 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-22 11:59:27,392 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:27,392 INFO ]: Found error trace [2018-06-22 11:59:27,392 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:27,392 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:27,393 INFO ]: Analyzing trace with hash 1479111486, now seen corresponding path program 1 times [2018-06-22 11:59:27,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:27,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:27,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:27,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:27,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:27,408 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:27,488 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:27,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:27,488 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-22 11:59:27,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:27,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:27,544 INFO ]: Computing forward predicates... [2018-06-22 11:59:27,805 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:59:27,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:27,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:59:27,825 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:59:27,825 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:59:27,825 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:59:27,825 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 11 states. [2018-06-22 11:59:28,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:28,483 INFO ]: Finished difference Result 29 states and 47 transitions. [2018-06-22 11:59:28,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:59:28,484 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:59:28,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:28,485 INFO ]: With dead ends: 29 [2018-06-22 11:59:28,485 INFO ]: Without dead ends: 29 [2018-06-22 11:59:28,485 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:59:28,486 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:59:28,493 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:59:28,493 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:59:28,494 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-06-22 11:59:28,494 INFO ]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 17 [2018-06-22 11:59:28,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:28,495 INFO ]: Abstraction has 25 states and 40 transitions. [2018-06-22 11:59:28,495 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:59:28,495 INFO ]: Start isEmpty. Operand 25 states and 40 transitions. [2018-06-22 11:59:28,496 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:59:28,496 INFO ]: Found error trace [2018-06-22 11:59:28,496 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:28,496 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:28,496 INFO ]: Analyzing trace with hash 670514358, now seen corresponding path program 1 times [2018-06-22 11:59:28,496 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:28,496 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:28,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:28,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:28,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:28,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:28,564 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:59:28,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:59:28,564 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:59:28,564 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:59:28,564 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:59:28,564 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:28,564 INFO ]: Start difference. First operand 25 states and 40 transitions. Second operand 5 states. [2018-06-22 11:59:28,624 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:28,624 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-22 11:59:28,624 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:59:28,624 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:59:28,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:28,625 INFO ]: With dead ends: 21 [2018-06-22 11:59:28,625 INFO ]: Without dead ends: 20 [2018-06-22 11:59:28,626 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:59:28,626 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:59:28,630 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:59:28,630 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:59:28,630 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-06-22 11:59:28,630 INFO ]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2018-06-22 11:59:28,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:28,631 INFO ]: Abstraction has 18 states and 23 transitions. [2018-06-22 11:59:28,631 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:59:28,631 INFO ]: Start isEmpty. Operand 18 states and 23 transitions. [2018-06-22 11:59:28,631 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:59:28,631 INFO ]: Found error trace [2018-06-22 11:59:28,631 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:59:28,632 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:59:28,632 INFO ]: Analyzing trace with hash 297628803, now seen corresponding path program 2 times [2018-06-22 11:59:28,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:59:28,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:59:28,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:28,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:59:28,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:59:28,647 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:28,702 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:59:28,702 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:59:28,702 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:59:28,714 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:59:28,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:59:28,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:59:28,741 INFO ]: Computing forward predicates... [2018-06-22 11:59:28,755 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:59:28,783 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:59:28,783 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:59:28,784 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:59:28,784 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:59:28,784 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:59:28,784 INFO ]: Start difference. First operand 18 states and 23 transitions. Second operand 4 states. [2018-06-22 11:59:28,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:59:28,836 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-22 11:59:28,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:59:28,837 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:59:28,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:59:28,837 INFO ]: With dead ends: 18 [2018-06-22 11:59:28,837 INFO ]: Without dead ends: 0 [2018-06-22 11:59:28,838 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:59:28,838 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:59:28,838 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:59:28,838 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:59:28,838 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:59:28,838 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:59:28,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:59:28,838 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:59:28,838 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:59:28,838 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:59:28,838 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:59:28,843 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:59:28 BoogieIcfgContainer [2018-06-22 11:59:28,843 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:59:28,844 INFO ]: Toolchain (without parser) took 3503.13 ms. Allocated memory was 305.7 MB in the beginning and 324.5 MB in the end (delta: 18.9 MB). Free memory was 262.2 MB in the beginning and 225.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 55.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:28,845 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:59:28,845 INFO ]: ChcToBoogie took 49.28 ms. Allocated memory is still 305.7 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:28,846 INFO ]: Boogie Preprocessor took 39.16 ms. Allocated memory is still 305.7 MB. Free memory was 260.2 MB in the beginning and 259.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:28,846 INFO ]: RCFGBuilder took 355.25 ms. Allocated memory is still 305.7 MB. Free memory was 259.1 MB in the beginning and 252.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:28,847 INFO ]: TraceAbstraction took 3051.58 ms. Allocated memory was 305.7 MB in the beginning and 324.5 MB in the end (delta: 18.9 MB). Free memory was 251.1 MB in the beginning and 225.7 MB in the end (delta: 25.3 MB). Peak memory consumption was 44.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:59:28,850 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 305.7 MB. Free memory is still 271.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.28 ms. Allocated memory is still 305.7 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.16 ms. Allocated memory is still 305.7 MB. Free memory was 260.2 MB in the beginning and 259.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 355.25 ms. Allocated memory is still 305.7 MB. Free memory was 259.1 MB in the beginning and 252.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3051.58 ms. Allocated memory was 305.7 MB in the beginning and 324.5 MB in the end (delta: 18.9 MB). Free memory was 251.1 MB in the beginning and 225.7 MB in the end (delta: 25.3 MB). Peak memory consumption was 44.2 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 3 procedures, 15 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 109 SDtfs, 23 SDslu, 145 SDs, 0 SdLazy, 259 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 5804 SizeOfPredicates, 8 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 62/74 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__loop2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-59-28-861.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__loop2.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-59-28-861.csv Received shutdown request...