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/022-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:08:03,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:08:03,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:08:03,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:08:03,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:08:03,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:08:03,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:08:03,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:08:03,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:08:03,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:08:03,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:08:03,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:08:03,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:08:03,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:08:03,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:08:03,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:08:03,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:08:03,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:08:03,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:08:03,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:08:03,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:08:03,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:08:03,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:08:03,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:08:03,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:08:03,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:08:03,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:08:03,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:08:03,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:08:03,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:08:03,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:08:03,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:08:03,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:08:03,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:08:03,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:08:03,793 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:08:03,812 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:08:03,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:08:03,813 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:08:03,813 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:08:03,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:08:03,814 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:08:03,814 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:08:03,814 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:08:03,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:08:03,815 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:08:03,815 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:08:03,815 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:08:03,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:08:03,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:08:03,822 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:08:03,822 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:08:03,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:08:03,823 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:08:03,823 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:08:03,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:08:03,823 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:08:03,825 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:08:03,825 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:08:03,872 INFO ]: Repository-Root is: /tmp [2018-06-24 21:08:03,888 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:08:03,894 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:08:03,896 INFO ]: Initializing SmtParser... [2018-06-24 21:08:03,896 INFO ]: SmtParser initialized [2018-06-24 21:08:03,897 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 [2018-06-24 21:08:03,898 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-24 21:08:03,989 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 unknown [2018-06-24 21:08:04,292 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 [2018-06-24 21:08:04,296 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:08:04,305 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:08:04,305 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:08:04,305 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:08:04,306 INFO ]: ChcToBoogie initialized [2018-06-24 21:08:04,310 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,374 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04 Unit [2018-06-24 21:08:04,374 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:08:04,375 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:08:04,375 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:08:04,375 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:08:04,391 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,391 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,401 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,402 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,406 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,410 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,412 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,414 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:08:04,414 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:08:04,414 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:08:04,414 INFO ]: RCFGBuilder initialized [2018-06-24 21:08:04,415 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (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-24 21:08:04,425 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:08:04,425 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:08:04,425 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:08:04,426 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:08:04,426 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:08:04,426 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-24 21:08:04,877 INFO ]: Using library mode [2018-06-24 21:08:04,878 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:08:04 BoogieIcfgContainer [2018-06-24 21:08:04,878 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:08:04,878 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:08:04,878 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:08:04,879 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:08:04,880 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:08:04" (1/1) ... [2018-06-24 21:08:04,904 INFO ]: Initial Icfg 31 locations, 48 edges [2018-06-24 21:08:04,906 INFO ]: Using Remove infeasible edges [2018-06-24 21:08:04,906 INFO ]: Using Maximize final states [2018-06-24 21:08:04,907 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:08:04,907 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:08:04,911 INFO ]: Using Remove sink states [2018-06-24 21:08:04,911 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:08:04,911 INFO ]: Using Use SBE [2018-06-24 21:08:04,919 INFO ]: SBE split 0 edges [2018-06-24 21:08:04,925 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:08:04,927 INFO ]: 0 new accepting states [2018-06-24 21:08:05,087 INFO ]: Removed 18 edges and 6 locations by large block encoding [2018-06-24 21:08:05,090 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:08:05,091 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:08:05,091 INFO ]: 0 new accepting states [2018-06-24 21:08:05,092 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:08:05,092 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:08:05,092 INFO ]: Encoded RCFG 23 locations, 42 edges [2018-06-24 21:08:05,093 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:08:05 BasicIcfg [2018-06-24 21:08:05,093 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:08:05,094 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:08:05,094 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:08:05,097 INFO ]: TraceAbstraction initialized [2018-06-24 21:08:05,097 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:08:04" (1/4) ... [2018-06-24 21:08:05,098 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c84190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:08:05, skipping insertion in model container [2018-06-24 21:08:05,098 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:08:04" (2/4) ... [2018-06-24 21:08:05,098 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c84190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:08:05, skipping insertion in model container [2018-06-24 21:08:05,098 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:08:04" (3/4) ... [2018-06-24 21:08:05,098 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c84190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:08:05, skipping insertion in model container [2018-06-24 21:08:05,098 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:08:05" (4/4) ... [2018-06-24 21:08:05,101 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:08:05,112 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:08:05,129 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:08:05,172 INFO ]: Using default assertion order modulation [2018-06-24 21:08:05,172 INFO ]: Interprodecural is true [2018-06-24 21:08:05,172 INFO ]: Hoare is false [2018-06-24 21:08:05,172 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:08:05,172 INFO ]: Backedges is TWOTRACK [2018-06-24 21:08:05,172 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:08:05,172 INFO ]: Difference is false [2018-06-24 21:08:05,172 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:08:05,173 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:08:05,184 INFO ]: Start isEmpty. Operand 23 states. [2018-06-24 21:08:05,196 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:08:05,196 INFO ]: Found error trace [2018-06-24 21:08:05,197 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:08:05,197 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:05,201 INFO ]: Analyzing trace with hash 40328803, now seen corresponding path program 1 times [2018-06-24 21:08:05,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:05,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:05,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:05,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:05,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:05,279 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:05,342 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:08:05,344 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:05,344 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:08:05,345 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:08:05,356 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:08:05,357 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:08:05,358 INFO ]: Start difference. First operand 23 states. Second operand 3 states. [2018-06-24 21:08:05,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:05,599 INFO ]: Finished difference Result 36 states and 68 transitions. [2018-06-24 21:08:05,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:08:05,601 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:08:05,602 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:05,613 INFO ]: With dead ends: 36 [2018-06-24 21:08:05,613 INFO ]: Without dead ends: 36 [2018-06-24 21:08:05,614 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-24 21:08:05,629 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 21:08:05,673 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 21:08:05,676 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 21:08:05,683 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions. [2018-06-24 21:08:05,684 INFO ]: Start accepts. Automaton has 36 states and 68 transitions. Word has length 5 [2018-06-24 21:08:05,685 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:05,685 INFO ]: Abstraction has 36 states and 68 transitions. [2018-06-24 21:08:05,685 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:08:05,685 INFO ]: Start isEmpty. Operand 36 states and 68 transitions. [2018-06-24 21:08:05,689 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:08:05,689 INFO ]: Found error trace [2018-06-24 21:08:05,689 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:08:05,690 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:05,690 INFO ]: Analyzing trace with hash 40418176, now seen corresponding path program 1 times [2018-06-24 21:08:05,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:05,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:05,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:05,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:05,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:05,706 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:05,784 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:08:05,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:05,784 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:08:05,785 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:08:05,785 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:08:05,785 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:08:05,786 INFO ]: Start difference. First operand 36 states and 68 transitions. Second operand 3 states. [2018-06-24 21:08:06,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:06,055 INFO ]: Finished difference Result 58 states and 112 transitions. [2018-06-24 21:08:06,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:08:06,058 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:08:06,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:06,061 INFO ]: With dead ends: 58 [2018-06-24 21:08:06,061 INFO ]: Without dead ends: 58 [2018-06-24 21:08:06,062 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-24 21:08:06,062 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 21:08:06,078 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-06-24 21:08:06,078 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 21:08:06,079 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 74 transitions. [2018-06-24 21:08:06,079 INFO ]: Start accepts. Automaton has 38 states and 74 transitions. Word has length 5 [2018-06-24 21:08:06,079 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:06,079 INFO ]: Abstraction has 38 states and 74 transitions. [2018-06-24 21:08:06,079 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:08:06,080 INFO ]: Start isEmpty. Operand 38 states and 74 transitions. [2018-06-24 21:08:06,088 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:08:06,088 INFO ]: Found error trace [2018-06-24 21:08:06,088 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:06,088 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:06,088 INFO ]: Analyzing trace with hash 836232465, now seen corresponding path program 1 times [2018-06-24 21:08:06,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:06,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:06,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:06,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:06,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:06,116 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:06,170 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:08:06,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:06,170 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:08:06,170 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:08:06,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:08:06,170 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:08:06,170 INFO ]: Start difference. First operand 38 states and 74 transitions. Second operand 3 states. [2018-06-24 21:08:06,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:06,454 INFO ]: Finished difference Result 52 states and 101 transitions. [2018-06-24 21:08:06,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:08:06,454 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 21:08:06,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:06,456 INFO ]: With dead ends: 52 [2018-06-24 21:08:06,456 INFO ]: Without dead ends: 52 [2018-06-24 21:08:06,456 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-24 21:08:06,456 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 21:08:06,466 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-24 21:08:06,466 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 21:08:06,469 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 101 transitions. [2018-06-24 21:08:06,470 INFO ]: Start accepts. Automaton has 52 states and 101 transitions. Word has length 11 [2018-06-24 21:08:06,470 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:06,470 INFO ]: Abstraction has 52 states and 101 transitions. [2018-06-24 21:08:06,470 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:08:06,470 INFO ]: Start isEmpty. Operand 52 states and 101 transitions. [2018-06-24 21:08:06,472 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:08:06,472 INFO ]: Found error trace [2018-06-24 21:08:06,473 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:06,473 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:06,473 INFO ]: Analyzing trace with hash -594253144, now seen corresponding path program 1 times [2018-06-24 21:08:06,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:06,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:06,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:06,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:06,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:06,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:06,566 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:08:06,566 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:06,566 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:08:06,566 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:08:06,566 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:08:06,566 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:08:06,566 INFO ]: Start difference. First operand 52 states and 101 transitions. Second operand 5 states. [2018-06-24 21:08:07,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:07,702 INFO ]: Finished difference Result 83 states and 200 transitions. [2018-06-24 21:08:07,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:08:07,702 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 21:08:07,702 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:07,708 INFO ]: With dead ends: 83 [2018-06-24 21:08:07,708 INFO ]: Without dead ends: 76 [2018-06-24 21:08:07,708 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:08:07,708 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 21:08:07,727 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-06-24 21:08:07,727 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-24 21:08:07,729 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 142 transitions. [2018-06-24 21:08:07,729 INFO ]: Start accepts. Automaton has 65 states and 142 transitions. Word has length 11 [2018-06-24 21:08:07,729 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:07,729 INFO ]: Abstraction has 65 states and 142 transitions. [2018-06-24 21:08:07,729 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:08:07,729 INFO ]: Start isEmpty. Operand 65 states and 142 transitions. [2018-06-24 21:08:07,732 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:08:07,732 INFO ]: Found error trace [2018-06-24 21:08:07,732 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:07,732 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:07,732 INFO ]: Analyzing trace with hash 1644191375, now seen corresponding path program 1 times [2018-06-24 21:08:07,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:07,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:07,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:07,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:07,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:07,749 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:07,817 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:08:07,817 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:07,817 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-24 21:08:07,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:07,881 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:07,887 INFO ]: Computing forward predicates... [2018-06-24 21:08:08,010 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:08:08,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:08,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 21:08:08,034 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:08:08,035 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:08:08,035 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:08:08,035 INFO ]: Start difference. First operand 65 states and 142 transitions. Second operand 9 states. [2018-06-24 21:08:09,744 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:09,744 INFO ]: Finished difference Result 118 states and 377 transitions. [2018-06-24 21:08:09,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 21:08:09,744 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 21:08:09,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:09,750 INFO ]: With dead ends: 118 [2018-06-24 21:08:09,750 INFO ]: Without dead ends: 118 [2018-06-24 21:08:09,751 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:08:09,751 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-24 21:08:09,784 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 78. [2018-06-24 21:08:09,784 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:08:09,787 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 199 transitions. [2018-06-24 21:08:09,787 INFO ]: Start accepts. Automaton has 78 states and 199 transitions. Word has length 11 [2018-06-24 21:08:09,787 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:09,787 INFO ]: Abstraction has 78 states and 199 transitions. [2018-06-24 21:08:09,787 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:08:09,787 INFO ]: Start isEmpty. Operand 78 states and 199 transitions. [2018-06-24 21:08:09,788 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:08:09,788 INFO ]: Found error trace [2018-06-24 21:08:09,788 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:09,789 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:09,789 INFO ]: Analyzing trace with hash -221469470, now seen corresponding path program 1 times [2018-06-24 21:08:09,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:09,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:09,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:09,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:09,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:09,809 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:09,884 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:08:09,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:09,884 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-24 21:08:09,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:09,927 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:09,929 INFO ]: Computing forward predicates... [2018-06-24 21:08:09,969 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:08:09,989 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:09,989 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:08:09,989 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:08:09,989 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:08:09,989 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:08:09,989 INFO ]: Start difference. First operand 78 states and 199 transitions. Second operand 7 states. [2018-06-24 21:08:10,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:10,551 INFO ]: Finished difference Result 174 states and 545 transitions. [2018-06-24 21:08:10,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:08:10,551 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-24 21:08:10,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:10,559 INFO ]: With dead ends: 174 [2018-06-24 21:08:10,559 INFO ]: Without dead ends: 174 [2018-06-24 21:08:10,559 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:08:10,559 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-24 21:08:10,600 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 96. [2018-06-24 21:08:10,600 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-24 21:08:10,603 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 253 transitions. [2018-06-24 21:08:10,603 INFO ]: Start accepts. Automaton has 96 states and 253 transitions. Word has length 12 [2018-06-24 21:08:10,603 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:10,603 INFO ]: Abstraction has 96 states and 253 transitions. [2018-06-24 21:08:10,603 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:08:10,603 INFO ]: Start isEmpty. Operand 96 states and 253 transitions. [2018-06-24 21:08:10,607 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:08:10,607 INFO ]: Found error trace [2018-06-24 21:08:10,607 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:10,608 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:10,608 INFO ]: Analyzing trace with hash -1947915061, now seen corresponding path program 1 times [2018-06-24 21:08:10,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:10,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:10,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:10,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:10,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:10,626 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:10,740 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:08:10,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:10,740 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:08:10,740 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:08:10,740 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:08:10,740 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:08:10,741 INFO ]: Start difference. First operand 96 states and 253 transitions. Second operand 5 states. [2018-06-24 21:08:10,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:10,818 INFO ]: Finished difference Result 113 states and 310 transitions. [2018-06-24 21:08:10,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:08:10,819 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 21:08:10,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:10,822 INFO ]: With dead ends: 113 [2018-06-24 21:08:10,822 INFO ]: Without dead ends: 113 [2018-06-24 21:08:10,823 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:08:10,823 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 21:08:10,855 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 97. [2018-06-24 21:08:10,855 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 21:08:10,861 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 255 transitions. [2018-06-24 21:08:10,861 INFO ]: Start accepts. Automaton has 97 states and 255 transitions. Word has length 18 [2018-06-24 21:08:10,862 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:10,862 INFO ]: Abstraction has 97 states and 255 transitions. [2018-06-24 21:08:10,862 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:08:10,862 INFO ]: Start isEmpty. Operand 97 states and 255 transitions. [2018-06-24 21:08:10,866 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:08:10,866 INFO ]: Found error trace [2018-06-24 21:08:10,866 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:10,866 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:10,867 INFO ]: Analyzing trace with hash -2131892356, now seen corresponding path program 1 times [2018-06-24 21:08:10,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:10,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:10,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:10,867 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:10,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:10,894 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:10,977 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:08:10,977 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:10,977 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:08:10,977 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:08:10,977 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:08:10,978 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:08:10,978 INFO ]: Start difference. First operand 97 states and 255 transitions. Second operand 5 states. [2018-06-24 21:08:11,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:11,053 INFO ]: Finished difference Result 114 states and 312 transitions. [2018-06-24 21:08:11,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:08:11,054 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 21:08:11,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:11,057 INFO ]: With dead ends: 114 [2018-06-24 21:08:11,057 INFO ]: Without dead ends: 104 [2018-06-24 21:08:11,057 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:08:11,057 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-24 21:08:11,088 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 92. [2018-06-24 21:08:11,088 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-24 21:08:11,090 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 237 transitions. [2018-06-24 21:08:11,090 INFO ]: Start accepts. Automaton has 92 states and 237 transitions. Word has length 18 [2018-06-24 21:08:11,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:11,091 INFO ]: Abstraction has 92 states and 237 transitions. [2018-06-24 21:08:11,091 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:08:11,091 INFO ]: Start isEmpty. Operand 92 states and 237 transitions. [2018-06-24 21:08:11,096 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:08:11,096 INFO ]: Found error trace [2018-06-24 21:08:11,096 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:11,096 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:11,096 INFO ]: Analyzing trace with hash 1894385436, now seen corresponding path program 1 times [2018-06-24 21:08:11,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:11,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:11,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:11,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:11,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:11,120 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:11,460 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-24 21:08:11,601 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:08:11,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:08:11,601 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 21:08:11,602 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:08:11,602 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:08:11,602 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:08:11,602 INFO ]: Start difference. First operand 92 states and 237 transitions. Second operand 5 states. [2018-06-24 21:08:11,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:11,899 INFO ]: Finished difference Result 106 states and 285 transitions. [2018-06-24 21:08:11,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:08:11,899 INFO ]: Start accepts. Automaton has 5 states. Word has length 18 [2018-06-24 21:08:11,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:11,901 INFO ]: With dead ends: 106 [2018-06-24 21:08:11,901 INFO ]: Without dead ends: 101 [2018-06-24 21:08:11,901 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:08:11,902 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-24 21:08:11,913 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-06-24 21:08:11,913 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-24 21:08:11,915 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 228 transitions. [2018-06-24 21:08:11,915 INFO ]: Start accepts. Automaton has 89 states and 228 transitions. Word has length 18 [2018-06-24 21:08:11,915 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:11,915 INFO ]: Abstraction has 89 states and 228 transitions. [2018-06-24 21:08:11,915 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:08:11,915 INFO ]: Start isEmpty. Operand 89 states and 228 transitions. [2018-06-24 21:08:11,918 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:08:11,918 INFO ]: Found error trace [2018-06-24 21:08:11,918 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:11,918 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:11,918 INFO ]: Analyzing trace with hash -1803627320, now seen corresponding path program 1 times [2018-06-24 21:08:11,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:11,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:11,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:11,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:11,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:11,938 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:12,160 INFO ]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:08:12,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:12,161 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-24 21:08:12,174 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-24 21:08:12,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:12,220 INFO ]: Computing forward predicates... [2018-06-24 21:08:12,455 INFO ]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:08:12,476 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:12,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-24 21:08:12,476 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:08:12,476 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:08:12,476 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:08:12,477 INFO ]: Start difference. First operand 89 states and 228 transitions. Second operand 13 states. [2018-06-24 21:08:15,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:15,470 INFO ]: Finished difference Result 235 states and 1132 transitions. [2018-06-24 21:08:15,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 21:08:15,470 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-24 21:08:15,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:15,476 INFO ]: With dead ends: 235 [2018-06-24 21:08:15,477 INFO ]: Without dead ends: 235 [2018-06-24 21:08:15,477 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1409, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:08:15,477 INFO ]: Start minimizeSevpa. Operand 235 states. [2018-06-24 21:08:15,539 INFO ]: Finished minimizeSevpa. Reduced states from 235 to 102. [2018-06-24 21:08:15,539 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-24 21:08:15,545 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 275 transitions. [2018-06-24 21:08:15,545 INFO ]: Start accepts. Automaton has 102 states and 275 transitions. Word has length 18 [2018-06-24 21:08:15,545 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:15,545 INFO ]: Abstraction has 102 states and 275 transitions. [2018-06-24 21:08:15,545 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:08:15,545 INFO ]: Start isEmpty. Operand 102 states and 275 transitions. [2018-06-24 21:08:15,547 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:08:15,548 INFO ]: Found error trace [2018-06-24 21:08:15,548 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:08:15,549 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:08:15,549 INFO ]: Analyzing trace with hash -210644551, now seen corresponding path program 1 times [2018-06-24 21:08:15,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:08:15,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:08:15,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:15,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:15,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:08:15,567 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:15,670 INFO ]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:08:15,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:08:15,670 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-24 21:08:15,685 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:08:15,722 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:08:15,724 INFO ]: Computing forward predicates... [2018-06-24 21:08:15,896 INFO ]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:08:15,916 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:08:15,916 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-24 21:08:15,916 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:08:15,917 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:08:15,917 INFO ]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:08:15,917 INFO ]: Start difference. First operand 102 states and 275 transitions. Second operand 13 states. [2018-06-24 21:08:16,546 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:08:16,546 INFO ]: Finished difference Result 48 states and 77 transitions. [2018-06-24 21:08:16,546 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 21:08:16,546 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-24 21:08:16,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:08:16,546 INFO ]: With dead ends: 48 [2018-06-24 21:08:16,546 INFO ]: Without dead ends: 0 [2018-06-24 21:08:16,547 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:08:16,547 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:08:16,547 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:08:16,547 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:08:16,547 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:08:16,547 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-06-24 21:08:16,547 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:08:16,547 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:08:16,547 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:08:16,547 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:08:16,547 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:08:16,643 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:08:16,644 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:08:16 BasicIcfg [2018-06-24 21:08:16,644 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:08:16,645 INFO ]: Toolchain (without parser) took 12348.05 ms. Allocated memory was 308.8 MB in the beginning and 546.8 MB in the end (delta: 238.0 MB). Free memory was 261.2 MB in the beginning and 528.0 MB in the end (delta: -266.8 MB). Peak memory consumption was 35.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:16,646 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:08:16,646 INFO ]: ChcToBoogie took 69.06 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:16,647 INFO ]: Boogie Preprocessor took 38.97 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:16,647 INFO ]: RCFGBuilder took 463.73 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 237.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:16,647 INFO ]: BlockEncodingV2 took 214.39 ms. Allocated memory is still 308.8 MB. Free memory was 237.2 MB in the beginning and 229.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:16,648 INFO ]: TraceAbstraction took 11550.38 ms. Allocated memory was 308.8 MB in the beginning and 546.8 MB in the end (delta: 238.0 MB). Free memory was 229.2 MB in the beginning and 528.0 MB in the end (delta: -298.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:08:16,651 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 31 locations, 48 edges - StatisticsResult: Encoded RCFG 23 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.06 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 257.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.97 ms. Allocated memory is still 308.8 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 463.73 ms. Allocated memory is still 308.8 MB. Free memory was 255.2 MB in the beginning and 237.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 214.39 ms. Allocated memory is still 308.8 MB. Free memory was 237.2 MB in the beginning and 229.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11550.38 ms. Allocated memory was 308.8 MB in the beginning and 546.8 MB in the end (delta: 238.0 MB). Free memory was 229.2 MB in the beginning and 528.0 MB in the end (delta: -298.8 MB). Peak memory consumption was 3.1 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, 23 locations, 1 error locations. SAFE Result, 11.4s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 638 SDtfs, 496 SDslu, 759 SDs, 0 SdLazy, 3583 SolverSat, 704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 322 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 11466 SizeOfPredicates, 44 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 108/133 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/022-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-08-16-662.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-08-16-662.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-08-16-662.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-08-16-662.csv Received shutdown request...