java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:04:37,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:04:37,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:04:37,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:04:37,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:04:37,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:04:37,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:04:37,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:04:37,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:04:37,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:04:37,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:04:37,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:04:37,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:04:37,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:04:37,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:04:37,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:04:37,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:04:37,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:04:37,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:04:37,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:04:37,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:04:37,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:04:37,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:04:37,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:04:37,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:04:37,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:04:37,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:04:37,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:04:37,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:04:37,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:04:37,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:04:37,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:04:37,675 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:04:37,675 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:04:37,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:04:37,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:04:37,676 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:04:37,689 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:04:37,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:04:37,689 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:04:37,690 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:04:37,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:04:37,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:04:37,691 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:04:37,691 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:04:37,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:04:37,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:04:37,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:04:37,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:04:37,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:04:37,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:04:37,692 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:04:37,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:04:37,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:04:37,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:04:37,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:04:37,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:04:37,693 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:04:37,695 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:04:37,695 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:04:37,730 INFO ]: Repository-Root is: /tmp [2018-06-26 18:04:37,745 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:04:37,753 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:04:37,755 INFO ]: Initializing SmtParser... [2018-06-26 18:04:37,755 INFO ]: SmtParser initialized [2018-06-26 18:04:37,756 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-26 18:04:37,757 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-26 18:04:37,841 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 unknown [2018-06-26 18:04:38,110 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-26 18:04:38,115 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:04:38,121 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:04:38,121 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:04:38,121 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:04:38,121 INFO ]: ChcToBoogie initialized [2018-06-26 18:04:38,125 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,197 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38 Unit [2018-06-26 18:04:38,197 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:04:38,198 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:04:38,198 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:04:38,198 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:04:38,224 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,225 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,232 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,233 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,239 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,242 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,244 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,246 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:04:38,246 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:04:38,246 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:04:38,247 INFO ]: RCFGBuilder initialized [2018-06-26 18:04:38,247 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:04:38,264 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:04:38,264 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:04:38,264 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:04:38,264 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:04:38,264 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:04:38,264 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 18:04:38,870 INFO ]: Using library mode [2018-06-26 18:04:38,870 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:04:38 BoogieIcfgContainer [2018-06-26 18:04:38,870 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:04:38,870 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:04:38,871 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:04:38,871 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:04:38,872 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:04:38" (1/1) ... [2018-06-26 18:04:38,885 INFO ]: Initial Icfg 12 locations, 43 edges [2018-06-26 18:04:38,886 INFO ]: Using Remove infeasible edges [2018-06-26 18:04:38,887 INFO ]: Using Maximize final states [2018-06-26 18:04:38,887 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:04:38,888 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:04:38,890 INFO ]: Using Remove sink states [2018-06-26 18:04:38,890 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:04:38,891 INFO ]: Using Use SBE [2018-06-26 18:04:38,897 INFO ]: SBE split 0 edges [2018-06-26 18:04:38,902 INFO ]: Removed 9 edges and 2 locations because of local infeasibility [2018-06-26 18:04:38,904 INFO ]: 0 new accepting states [2018-06-26 18:04:38,990 INFO ]: Removed 15 edges and 2 locations by large block encoding [2018-06-26 18:04:38,992 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:04:38,993 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:04:38,993 INFO ]: 0 new accepting states [2018-06-26 18:04:38,993 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:04:38,994 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:04:38,994 INFO ]: Encoded RCFG 8 locations, 32 edges [2018-06-26 18:04:38,994 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:04:38 BasicIcfg [2018-06-26 18:04:38,994 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:04:38,995 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:04:38,995 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:04:39,000 INFO ]: TraceAbstraction initialized [2018-06-26 18:04:39,000 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:04:38" (1/4) ... [2018-06-26 18:04:39,001 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5239e0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:04:39, skipping insertion in model container [2018-06-26 18:04:39,001 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:04:38" (2/4) ... [2018-06-26 18:04:39,002 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5239e0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:04:39, skipping insertion in model container [2018-06-26 18:04:39,002 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:04:38" (3/4) ... [2018-06-26 18:04:39,002 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5239e0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:04:39, skipping insertion in model container [2018-06-26 18:04:39,002 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:04:38" (4/4) ... [2018-06-26 18:04:39,005 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:04:39,012 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:04:39,027 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:04:39,066 INFO ]: Using default assertion order modulation [2018-06-26 18:04:39,066 INFO ]: Interprodecural is true [2018-06-26 18:04:39,066 INFO ]: Hoare is false [2018-06-26 18:04:39,066 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:04:39,066 INFO ]: Backedges is TWOTRACK [2018-06-26 18:04:39,067 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:04:39,067 INFO ]: Difference is false [2018-06-26 18:04:39,067 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:04:39,067 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:04:39,076 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 18:04:39,085 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:04:39,085 INFO ]: Found error trace [2018-06-26 18:04:39,086 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:04:39,086 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:39,091 INFO ]: Analyzing trace with hash 53045641, now seen corresponding path program 1 times [2018-06-26 18:04:39,093 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:39,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:39,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:39,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:39,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:39,176 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:39,248 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:39,250 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:39,250 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:39,251 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:39,263 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:39,263 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:39,265 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-26 18:04:39,386 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:39,386 INFO ]: Finished difference Result 9 states and 33 transitions. [2018-06-26 18:04:39,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:39,389 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:04:39,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:39,401 INFO ]: With dead ends: 9 [2018-06-26 18:04:39,401 INFO ]: Without dead ends: 9 [2018-06-26 18:04:39,403 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-26 18:04:39,418 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:04:39,440 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:04:39,441 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:04:39,442 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-06-26 18:04:39,443 INFO ]: Start accepts. Automaton has 9 states and 33 transitions. Word has length 5 [2018-06-26 18:04:39,444 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:39,444 INFO ]: Abstraction has 9 states and 33 transitions. [2018-06-26 18:04:39,444 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:39,444 INFO ]: Start isEmpty. Operand 9 states and 33 transitions. [2018-06-26 18:04:39,447 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:04:39,447 INFO ]: Found error trace [2018-06-26 18:04:39,447 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:04:39,447 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:39,447 INFO ]: Analyzing trace with hash 53106184, now seen corresponding path program 1 times [2018-06-26 18:04:39,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:39,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:39,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:39,448 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:39,448 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:39,462 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:39,533 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:39,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:39,533 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:39,534 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:39,534 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:39,534 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:39,535 INFO ]: Start difference. First operand 9 states and 33 transitions. Second operand 3 states. [2018-06-26 18:04:39,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:39,938 INFO ]: Finished difference Result 10 states and 33 transitions. [2018-06-26 18:04:39,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:39,939 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:04:39,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:39,939 INFO ]: With dead ends: 10 [2018-06-26 18:04:39,939 INFO ]: Without dead ends: 9 [2018-06-26 18:04:39,940 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-26 18:04:39,940 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:04:39,942 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:04:39,942 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:04:39,942 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-26 18:04:39,943 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 5 [2018-06-26 18:04:39,943 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:39,943 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-26 18:04:39,943 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:39,943 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-26 18:04:39,943 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:04:39,943 INFO ]: Found error trace [2018-06-26 18:04:39,943 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:04:39,943 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:39,943 INFO ]: Analyzing trace with hash 53135975, now seen corresponding path program 1 times [2018-06-26 18:04:39,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:39,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:39,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:39,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:39,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:39,954 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:39,983 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:39,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:39,983 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:39,983 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:39,983 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:39,983 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:39,984 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 3 states. [2018-06-26 18:04:40,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,133 INFO ]: Finished difference Result 12 states and 32 transitions. [2018-06-26 18:04:40,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,133 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:04:40,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,135 INFO ]: With dead ends: 12 [2018-06-26 18:04:40,135 INFO ]: Without dead ends: 12 [2018-06-26 18:04:40,135 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-26 18:04:40,136 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:04:40,138 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-26 18:04:40,138 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:04:40,138 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-06-26 18:04:40,138 INFO ]: Start accepts. Automaton has 9 states and 26 transitions. Word has length 5 [2018-06-26 18:04:40,138 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,138 INFO ]: Abstraction has 9 states and 26 transitions. [2018-06-26 18:04:40,139 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,139 INFO ]: Start isEmpty. Operand 9 states and 26 transitions. [2018-06-26 18:04:40,139 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:04:40,139 INFO ]: Found error trace [2018-06-26 18:04:40,139 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:04:40,139 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,139 INFO ]: Analyzing trace with hash 53137897, now seen corresponding path program 1 times [2018-06-26 18:04:40,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,146 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,183 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,183 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,183 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,183 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,184 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,184 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,184 INFO ]: Start difference. First operand 9 states and 26 transitions. Second operand 3 states. [2018-06-26 18:04:40,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,245 INFO ]: Finished difference Result 12 states and 29 transitions. [2018-06-26 18:04:40,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,245 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:04:40,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,246 INFO ]: With dead ends: 12 [2018-06-26 18:04:40,246 INFO ]: Without dead ends: 12 [2018-06-26 18:04:40,246 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,246 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:04:40,248 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-26 18:04:40,248 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:04:40,248 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-06-26 18:04:40,248 INFO ]: Start accepts. Automaton has 9 states and 23 transitions. Word has length 5 [2018-06-26 18:04:40,248 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,248 INFO ]: Abstraction has 9 states and 23 transitions. [2018-06-26 18:04:40,248 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,248 INFO ]: Start isEmpty. Operand 9 states and 23 transitions. [2018-06-26 18:04:40,248 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:04:40,248 INFO ]: Found error trace [2018-06-26 18:04:40,248 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:04:40,249 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,249 INFO ]: Analyzing trace with hash 53139819, now seen corresponding path program 1 times [2018-06-26 18:04:40,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,258 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,276 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,276 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,276 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,276 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,276 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,276 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,277 INFO ]: Start difference. First operand 9 states and 23 transitions. Second operand 3 states. [2018-06-26 18:04:40,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,391 INFO ]: Finished difference Result 12 states and 32 transitions. [2018-06-26 18:04:40,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,391 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:04:40,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,392 INFO ]: With dead ends: 12 [2018-06-26 18:04:40,392 INFO ]: Without dead ends: 12 [2018-06-26 18:04:40,392 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-26 18:04:40,392 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:04:40,394 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 18:04:40,394 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:04:40,395 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2018-06-26 18:04:40,395 INFO ]: Start accepts. Automaton has 10 states and 27 transitions. Word has length 5 [2018-06-26 18:04:40,395 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,395 INFO ]: Abstraction has 10 states and 27 transitions. [2018-06-26 18:04:40,395 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,395 INFO ]: Start isEmpty. Operand 10 states and 27 transitions. [2018-06-26 18:04:40,395 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:04:40,395 INFO ]: Found error trace [2018-06-26 18:04:40,395 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:04:40,396 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,396 INFO ]: Analyzing trace with hash 53169610, now seen corresponding path program 1 times [2018-06-26 18:04:40,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,403 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,418 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,418 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,418 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,418 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,418 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,418 INFO ]: Start difference. First operand 10 states and 27 transitions. Second operand 3 states. [2018-06-26 18:04:40,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,467 INFO ]: Finished difference Result 15 states and 39 transitions. [2018-06-26 18:04:40,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,467 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:04:40,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,468 INFO ]: With dead ends: 15 [2018-06-26 18:04:40,468 INFO ]: Without dead ends: 15 [2018-06-26 18:04:40,468 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-26 18:04:40,468 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 18:04:40,470 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-26 18:04:40,470 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:04:40,471 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2018-06-26 18:04:40,471 INFO ]: Start accepts. Automaton has 12 states and 33 transitions. Word has length 5 [2018-06-26 18:04:40,471 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,471 INFO ]: Abstraction has 12 states and 33 transitions. [2018-06-26 18:04:40,471 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,471 INFO ]: Start isEmpty. Operand 12 states and 33 transitions. [2018-06-26 18:04:40,471 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:04:40,471 INFO ]: Found error trace [2018-06-26 18:04:40,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:04:40,471 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,471 INFO ]: Analyzing trace with hash 1643765877, now seen corresponding path program 1 times [2018-06-26 18:04:40,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,478 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,522 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,523 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,523 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,523 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,523 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,523 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,523 INFO ]: Start difference. First operand 12 states and 33 transitions. Second operand 3 states. [2018-06-26 18:04:40,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,551 INFO ]: Finished difference Result 14 states and 34 transitions. [2018-06-26 18:04:40,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,552 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:04:40,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,552 INFO ]: With dead ends: 14 [2018-06-26 18:04:40,552 INFO ]: Without dead ends: 13 [2018-06-26 18:04:40,553 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-26 18:04:40,553 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:04:40,554 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 18:04:40,554 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:04:40,555 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-06-26 18:04:40,555 INFO ]: Start accepts. Automaton has 12 states and 31 transitions. Word has length 6 [2018-06-26 18:04:40,555 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,555 INFO ]: Abstraction has 12 states and 31 transitions. [2018-06-26 18:04:40,555 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,555 INFO ]: Start isEmpty. Operand 12 states and 31 transitions. [2018-06-26 18:04:40,555 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:04:40,555 INFO ]: Found error trace [2018-06-26 18:04:40,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:04:40,555 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,556 INFO ]: Analyzing trace with hash 1646804559, now seen corresponding path program 1 times [2018-06-26 18:04:40,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,567 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,611 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,611 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,611 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:04:40,611 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:04:40,611 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:04:40,611 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:04:40,611 INFO ]: Start difference. First operand 12 states and 31 transitions. Second operand 4 states. [2018-06-26 18:04:40,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,750 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-26 18:04:40,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:04:40,751 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:04:40,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,751 INFO ]: With dead ends: 13 [2018-06-26 18:04:40,751 INFO ]: Without dead ends: 13 [2018-06-26 18:04:40,752 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:04:40,752 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:04:40,753 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 18:04:40,753 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:04:40,754 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-06-26 18:04:40,754 INFO ]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 6 [2018-06-26 18:04:40,754 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,754 INFO ]: Abstraction has 12 states and 29 transitions. [2018-06-26 18:04:40,754 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:04:40,754 INFO ]: Start isEmpty. Operand 12 states and 29 transitions. [2018-06-26 18:04:40,754 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:04:40,754 INFO ]: Found error trace [2018-06-26 18:04:40,754 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:04:40,754 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,755 INFO ]: Analyzing trace with hash 1646808403, now seen corresponding path program 1 times [2018-06-26 18:04:40,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,762 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,786 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,786 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,786 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,786 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,786 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,786 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,786 INFO ]: Start difference. First operand 12 states and 29 transitions. Second operand 3 states. [2018-06-26 18:04:40,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,793 INFO ]: Finished difference Result 12 states and 28 transitions. [2018-06-26 18:04:40,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,793 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:04:40,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,794 INFO ]: With dead ends: 12 [2018-06-26 18:04:40,794 INFO ]: Without dead ends: 10 [2018-06-26 18:04:40,794 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-26 18:04:40,794 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:04:40,795 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-26 18:04:40,795 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:04:40,795 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-26 18:04:40,796 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 6 [2018-06-26 18:04:40,796 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,796 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-26 18:04:40,796 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,796 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-26 18:04:40,796 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:04:40,796 INFO ]: Found error trace [2018-06-26 18:04:40,796 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:04:40,796 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,796 INFO ]: Analyzing trace with hash -509477958, now seen corresponding path program 1 times [2018-06-26 18:04:40,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,812 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,843 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:40,843 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,843 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,843 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,843 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,843 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,843 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 3 states. [2018-06-26 18:04:40,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,870 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-26 18:04:40,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,871 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:04:40,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,871 INFO ]: With dead ends: 10 [2018-06-26 18:04:40,871 INFO ]: Without dead ends: 8 [2018-06-26 18:04:40,871 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-26 18:04:40,872 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 18:04:40,873 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 18:04:40,873 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:04:40,873 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-26 18:04:40,873 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-26 18:04:40,873 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,873 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-26 18:04:40,873 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,873 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-26 18:04:40,873 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:04:40,873 INFO ]: Found error trace [2018-06-26 18:04:40,873 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:04:40,873 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,873 INFO ]: Analyzing trace with hash -479925286, now seen corresponding path program 1 times [2018-06-26 18:04:40,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,882 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:40,939 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:04:40,939 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:40,939 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:04:40,940 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:04:40,940 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:04:40,940 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:04:40,940 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2018-06-26 18:04:40,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:40,993 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-26 18:04:40,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:04:40,993 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 18:04:40,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:40,994 INFO ]: With dead ends: 8 [2018-06-26 18:04:40,994 INFO ]: Without dead ends: 8 [2018-06-26 18:04:40,994 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-26 18:04:40,994 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 18:04:40,995 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 18:04:40,995 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:04:40,995 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-26 18:04:40,995 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-26 18:04:40,995 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:40,995 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-26 18:04:40,995 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:04:40,995 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-26 18:04:40,995 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:04:40,995 INFO ]: Found error trace [2018-06-26 18:04:40,996 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:04:40,996 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:04:40,996 INFO ]: Analyzing trace with hash -479924325, now seen corresponding path program 1 times [2018-06-26 18:04:40,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:04:40,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:04:40,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:40,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:04:40,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:04:41,009 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:04:41,101 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:04:41,101 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:04:41,101 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:04:41,101 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:04:41,101 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:04:41,101 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:04:41,101 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2018-06-26 18:04:41,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:04:41,164 INFO ]: Finished difference Result 4 states and 4 transitions. [2018-06-26 18:04:41,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:04:41,164 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 18:04:41,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:04:41,165 INFO ]: With dead ends: 4 [2018-06-26 18:04:41,165 INFO ]: Without dead ends: 0 [2018-06-26 18:04:41,165 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:04:41,165 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 18:04:41,165 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 18:04:41,165 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 18:04:41,165 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 18:04:41,165 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-26 18:04:41,165 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:04:41,165 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 18:04:41,165 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:04:41,165 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 18:04:41,165 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 18:04:41,167 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:04:41,169 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:04:41 BasicIcfg [2018-06-26 18:04:41,169 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:04:41,170 INFO ]: Toolchain (without parser) took 3054.46 ms. Allocated memory was 302.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Free memory was 253.8 MB in the beginning and 265.5 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 3.6 GB. [2018-06-26 18:04:41,171 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:04:41,171 INFO ]: ChcToBoogie took 76.40 ms. Allocated memory is still 302.5 MB. Free memory was 253.8 MB in the beginning and 250.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:04:41,172 INFO ]: Boogie Preprocessor took 47.91 ms. Allocated memory is still 302.5 MB. Free memory was 250.8 MB in the beginning and 249.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 18:04:41,172 INFO ]: RCFGBuilder took 623.70 ms. Allocated memory is still 302.5 MB. Free memory was 249.9 MB in the beginning and 232.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:04:41,178 INFO ]: BlockEncodingV2 took 123.88 ms. Allocated memory is still 302.5 MB. Free memory was 232.9 MB in the beginning and 226.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:04:41,178 INFO ]: TraceAbstraction took 2173.43 ms. Allocated memory was 302.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Free memory was 226.8 MB in the beginning and 265.5 MB in the end (delta: -38.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:04:41,183 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 43 edges - StatisticsResult: Encoded RCFG 8 locations, 32 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 76.40 ms. Allocated memory is still 302.5 MB. Free memory was 253.8 MB in the beginning and 250.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.91 ms. Allocated memory is still 302.5 MB. Free memory was 250.8 MB in the beginning and 249.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 623.70 ms. Allocated memory is still 302.5 MB. Free memory was 249.9 MB in the beginning and 232.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 123.88 ms. Allocated memory is still 302.5 MB. Free memory was 232.9 MB in the beginning and 226.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2173.43 ms. Allocated memory was 302.5 MB in the beginning and 324.5 MB in the end (delta: 22.0 MB). Free memory was 226.8 MB in the beginning and 265.5 MB in the end (delta: -38.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. SAFE Result, 2.1s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 52 SDslu, 133 SDs, 0 SdLazy, 87 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=6, 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, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4/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/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-04-41-203.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-04-41-203.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-04-41-203.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-04-41-203.csv Received shutdown request...