java -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/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/heap__memcpy_a.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 11:42:46,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 11:42:46,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 11:42:46,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 11:42:46,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 11:42:46,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 11:42:46,253 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 11:42:46,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 11:42:46,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 11:42:46,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 11:42:46,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 11:42:46,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 11:42:46,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 11:42:46,265 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 11:42:46,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 11:42:46,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 11:42:46,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 11:42:46,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 11:42:46,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 11:42:46,282 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 11:42:46,283 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 11:42:46,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 11:42:46,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 11:42:46,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 11:42:46,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 11:42:46,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 11:42:46,295 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 11:42:46,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 11:42:46,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 11:42:46,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 11:42:46,302 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 11:42:46,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 11:42:46,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 11:42:46,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 11:42:46,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 11:42:46,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 11:42:46,329 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 11:42:46,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 11:42:46,331 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 11:42:46,331 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 11:42:46,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 11:42:46,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 11:42:46,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 11:42:46,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 11:42:46,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 11:42:46,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 11:42:46,334 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 11:42:46,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 11:42:46,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 11:42:46,334 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 11:42:46,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 11:42:46,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 11:42:46,335 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 11:42:46,339 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 11:42:46,339 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 11:42:46,381 INFO ]: Repository-Root is: /tmp [2018-06-18 11:42:46,412 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 11:42:46,419 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 11:42:46,420 INFO ]: Initializing SmtParser... [2018-06-18 11:42:46,420 INFO ]: SmtParser initialized [2018-06-18 11:42:46,421 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/heap__memcpy_a.array.smt2 [2018-06-18 11:42:46,432 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-18 11:42:46,547 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__memcpy_a.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3412a6a0 [2018-06-18 11:42:46,758 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/heap__memcpy_a.array.smt2 [2018-06-18 11:42:46,763 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 11:42:46,770 INFO ]: Walking toolchain with 4 elements. [2018-06-18 11:42:46,771 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 11:42:46,771 INFO ]: Initializing ChcToBoogie... [2018-06-18 11:42:46,771 INFO ]: ChcToBoogie initialized [2018-06-18 11:42:46,779 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,826 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46 Unit [2018-06-18 11:42:46,826 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 11:42:46,827 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 11:42:46,827 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 11:42:46,827 INFO ]: Boogie Preprocessor initialized [2018-06-18 11:42:46,849 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,849 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,863 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,863 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,866 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,869 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,870 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (1/1) ... [2018-06-18 11:42:46,877 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 11:42:46,878 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 11:42:46,878 INFO ]: Initializing RCFGBuilder... [2018-06-18 11:42:46,878 INFO ]: RCFGBuilder initialized [2018-06-18 11:42:46,879 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (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-18 11:42:46,896 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 11:42:46,896 INFO ]: Found specification of procedure False [2018-06-18 11:42:46,896 INFO ]: Found implementation of procedure False [2018-06-18 11:42:46,897 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-18 11:42:46,897 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-18 11:42:46,897 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-18 11:42:46,897 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 11:42:46,897 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 11:42:46,897 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-18 11:42:47,239 INFO ]: Using library mode [2018-06-18 11:42:47,240 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:42:47 BoogieIcfgContainer [2018-06-18 11:42:47,240 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 11:42:47,242 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 11:42:47,242 INFO ]: Initializing TraceAbstraction... [2018-06-18 11:42:47,255 INFO ]: TraceAbstraction initialized [2018-06-18 11:42:47,255 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:42:46" (1/3) ... [2018-06-18 11:42:47,256 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4580d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 11:42:47, skipping insertion in model container [2018-06-18 11:42:47,256 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:42:46" (2/3) ... [2018-06-18 11:42:47,256 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4580d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 11:42:47, skipping insertion in model container [2018-06-18 11:42:47,257 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:42:47" (3/3) ... [2018-06-18 11:42:47,259 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 11:42:47,278 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 11:42:47,295 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 11:42:47,360 INFO ]: Using default assertion order modulation [2018-06-18 11:42:47,361 INFO ]: Interprodecural is true [2018-06-18 11:42:47,361 INFO ]: Hoare is false [2018-06-18 11:42:47,361 INFO ]: Compute interpolants for FPandBP [2018-06-18 11:42:47,361 INFO ]: Backedges is TWOTRACK [2018-06-18 11:42:47,361 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 11:42:47,361 INFO ]: Difference is false [2018-06-18 11:42:47,361 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 11:42:47,361 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 11:42:47,378 INFO ]: Start isEmpty. Operand 15 states. [2018-06-18 11:42:47,389 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:42:47,389 INFO ]: Found error trace [2018-06-18 11:42:47,390 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:42:47,390 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:42:47,394 INFO ]: Analyzing trace with hash -997173371, now seen corresponding path program 1 times [2018-06-18 11:42:47,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:42:47,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:42:47,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:47,434 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:47,434 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:47,474 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:47,484 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:42:47,562 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:42:47,565 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:42:47,565 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:42:47,567 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:42:47,580 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:42:47,580 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:42:47,582 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-18 11:42:47,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:42:47,713 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-18 11:42:47,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:42:47,716 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:42:47,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:42:47,732 INFO ]: With dead ends: 15 [2018-06-18 11:42:47,732 INFO ]: Without dead ends: 15 [2018-06-18 11:42:47,737 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-18 11:42:47,759 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-18 11:42:47,797 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-18 11:42:47,798 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-18 11:42:47,799 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-18 11:42:47,801 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-18 11:42:47,802 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:42:47,802 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-18 11:42:47,802 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:42:47,802 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-18 11:42:47,804 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:42:47,804 INFO ]: Found error trace [2018-06-18 11:42:47,804 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:42:47,805 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:42:47,805 INFO ]: Analyzing trace with hash 219620007, now seen corresponding path program 1 times [2018-06-18 11:42:47,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:42:47,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:42:47,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:47,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:47,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:47,845 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:47,846 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:42:48,145 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:42:48,145 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:42:48,145 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-18 11:42:48,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:48,185 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:48,195 INFO ]: Computing forward predicates... [2018-06-18 11:42:48,408 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-06-18 11:42:48,409 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:42:48,466 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-06-18 11:42:48,466 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-06-18 11:42:48,495 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:42:48,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:42:48,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-18 11:42:48,519 INFO ]: Interpolant automaton has 8 states [2018-06-18 11:42:48,519 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-18 11:42:48,519 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-18 11:42:48,519 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 8 states. [2018-06-18 11:42:48,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:42:48,986 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-18 11:42:48,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:42:48,987 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-18 11:42:48,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:42:48,988 INFO ]: With dead ends: 19 [2018-06-18 11:42:48,988 INFO ]: Without dead ends: 19 [2018-06-18 11:42:48,989 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-18 11:42:48,989 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 11:42:48,996 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-18 11:42:48,996 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 11:42:48,997 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-18 11:42:48,997 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 13 [2018-06-18 11:42:48,997 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:42:48,997 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-18 11:42:48,997 INFO ]: Interpolant automaton has 8 states. [2018-06-18 11:42:48,998 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-18 11:42:48,999 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:42:48,999 INFO ]: Found error trace [2018-06-18 11:42:48,999 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:42:48,999 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:42:48,999 INFO ]: Analyzing trace with hash 1103148723, now seen corresponding path program 1 times [2018-06-18 11:42:48,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:42:48,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:42:49,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:49,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:49,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:49,030 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:49,031 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:42:49,178 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:42:49,178 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:42:49,178 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:42:49,178 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:42:49,179 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:42:49,179 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:42:49,179 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 4 states. [2018-06-18 11:42:49,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:42:49,387 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-18 11:42:49,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:42:49,388 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-18 11:42:49,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:42:49,389 INFO ]: With dead ends: 19 [2018-06-18 11:42:49,389 INFO ]: Without dead ends: 19 [2018-06-18 11:42:49,389 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:42:49,389 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 11:42:49,396 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-18 11:42:49,396 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 11:42:49,397 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-18 11:42:49,397 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 13 [2018-06-18 11:42:49,397 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:42:49,397 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-18 11:42:49,397 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:42:49,397 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-18 11:42:49,399 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:42:49,399 INFO ]: Found error trace [2018-06-18 11:42:49,400 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:42:49,400 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:42:49,400 INFO ]: Analyzing trace with hash 857897870, now seen corresponding path program 1 times [2018-06-18 11:42:49,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:42:49,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:42:49,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:49,401 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:49,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:49,416 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:49,417 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:42:49,461 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:42:49,461 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:42:49,461 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:42:49,462 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:42:49,462 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:42:49,462 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:42:49,462 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2018-06-18 11:42:49,706 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:42:49,706 INFO ]: Finished difference Result 19 states and 29 transitions. [2018-06-18 11:42:49,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:42:49,707 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-18 11:42:49,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:42:49,708 INFO ]: With dead ends: 19 [2018-06-18 11:42:49,708 INFO ]: Without dead ends: 19 [2018-06-18 11:42:49,708 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-18 11:42:49,709 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 11:42:49,715 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-18 11:42:49,715 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-18 11:42:49,716 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-18 11:42:49,716 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 13 [2018-06-18 11:42:49,716 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:42:49,716 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-18 11:42:49,716 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:42:49,716 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-18 11:42:49,717 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:42:49,717 INFO ]: Found error trace [2018-06-18 11:42:49,717 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:42:49,717 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:42:49,717 INFO ]: Analyzing trace with hash 1815177045, now seen corresponding path program 1 times [2018-06-18 11:42:49,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:42:49,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:42:49,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:49,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:49,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:49,757 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:49,758 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:42:50,095 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:42:50,095 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:42:50,095 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-18 11:42:50,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:50,132 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:50,135 INFO ]: Computing forward predicates... [2018-06-18 11:42:50,519 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:42:50,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:42:50,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-18 11:42:50,556 INFO ]: Interpolant automaton has 12 states [2018-06-18 11:42:50,556 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 11:42:50,556 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:42:50,557 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 12 states. [2018-06-18 11:42:50,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:42:50,913 INFO ]: Finished difference Result 23 states and 37 transitions. [2018-06-18 11:42:50,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:42:50,914 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 11:42:50,914 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:42:50,915 INFO ]: With dead ends: 23 [2018-06-18 11:42:50,915 INFO ]: Without dead ends: 23 [2018-06-18 11:42:50,915 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-06-18 11:42:50,916 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:42:50,922 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-06-18 11:42:50,923 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 11:42:50,923 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-18 11:42:50,923 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 17 [2018-06-18 11:42:50,924 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:42:50,924 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-18 11:42:50,924 INFO ]: Interpolant automaton has 12 states. [2018-06-18 11:42:50,924 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-18 11:42:50,925 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:42:50,925 INFO ]: Found error trace [2018-06-18 11:42:50,925 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:42:50,925 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:42:50,925 INFO ]: Analyzing trace with hash -1015654583, now seen corresponding path program 2 times [2018-06-18 11:42:50,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:42:50,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:42:50,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:50,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:42:50,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:42:50,982 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:50,983 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:42:51,480 WARN ]: Spent 143.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-18 11:42:51,517 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:42:51,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:42:51,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:42:51,539 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:42:51,560 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:42:51,560 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:42:51,563 INFO ]: Computing forward predicates... [2018-06-18 11:42:51,663 INFO ]: detected equality via solver [2018-06-18 11:42:51,709 INFO ]: detected equality via solver [2018-06-18 11:42:51,710 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 57 [2018-06-18 11:42:51,711 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-18 11:42:51,743 INFO ]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:42:51,744 INFO ]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:68 [2018-06-18 11:42:51,786 INFO ]: detected not equals via solver [2018-06-18 11:42:51,792 INFO ]: detected not equals via solver [2018-06-18 11:42:51,811 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 109 [2018-06-18 11:42:51,813 INFO ]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-06-18 11:42:51,857 INFO ]: detected not equals via solver [2018-06-18 11:42:51,862 INFO ]: detected not equals via solver [2018-06-18 11:42:51,881 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 114 [2018-06-18 11:42:51,882 INFO ]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-06-18 11:42:51,888 INFO ]: detected not equals via solver [2018-06-18 11:42:51,889 INFO ]: detected not equals via solver [2018-06-18 11:42:51,890 INFO ]: detected not equals via solver [2018-06-18 11:42:51,891 INFO ]: detected not equals via solver [2018-06-18 11:42:51,891 INFO ]: detected equality via solver [2018-06-18 11:42:51,897 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 113 [2018-06-18 11:42:51,898 INFO ]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-06-18 11:42:51,963 INFO ]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-06-18 11:42:51,963 INFO ]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:139 [2018-06-18 11:42:54,096 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:42:54,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:42:54,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-18 11:42:54,117 INFO ]: Interpolant automaton has 12 states [2018-06-18 11:42:54,117 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-18 11:42:54,117 INFO ]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2018-06-18 11:42:54,117 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 12 states. [2018-06-18 11:42:54,476 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-18 11:42:54,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:42:54,530 INFO ]: Finished difference Result 20 states and 30 transitions. [2018-06-18 11:42:54,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-18 11:42:54,533 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-18 11:42:54,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:42:54,533 INFO ]: With dead ends: 20 [2018-06-18 11:42:54,533 INFO ]: Without dead ends: 0 [2018-06-18 11:42:54,534 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2018-06-18 11:42:54,534 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-18 11:42:54,534 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-18 11:42:54,534 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-18 11:42:54,534 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-18 11:42:54,534 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-18 11:42:54,534 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:42:54,534 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-18 11:42:54,534 INFO ]: Interpolant automaton has 12 states. [2018-06-18 11:42:54,534 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-18 11:42:54,534 INFO ]: Finished isEmpty. No accepting run. [2018-06-18 11:42:54,540 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 11:42:54 BoogieIcfgContainer [2018-06-18 11:42:54,540 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 11:42:54,541 INFO ]: Toolchain (without parser) took 7776.93 ms. Allocated memory was 306.7 MB in the beginning and 345.5 MB in the end (delta: 38.8 MB). Free memory was 261.1 MB in the beginning and 252.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 47.7 MB. Max. memory is 3.6 GB. [2018-06-18 11:42:54,542 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:42:54,542 INFO ]: ChcToBoogie took 55.50 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:42:54,542 INFO ]: Boogie Preprocessor took 50.24 ms. Allocated memory is still 306.7 MB. Free memory is still 259.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:42:54,543 INFO ]: RCFGBuilder took 362.33 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 249.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:42:54,543 INFO ]: TraceAbstraction took 7297.92 ms. Allocated memory was 306.7 MB in the beginning and 345.5 MB in the end (delta: 38.8 MB). Free memory was 249.1 MB in the beginning and 252.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 35.8 MB. Max. memory is 3.6 GB. [2018-06-18 11:42:54,550 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.50 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.24 ms. Allocated memory is still 306.7 MB. Free memory is still 259.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 362.33 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 249.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7297.92 ms. Allocated memory was 306.7 MB in the beginning and 345.5 MB in the end (delta: 38.8 MB). Free memory was 249.1 MB in the beginning and 252.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 35.8 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, 7.1s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 19 SDslu, 207 SDs, 0 SdLazy, 339 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 2 QuantifiedInterpolants, 16036 SizeOfPredicates, 29 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 26/50 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/heap__memcpy_a.array.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_11-42-54-568.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/heap__memcpy_a.array.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_11-42-54-568.csv Received shutdown request...