java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 19:02:15,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 19:02:15,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 19:02:15,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 19:02:15,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 19:02:15,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 19:02:15,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 19:02:15,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 19:02:15,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 19:02:15,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 19:02:15,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 19:02:15,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 19:02:15,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 19:02:15,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 19:02:15,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 19:02:15,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 19:02:15,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 19:02:15,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 19:02:15,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 19:02:15,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 19:02:15,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 19:02:15,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 19:02:15,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 19:02:15,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 19:02:15,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 19:02:15,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 19:02:15,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 19:02:15,736 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 19:02:15,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 19:02:15,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 19:02:15,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 19:02:15,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 19:02:15,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 19:02:15,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 19:02:15,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 19:02:15,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 19:02:15,744 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 19:02:15,768 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 19:02:15,768 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 19:02:15,769 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 19:02:15,769 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 19:02:15,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 19:02:15,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 19:02:15,770 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 19:02:15,770 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 19:02:15,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 19:02:15,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 19:02:15,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 19:02:15,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 19:02:15,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 19:02:15,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 19:02:15,774 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 19:02:15,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 19:02:15,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 19:02:15,775 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 19:02:15,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 19:02:15,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 19:02:15,775 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 19:02:15,778 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 19:02:15,778 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 19:02:15,824 INFO ]: Repository-Root is: /tmp [2018-06-26 19:02:15,843 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 19:02:15,848 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 19:02:15,850 INFO ]: Initializing SmtParser... [2018-06-26 19:02:15,850 INFO ]: SmtParser initialized [2018-06-26 19:02:15,850 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-26 19:02:15,852 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 19:02:15,934 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@25b22491 [2018-06-26 19:02:16,152 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-26 19:02:16,157 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 19:02:16,163 INFO ]: Walking toolchain with 5 elements. [2018-06-26 19:02:16,163 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 19:02:16,163 INFO ]: Initializing ChcToBoogie... [2018-06-26 19:02:16,164 INFO ]: ChcToBoogie initialized [2018-06-26 19:02:16,168 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,227 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16 Unit [2018-06-26 19:02:16,227 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 19:02:16,228 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 19:02:16,228 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 19:02:16,228 INFO ]: Boogie Preprocessor initialized [2018-06-26 19:02:16,251 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,251 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,257 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,258 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,262 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,265 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,266 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,268 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 19:02:16,269 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 19:02:16,269 INFO ]: Initializing RCFGBuilder... [2018-06-26 19:02:16,269 INFO ]: RCFGBuilder initialized [2018-06-26 19:02:16,270 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (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-26 19:02:16,286 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 19:02:16,286 INFO ]: Found specification of procedure gotoProc [2018-06-26 19:02:16,286 INFO ]: Found implementation of procedure gotoProc [2018-06-26 19:02:16,286 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 19:02:16,286 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 19:02:16,286 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-26 19:02:16,738 INFO ]: Using library mode [2018-06-26 19:02:16,738 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:02:16 BoogieIcfgContainer [2018-06-26 19:02:16,738 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 19:02:16,739 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 19:02:16,739 INFO ]: Initializing BlockEncodingV2... [2018-06-26 19:02:16,740 INFO ]: BlockEncodingV2 initialized [2018-06-26 19:02:16,740 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:02:16" (1/1) ... [2018-06-26 19:02:16,755 INFO ]: Initial Icfg 29 locations, 50 edges [2018-06-26 19:02:16,756 INFO ]: Using Remove infeasible edges [2018-06-26 19:02:16,757 INFO ]: Using Maximize final states [2018-06-26 19:02:16,757 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 19:02:16,757 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 19:02:16,761 INFO ]: Using Remove sink states [2018-06-26 19:02:16,762 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 19:02:16,762 INFO ]: Using Use SBE [2018-06-26 19:02:16,769 INFO ]: SBE split 0 edges [2018-06-26 19:02:16,775 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-26 19:02:16,776 INFO ]: 0 new accepting states [2018-06-26 19:02:16,909 INFO ]: Removed 27 edges and 8 locations by large block encoding [2018-06-26 19:02:16,911 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:02:16,912 INFO ]: Removed 2 edges and 0 locations because of local infeasibility [2018-06-26 19:02:16,913 INFO ]: 0 new accepting states [2018-06-26 19:02:16,913 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 19:02:16,913 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:02:16,913 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 19:02:16,914 INFO ]: 0 new accepting states [2018-06-26 19:02:16,915 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 19:02:16,915 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 19:02:16,916 INFO ]: Encoded RCFG 19 locations, 37 edges [2018-06-26 19:02:16,916 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 07:02:16 BasicIcfg [2018-06-26 19:02:16,916 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 19:02:16,917 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 19:02:16,917 INFO ]: Initializing TraceAbstraction... [2018-06-26 19:02:16,924 INFO ]: TraceAbstraction initialized [2018-06-26 19:02:16,924 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 07:02:16" (1/4) ... [2018-06-26 19:02:16,925 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e6fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 07:02:16, skipping insertion in model container [2018-06-26 19:02:16,925 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 07:02:16" (2/4) ... [2018-06-26 19:02:16,927 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e6fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 07:02:16, skipping insertion in model container [2018-06-26 19:02:16,927 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 07:02:16" (3/4) ... [2018-06-26 19:02:16,927 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e6fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 07:02:16, skipping insertion in model container [2018-06-26 19:02:16,927 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 07:02:16" (4/4) ... [2018-06-26 19:02:16,929 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 19:02:16,940 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 19:02:16,947 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 19:02:16,982 INFO ]: Using default assertion order modulation [2018-06-26 19:02:16,982 INFO ]: Interprodecural is true [2018-06-26 19:02:16,982 INFO ]: Hoare is false [2018-06-26 19:02:16,982 INFO ]: Compute interpolants for FPandBP [2018-06-26 19:02:16,982 INFO ]: Backedges is TWOTRACK [2018-06-26 19:02:16,982 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 19:02:16,982 INFO ]: Difference is false [2018-06-26 19:02:16,982 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 19:02:16,982 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 19:02:16,991 INFO ]: Start isEmpty. Operand 19 states. [2018-06-26 19:02:17,002 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:02:17,002 INFO ]: Found error trace [2018-06-26 19:02:17,003 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:02:17,003 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:17,008 INFO ]: Analyzing trace with hash 37114415, now seen corresponding path program 1 times [2018-06-26 19:02:17,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:17,011 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:17,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:17,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,085 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:17,145 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:02:17,147 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:02:17,147 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:02:17,150 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:02:17,162 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:02:17,162 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:02:17,164 INFO ]: Start difference. First operand 19 states. Second operand 3 states. [2018-06-26 19:02:17,547 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:17,547 INFO ]: Finished difference Result 29 states and 58 transitions. [2018-06-26 19:02:17,548 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:02:17,550 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:02:17,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:17,564 INFO ]: With dead ends: 29 [2018-06-26 19:02:17,564 INFO ]: Without dead ends: 29 [2018-06-26 19:02:17,566 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 19:02:17,587 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 19:02:17,614 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 19:02:17,615 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 19:02:17,617 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-06-26 19:02:17,619 INFO ]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 5 [2018-06-26 19:02:17,620 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:17,620 INFO ]: Abstraction has 29 states and 58 transitions. [2018-06-26 19:02:17,620 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:02:17,620 INFO ]: Start isEmpty. Operand 29 states and 58 transitions. [2018-06-26 19:02:17,623 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 19:02:17,623 INFO ]: Found error trace [2018-06-26 19:02:17,623 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 19:02:17,623 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:17,623 INFO ]: Analyzing trace with hash 37024081, now seen corresponding path program 1 times [2018-06-26 19:02:17,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:17,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:17,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:17,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,629 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:17,661 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:02:17,661 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:02:17,661 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:02:17,662 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:02:17,663 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:02:17,663 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:02:17,663 INFO ]: Start difference. First operand 29 states and 58 transitions. Second operand 3 states. [2018-06-26 19:02:17,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:17,745 INFO ]: Finished difference Result 39 states and 80 transitions. [2018-06-26 19:02:17,745 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:02:17,745 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 19:02:17,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:17,747 INFO ]: With dead ends: 39 [2018-06-26 19:02:17,747 INFO ]: Without dead ends: 39 [2018-06-26 19:02:17,748 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 19:02:17,748 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 19:02:17,756 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 19:02:17,756 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 19:02:17,758 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2018-06-26 19:02:17,758 INFO ]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 5 [2018-06-26 19:02:17,759 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:17,759 INFO ]: Abstraction has 39 states and 80 transitions. [2018-06-26 19:02:17,759 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:02:17,759 INFO ]: Start isEmpty. Operand 39 states and 80 transitions. [2018-06-26 19:02:17,761 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 19:02:17,761 INFO ]: Found error trace [2018-06-26 19:02:17,761 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 19:02:17,761 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:17,761 INFO ]: Analyzing trace with hash 1152905568, now seen corresponding path program 1 times [2018-06-26 19:02:17,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:17,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:17,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:17,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,773 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:17,799 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 19:02:17,799 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:02:17,799 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:02:17,799 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:02:17,799 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:02:17,799 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:02:17,799 INFO ]: Start difference. First operand 39 states and 80 transitions. Second operand 3 states. [2018-06-26 19:02:17,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:17,828 INFO ]: Finished difference Result 48 states and 104 transitions. [2018-06-26 19:02:17,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:02:17,828 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 19:02:17,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:17,833 INFO ]: With dead ends: 48 [2018-06-26 19:02:17,833 INFO ]: Without dead ends: 48 [2018-06-26 19:02:17,834 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 19:02:17,834 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 19:02:17,843 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-06-26 19:02:17,843 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 19:02:17,845 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2018-06-26 19:02:17,845 INFO ]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 6 [2018-06-26 19:02:17,845 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:17,845 INFO ]: Abstraction has 42 states and 86 transitions. [2018-06-26 19:02:17,845 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:02:17,846 INFO ]: Start isEmpty. Operand 42 states and 86 transitions. [2018-06-26 19:02:17,848 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 19:02:17,848 INFO ]: Found error trace [2018-06-26 19:02:17,848 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:17,848 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:17,848 INFO ]: Analyzing trace with hash -81608764, now seen corresponding path program 1 times [2018-06-26 19:02:17,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:17,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:17,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:17,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:17,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:18,139 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-26 19:02:18,274 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-06-26 19:02:18,397 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 19:02:18,397 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:02:18,397 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-26 19:02:18,398 INFO ]: Interpolant automaton has 8 states [2018-06-26 19:02:18,398 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 19:02:18,398 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 19:02:18,398 INFO ]: Start difference. First operand 42 states and 86 transitions. Second operand 8 states. [2018-06-26 19:02:19,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:19,634 INFO ]: Finished difference Result 77 states and 179 transitions. [2018-06-26 19:02:19,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 19:02:19,636 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-26 19:02:19,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:19,639 INFO ]: With dead ends: 77 [2018-06-26 19:02:19,639 INFO ]: Without dead ends: 73 [2018-06-26 19:02:19,640 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-06-26 19:02:19,640 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-26 19:02:19,657 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 54. [2018-06-26 19:02:19,657 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 19:02:19,659 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 109 transitions. [2018-06-26 19:02:19,659 INFO ]: Start accepts. Automaton has 54 states and 109 transitions. Word has length 11 [2018-06-26 19:02:19,659 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:19,659 INFO ]: Abstraction has 54 states and 109 transitions. [2018-06-26 19:02:19,659 INFO ]: Interpolant automaton has 8 states. [2018-06-26 19:02:19,659 INFO ]: Start isEmpty. Operand 54 states and 109 transitions. [2018-06-26 19:02:19,661 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 19:02:19,661 INFO ]: Found error trace [2018-06-26 19:02:19,661 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:19,661 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:19,662 INFO ]: Analyzing trace with hash 1764505006, now seen corresponding path program 1 times [2018-06-26 19:02:19,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:19,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:19,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:19,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:19,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:19,675 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:19,799 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 19:02:19,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:02:19,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:02:19,808 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:19,824 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:19,830 INFO ]: Computing forward predicates... [2018-06-26 19:02:19,870 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 19:02:19,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:02:19,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 19:02:19,895 INFO ]: Interpolant automaton has 7 states [2018-06-26 19:02:19,895 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 19:02:19,895 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 19:02:19,895 INFO ]: Start difference. First operand 54 states and 109 transitions. Second operand 7 states. [2018-06-26 19:02:20,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:20,470 INFO ]: Finished difference Result 72 states and 142 transitions. [2018-06-26 19:02:20,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 19:02:20,470 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-26 19:02:20,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:20,471 INFO ]: With dead ends: 72 [2018-06-26 19:02:20,471 INFO ]: Without dead ends: 48 [2018-06-26 19:02:20,472 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-26 19:02:20,472 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 19:02:20,480 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-06-26 19:02:20,480 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 19:02:20,481 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 78 transitions. [2018-06-26 19:02:20,481 INFO ]: Start accepts. Automaton has 45 states and 78 transitions. Word has length 12 [2018-06-26 19:02:20,481 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:20,482 INFO ]: Abstraction has 45 states and 78 transitions. [2018-06-26 19:02:20,482 INFO ]: Interpolant automaton has 7 states. [2018-06-26 19:02:20,482 INFO ]: Start isEmpty. Operand 45 states and 78 transitions. [2018-06-26 19:02:20,483 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 19:02:20,483 INFO ]: Found error trace [2018-06-26 19:02:20,483 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:20,483 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:20,483 INFO ]: Analyzing trace with hash -598138119, now seen corresponding path program 1 times [2018-06-26 19:02:20,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:20,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:20,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:20,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:20,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:20,498 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:20,549 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 19:02:20,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:02:20,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 19:02:20,549 INFO ]: Interpolant automaton has 3 states [2018-06-26 19:02:20,549 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 19:02:20,549 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 19:02:20,549 INFO ]: Start difference. First operand 45 states and 78 transitions. Second operand 3 states. [2018-06-26 19:02:20,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:20,560 INFO ]: Finished difference Result 48 states and 78 transitions. [2018-06-26 19:02:20,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 19:02:20,561 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 19:02:20,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:20,562 INFO ]: With dead ends: 48 [2018-06-26 19:02:20,562 INFO ]: Without dead ends: 45 [2018-06-26 19:02:20,562 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 19:02:20,563 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 19:02:20,582 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-26 19:02:20,582 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 19:02:20,584 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2018-06-26 19:02:20,584 INFO ]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 12 [2018-06-26 19:02:20,584 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:20,584 INFO ]: Abstraction has 45 states and 75 transitions. [2018-06-26 19:02:20,584 INFO ]: Interpolant automaton has 3 states. [2018-06-26 19:02:20,584 INFO ]: Start isEmpty. Operand 45 states and 75 transitions. [2018-06-26 19:02:20,586 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 19:02:20,586 INFO ]: Found error trace [2018-06-26 19:02:20,586 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:20,586 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:20,586 INFO ]: Analyzing trace with hash 662937952, now seen corresponding path program 1 times [2018-06-26 19:02:20,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:20,586 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:20,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:20,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:20,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:20,603 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:20,712 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 19:02:20,712 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 19:02:20,712 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 19:02:20,712 INFO ]: Interpolant automaton has 4 states [2018-06-26 19:02:20,712 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 19:02:20,713 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 19:02:20,713 INFO ]: Start difference. First operand 45 states and 75 transitions. Second operand 4 states. [2018-06-26 19:02:20,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:20,783 INFO ]: Finished difference Result 50 states and 91 transitions. [2018-06-26 19:02:20,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 19:02:20,784 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-26 19:02:20,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:20,785 INFO ]: With dead ends: 50 [2018-06-26 19:02:20,785 INFO ]: Without dead ends: 50 [2018-06-26 19:02:20,786 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 19:02:20,786 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-26 19:02:20,793 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-06-26 19:02:20,794 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-26 19:02:20,795 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2018-06-26 19:02:20,795 INFO ]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 16 [2018-06-26 19:02:20,795 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:20,795 INFO ]: Abstraction has 46 states and 76 transitions. [2018-06-26 19:02:20,795 INFO ]: Interpolant automaton has 4 states. [2018-06-26 19:02:20,795 INFO ]: Start isEmpty. Operand 46 states and 76 transitions. [2018-06-26 19:02:20,796 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 19:02:20,796 INFO ]: Found error trace [2018-06-26 19:02:20,796 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:20,796 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:20,796 INFO ]: Analyzing trace with hash -166292310, now seen corresponding path program 1 times [2018-06-26 19:02:20,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:20,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:20,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:20,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:20,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:20,817 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:21,031 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 19:02:21,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:02:21,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:02:21,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:21,057 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:21,060 INFO ]: Computing forward predicates... [2018-06-26 19:02:21,841 WARN ]: Spent 425.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 10 [2018-06-26 19:02:22,217 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 7 [2018-06-26 19:02:22,253 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 19:02:22,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:02:22,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-26 19:02:22,274 INFO ]: Interpolant automaton has 13 states [2018-06-26 19:02:22,274 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 19:02:22,274 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-26 19:02:22,274 INFO ]: Start difference. First operand 46 states and 76 transitions. Second operand 13 states. [2018-06-26 19:02:22,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:22,791 INFO ]: Finished difference Result 71 states and 135 transitions. [2018-06-26 19:02:22,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 19:02:22,793 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-26 19:02:22,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:22,794 INFO ]: With dead ends: 71 [2018-06-26 19:02:22,794 INFO ]: Without dead ends: 71 [2018-06-26 19:02:22,795 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-06-26 19:02:22,795 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-26 19:02:22,802 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-06-26 19:02:22,803 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 19:02:22,804 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2018-06-26 19:02:22,804 INFO ]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 17 [2018-06-26 19:02:22,804 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:22,804 INFO ]: Abstraction has 50 states and 85 transitions. [2018-06-26 19:02:22,804 INFO ]: Interpolant automaton has 13 states. [2018-06-26 19:02:22,804 INFO ]: Start isEmpty. Operand 50 states and 85 transitions. [2018-06-26 19:02:22,805 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 19:02:22,805 INFO ]: Found error trace [2018-06-26 19:02:22,805 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:22,805 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:22,805 INFO ]: Analyzing trace with hash -1565678133, now seen corresponding path program 1 times [2018-06-26 19:02:22,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:22,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:22,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:22,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:22,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:22,818 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:22,862 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 19:02:22,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:02:22,862 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 19:02:22,875 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:02:22,894 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:22,895 INFO ]: Computing forward predicates... [2018-06-26 19:02:22,909 INFO ]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 19:02:22,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:02:22,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 19:02:22,928 INFO ]: Interpolant automaton has 6 states [2018-06-26 19:02:22,929 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 19:02:22,929 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 19:02:22,929 INFO ]: Start difference. First operand 50 states and 85 transitions. Second operand 6 states. [2018-06-26 19:02:23,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:23,029 INFO ]: Finished difference Result 57 states and 110 transitions. [2018-06-26 19:02:23,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 19:02:23,029 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-26 19:02:23,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:23,030 INFO ]: With dead ends: 57 [2018-06-26 19:02:23,030 INFO ]: Without dead ends: 57 [2018-06-26 19:02:23,030 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-26 19:02:23,031 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 19:02:23,041 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-26 19:02:23,041 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 19:02:23,042 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 76 transitions. [2018-06-26 19:02:23,042 INFO ]: Start accepts. Automaton has 44 states and 76 transitions. Word has length 17 [2018-06-26 19:02:23,042 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:23,042 INFO ]: Abstraction has 44 states and 76 transitions. [2018-06-26 19:02:23,042 INFO ]: Interpolant automaton has 6 states. [2018-06-26 19:02:23,042 INFO ]: Start isEmpty. Operand 44 states and 76 transitions. [2018-06-26 19:02:23,044 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 19:02:23,044 INFO ]: Found error trace [2018-06-26 19:02:23,044 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:23,045 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:23,045 INFO ]: Analyzing trace with hash -1717003919, now seen corresponding path program 1 times [2018-06-26 19:02:23,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:23,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:23,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:23,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:23,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:23,061 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:23,128 INFO ]: Checked inductivity of 17 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 19:02:23,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:02:23,128 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:02:23,136 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:23,155 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:23,157 INFO ]: Computing forward predicates... [2018-06-26 19:02:23,163 INFO ]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 19:02:23,183 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 19:02:23,183 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2018-06-26 19:02:23,183 INFO ]: Interpolant automaton has 7 states [2018-06-26 19:02:23,183 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 19:02:23,183 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 19:02:23,183 INFO ]: Start difference. First operand 44 states and 76 transitions. Second operand 7 states. [2018-06-26 19:02:23,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:23,480 INFO ]: Finished difference Result 75 states and 143 transitions. [2018-06-26 19:02:23,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 19:02:23,480 INFO ]: Start accepts. Automaton has 7 states. Word has length 23 [2018-06-26 19:02:23,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:23,481 INFO ]: With dead ends: 75 [2018-06-26 19:02:23,481 INFO ]: Without dead ends: 66 [2018-06-26 19:02:23,481 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-26 19:02:23,481 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-26 19:02:23,488 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-06-26 19:02:23,488 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 19:02:23,489 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2018-06-26 19:02:23,489 INFO ]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 23 [2018-06-26 19:02:23,490 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:23,490 INFO ]: Abstraction has 50 states and 80 transitions. [2018-06-26 19:02:23,490 INFO ]: Interpolant automaton has 7 states. [2018-06-26 19:02:23,490 INFO ]: Start isEmpty. Operand 50 states and 80 transitions. [2018-06-26 19:02:23,491 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 19:02:23,491 INFO ]: Found error trace [2018-06-26 19:02:23,491 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 19:02:23,491 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 19:02:23,491 INFO ]: Analyzing trace with hash -1688104543, now seen corresponding path program 1 times [2018-06-26 19:02:23,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 19:02:23,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 19:02:23,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:23,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:23,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 19:02:23,536 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:23,792 INFO ]: Checked inductivity of 20 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 19:02:23,792 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 19:02:23,792 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 19:02:23,798 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 19:02:23,834 INFO ]: Conjunction of SSA is unsat [2018-06-26 19:02:23,837 INFO ]: Computing forward predicates... [2018-06-26 19:02:24,295 INFO ]: Checked inductivity of 20 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 19:02:24,315 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 19:02:24,315 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 19:02:24,315 INFO ]: Interpolant automaton has 16 states [2018-06-26 19:02:24,315 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 19:02:24,315 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-26 19:02:24,315 INFO ]: Start difference. First operand 50 states and 80 transitions. Second operand 16 states. [2018-06-26 19:02:24,567 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-06-26 19:02:24,858 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-06-26 19:02:25,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 19:02:25,966 INFO ]: Finished difference Result 58 states and 91 transitions. [2018-06-26 19:02:25,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 19:02:25,966 INFO ]: Start accepts. Automaton has 16 states. Word has length 24 [2018-06-26 19:02:25,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 19:02:25,966 INFO ]: With dead ends: 58 [2018-06-26 19:02:25,966 INFO ]: Without dead ends: 0 [2018-06-26 19:02:25,967 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 19:02:25,967 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 19:02:25,967 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 19:02:25,967 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 19:02:25,967 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 19:02:25,967 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-06-26 19:02:25,967 INFO ]: Finished accepts. word is rejected. [2018-06-26 19:02:25,967 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 19:02:25,967 INFO ]: Interpolant automaton has 16 states. [2018-06-26 19:02:25,967 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 19:02:25,967 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 19:02:25,969 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 19:02:25,971 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 07:02:25 BasicIcfg [2018-06-26 19:02:25,971 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 19:02:25,972 INFO ]: Toolchain (without parser) took 9814.86 ms. Allocated memory was 309.3 MB in the beginning and 411.0 MB in the end (delta: 101.7 MB). Free memory was 263.6 MB in the beginning and 192.3 MB in the end (delta: 71.3 MB). Peak memory consumption was 173.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:02:25,973 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 19:02:25,973 INFO ]: ChcToBoogie took 63.83 ms. Allocated memory is still 309.3 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:02:25,973 INFO ]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:02:25,974 INFO ]: RCFGBuilder took 469.30 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 246.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:02:25,974 INFO ]: BlockEncodingV2 took 177.61 ms. Allocated memory is still 309.3 MB. Free memory was 246.6 MB in the beginning and 240.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 19:02:25,975 INFO ]: TraceAbstraction took 9053.95 ms. Allocated memory was 309.3 MB in the beginning and 411.0 MB in the end (delta: 101.7 MB). Free memory was 239.6 MB in the beginning and 192.3 MB in the end (delta: 47.2 MB). Peak memory consumption was 148.9 MB. Max. memory is 3.6 GB. [2018-06-26 19:02:25,978 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 29 locations, 50 edges - StatisticsResult: Encoded RCFG 19 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.83 ms. Allocated memory is still 309.3 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 469.30 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 246.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 177.61 ms. Allocated memory is still 309.3 MB. Free memory was 246.6 MB in the beginning and 240.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 9053.95 ms. Allocated memory was 309.3 MB in the beginning and 411.0 MB in the end (delta: 101.7 MB). Free memory was 239.6 MB in the beginning and 192.3 MB in the end (delta: 47.2 MB). Peak memory consumption was 148.9 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, 19 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 375 SDtfs, 279 SDslu, 733 SDs, 0 SdLazy, 993 SolverSat, 257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 82 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 20794 SizeOfPredicates, 37 NumberOfNonLiveVariables, 725 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 108/125 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/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_19-02-25-997.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_19-02-25-997.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_19-02-25-997.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_19-02-25-997.csv Received shutdown request...