java -Xss4m -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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:12:59,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:12:59,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:12:59,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:12:59,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:12:59,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:12:59,223 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:12:59,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:12:59,226 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:12:59,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:12:59,228 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:12:59,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:12:59,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:12:59,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:12:59,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:12:59,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:12:59,233 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:12:59,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:12:59,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:12:59,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:12:59,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:12:59,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:12:59,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:12:59,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:12:59,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:12:59,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:12:59,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:12:59,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:12:59,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:12:59,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:12:59,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:12:59,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:12:59,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:12:59,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:12:59,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:12:59,248 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:12:59,261 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:12:59,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:12:59,262 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:12:59,262 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:12:59,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:12:59,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:12:59,263 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:12:59,264 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:12:59,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:12:59,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:12:59,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:12:59,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:12:59,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:12:59,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:12:59,266 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:12:59,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:12:59,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:12:59,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:12:59,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:12:59,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:12:59,268 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:12:59,269 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:12:59,269 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:12:59,309 INFO ]: Repository-Root is: /tmp [2018-06-25 09:12:59,322 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:12:59,326 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:12:59,326 INFO ]: Initializing SmtParser... [2018-06-25 09:12:59,327 INFO ]: SmtParser initialized [2018-06-25 09:12:59,327 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 [2018-06-25 09:12:59,328 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-25 09:12:59,419 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 unknown [2018-06-25 09:12:59,692 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015b-horn.smt2 [2018-06-25 09:12:59,696 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:12:59,702 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:12:59,702 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:12:59,703 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:12:59,703 INFO ]: ChcToBoogie initialized [2018-06-25 09:12:59,706 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,759 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59 Unit [2018-06-25 09:12:59,759 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:12:59,760 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:12:59,760 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:12:59,760 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:12:59,783 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,783 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,789 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,789 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,794 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,796 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,804 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (1/1) ... [2018-06-25 09:12:59,806 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:12:59,806 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:12:59,806 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:12:59,806 INFO ]: RCFGBuilder initialized [2018-06-25 09:12:59,807 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (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-25 09:12:59,830 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:12:59,831 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:12:59,831 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:12:59,831 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:12:59,831 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:12:59,831 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-25 09:13:00,155 INFO ]: Using library mode [2018-06-25 09:13:00,155 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:13:00 BoogieIcfgContainer [2018-06-25 09:13:00,155 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:13:00,157 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:13:00,157 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:13:00,162 INFO ]: TraceAbstraction initialized [2018-06-25 09:13:00,163 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:12:59" (1/3) ... [2018-06-25 09:13:00,163 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e06dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:13:00, skipping insertion in model container [2018-06-25 09:13:00,164 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:12:59" (2/3) ... [2018-06-25 09:13:00,164 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e06dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:13:00, skipping insertion in model container [2018-06-25 09:13:00,164 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:13:00" (3/3) ... [2018-06-25 09:13:00,167 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:13:00,176 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:13:00,184 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:13:00,222 INFO ]: Using default assertion order modulation [2018-06-25 09:13:00,222 INFO ]: Interprodecural is true [2018-06-25 09:13:00,222 INFO ]: Hoare is false [2018-06-25 09:13:00,222 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:13:00,222 INFO ]: Backedges is TWOTRACK [2018-06-25 09:13:00,222 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:13:00,222 INFO ]: Difference is false [2018-06-25 09:13:00,222 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:13:00,223 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:13:00,234 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:13:00,245 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:13:00,245 INFO ]: Found error trace [2018-06-25 09:13:00,246 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:13:00,246 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:00,249 INFO ]: Analyzing trace with hash -1603530992, now seen corresponding path program 1 times [2018-06-25 09:13:00,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:00,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:00,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:00,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,305 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:00,333 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:00,336 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:00,336 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:13:00,338 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:13:00,354 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:13:00,354 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:13:00,357 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:13:00,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:00,374 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-25 09:13:00,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:13:00,375 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:13:00,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:00,381 INFO ]: With dead ends: 10 [2018-06-25 09:13:00,381 INFO ]: Without dead ends: 10 [2018-06-25 09:13:00,383 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:13:00,400 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:13:00,413 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:13:00,415 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:13:00,415 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-25 09:13:00,416 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 6 [2018-06-25 09:13:00,416 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:00,416 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-25 09:13:00,416 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:13:00,417 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-25 09:13:00,417 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:00,417 INFO ]: Found error trace [2018-06-25 09:13:00,417 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:00,417 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:00,417 INFO ]: Analyzing trace with hash 1839942457, now seen corresponding path program 1 times [2018-06-25 09:13:00,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:00,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:00,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:00,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:00,495 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:00,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:00,495 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:00,497 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:00,497 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:00,497 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:00,497 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-25 09:13:00,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:00,675 INFO ]: Finished difference Result 14 states and 27 transitions. [2018-06-25 09:13:00,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:00,676 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:13:00,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:00,678 INFO ]: With dead ends: 14 [2018-06-25 09:13:00,678 INFO ]: Without dead ends: 14 [2018-06-25 09:13:00,678 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:00,679 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:13:00,682 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 09:13:00,682 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:13:00,682 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-06-25 09:13:00,682 INFO ]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 7 [2018-06-25 09:13:00,685 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:00,685 INFO ]: Abstraction has 11 states and 22 transitions. [2018-06-25 09:13:00,685 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:00,685 INFO ]: Start isEmpty. Operand 11 states and 22 transitions. [2018-06-25 09:13:00,685 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:00,685 INFO ]: Found error trace [2018-06-25 09:13:00,685 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:00,685 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:00,686 INFO ]: Analyzing trace with hash 1832554289, now seen corresponding path program 1 times [2018-06-25 09:13:00,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:00,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:00,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:00,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,703 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:00,822 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:00,822 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:00,822 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:00,823 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:00,823 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:00,823 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:00,823 INFO ]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2018-06-25 09:13:00,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:00,940 INFO ]: Finished difference Result 16 states and 34 transitions. [2018-06-25 09:13:00,940 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:00,940 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:13:00,940 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:00,941 INFO ]: With dead ends: 16 [2018-06-25 09:13:00,941 INFO ]: Without dead ends: 16 [2018-06-25 09:13:00,941 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:00,941 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:13:00,943 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 09:13:00,943 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:13:00,944 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-25 09:13:00,944 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 7 [2018-06-25 09:13:00,944 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:00,944 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-25 09:13:00,944 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:00,944 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-25 09:13:00,944 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:00,944 INFO ]: Found error trace [2018-06-25 09:13:00,944 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:00,944 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:00,944 INFO ]: Analyzing trace with hash 1192195993, now seen corresponding path program 1 times [2018-06-25 09:13:00,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:00,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:00,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:00,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:00,953 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:00,989 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:00,989 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:00,989 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:00,989 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:00,989 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:00,989 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:00,990 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 3 states. [2018-06-25 09:13:01,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:01,120 INFO ]: Finished difference Result 15 states and 30 transitions. [2018-06-25 09:13:01,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:01,122 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:13:01,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:01,123 INFO ]: With dead ends: 15 [2018-06-25 09:13:01,123 INFO ]: Without dead ends: 15 [2018-06-25 09:13:01,123 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:01,123 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:13:01,125 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-25 09:13:01,125 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:13:01,125 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-25 09:13:01,125 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 8 [2018-06-25 09:13:01,125 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:01,125 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-25 09:13:01,125 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:01,126 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-25 09:13:01,126 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:01,126 INFO ]: Found error trace [2018-06-25 09:13:01,126 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:01,126 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:01,126 INFO ]: Analyzing trace with hash 1204350721, now seen corresponding path program 1 times [2018-06-25 09:13:01,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:01,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:01,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:01,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:01,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:01,141 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:01,175 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:01,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:01,176 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:01,176 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:01,176 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:01,176 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:01,176 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 3 states. [2018-06-25 09:13:01,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:01,194 INFO ]: Finished difference Result 13 states and 27 transitions. [2018-06-25 09:13:01,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:01,194 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:13:01,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:01,195 INFO ]: With dead ends: 13 [2018-06-25 09:13:01,195 INFO ]: Without dead ends: 13 [2018-06-25 09:13:01,195 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:01,195 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:13:01,197 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:13:01,197 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:13:01,197 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-06-25 09:13:01,198 INFO ]: Start accepts. Automaton has 13 states and 27 transitions. Word has length 8 [2018-06-25 09:13:01,198 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:01,198 INFO ]: Abstraction has 13 states and 27 transitions. [2018-06-25 09:13:01,198 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:01,198 INFO ]: Start isEmpty. Operand 13 states and 27 transitions. [2018-06-25 09:13:01,198 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:01,198 INFO ]: Found error trace [2018-06-25 09:13:01,198 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:01,198 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:01,198 INFO ]: Analyzing trace with hash 963162785, now seen corresponding path program 1 times [2018-06-25 09:13:01,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:01,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:01,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:01,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:01,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:01,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:01,307 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:01,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:01,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:13:01,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:13:01,368 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:01,377 INFO ]: Computing forward predicates... [2018-06-25 09:13:01,534 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:13:01,555 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:13:01,555 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 09:13:01,555 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:13:01,555 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:13:01,555 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:01,556 INFO ]: Start difference. First operand 13 states and 27 transitions. Second operand 5 states. [2018-06-25 09:13:01,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:01,730 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-25 09:13:01,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:13:01,731 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:13:01,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:01,731 INFO ]: With dead ends: 12 [2018-06-25 09:13:01,731 INFO ]: Without dead ends: 12 [2018-06-25 09:13:01,731 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:13:01,733 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:13:01,734 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-25 09:13:01,735 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:13:01,735 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-25 09:13:01,735 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 8 [2018-06-25 09:13:01,735 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:01,735 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-25 09:13:01,735 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:13:01,735 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-25 09:13:01,736 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:13:01,736 INFO ]: Found error trace [2018-06-25 09:13:01,736 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:01,736 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:01,736 INFO ]: Analyzing trace with hash -1317276869, now seen corresponding path program 1 times [2018-06-25 09:13:01,736 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:01,736 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:01,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:01,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:01,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:01,755 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:01,797 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:01,797 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:01,797 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:01,797 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:01,797 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:01,797 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:01,797 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2018-06-25 09:13:01,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:01,807 INFO ]: Finished difference Result 6 states and 9 transitions. [2018-06-25 09:13:01,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:01,807 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:13:01,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:01,807 INFO ]: With dead ends: 6 [2018-06-25 09:13:01,807 INFO ]: Without dead ends: 0 [2018-06-25 09:13:01,808 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:01,808 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:13:01,808 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:13:01,808 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:13:01,808 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:13:01,808 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-25 09:13:01,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:01,808 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:13:01,808 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:01,808 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:13:01,808 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:13:01,812 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:13:01 BoogieIcfgContainer [2018-06-25 09:13:01,812 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:13:01,813 INFO ]: Toolchain (without parser) took 2116.66 ms. Allocated memory is still 308.3 MB. Free memory was 263.7 MB in the beginning and 199.8 MB in the end (delta: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:01,815 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:13:01,815 INFO ]: ChcToBoogie took 57.22 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:01,816 INFO ]: Boogie Preprocessor took 45.63 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:01,816 INFO ]: RCFGBuilder took 349.20 ms. Allocated memory is still 308.3 MB. Free memory was 259.6 MB in the beginning and 248.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:01,817 INFO ]: TraceAbstraction took 1655.61 ms. Allocated memory is still 308.3 MB. Free memory was 248.5 MB in the beginning and 199.8 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:01,820 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 57.22 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.63 ms. Allocated memory is still 308.3 MB. Free memory was 260.6 MB in the beginning and 259.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 349.20 ms. Allocated memory is still 308.3 MB. Free memory was 259.6 MB in the beginning and 248.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1655.61 ms. Allocated memory is still 308.3 MB. Free memory was 248.5 MB in the beginning and 199.8 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 29 SDslu, 67 SDs, 0 SdLazy, 42 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 826 SizeOfPredicates, 4 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 3/4 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/015b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-13-01-832.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/015b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-13-01-832.csv Received shutdown request...