java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 10:12:22,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 10:12:22,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 10:12:22,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 10:12:22,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 10:12:22,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 10:12:22,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 10:12:22,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 10:12:22,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 10:12:22,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 10:12:22,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 10:12:22,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 10:12:22,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 10:12:22,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 10:12:22,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 10:12:22,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 10:12:22,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 10:12:22,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 10:12:22,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 10:12:22,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 10:12:22,854 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 10:12:22,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 10:12:22,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 10:12:22,857 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 10:12:22,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 10:12:22,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 10:12:22,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 10:12:22,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 10:12:22,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 10:12:22,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 10:12:22,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 10:12:22,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 10:12:22,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 10:12:22,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 10:12:22,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 10:12:22,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 10:12:22,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 10:12:22,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 10:12:22,901 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 10:12:22,902 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 10:12:22,903 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 10:12:22,903 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 10:12:22,903 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 10:12:22,903 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 10:12:22,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 10:12:22,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 10:12:22,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 10:12:22,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 10:12:22,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 10:12:22,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 10:12:22,905 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 10:12:22,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 10:12:22,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 10:12:22,906 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 10:12:22,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 10:12:22,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 10:12:22,907 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 10:12:22,908 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 10:12:22,908 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 10:12:22,950 INFO ]: Repository-Root is: /tmp [2018-06-25 10:12:22,970 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 10:12:22,976 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 10:12:22,978 INFO ]: Initializing SmtParser... [2018-06-25 10:12:22,978 INFO ]: SmtParser initialized [2018-06-25 10:12:22,979 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 [2018-06-25 10:12:22,980 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 10:12:23,071 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@41b85227 [2018-06-25 10:12:23,271 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit2.smt2 [2018-06-25 10:12:23,276 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 10:12:23,282 INFO ]: Walking toolchain with 4 elements. [2018-06-25 10:12:23,282 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 10:12:23,282 INFO ]: Initializing ChcToBoogie... [2018-06-25 10:12:23,282 INFO ]: ChcToBoogie initialized [2018-06-25 10:12:23,285 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,345 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23 Unit [2018-06-25 10:12:23,345 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 10:12:23,346 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 10:12:23,346 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 10:12:23,346 INFO ]: Boogie Preprocessor initialized [2018-06-25 10:12:23,370 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,370 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,375 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,376 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,381 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,384 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,385 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... [2018-06-25 10:12:23,387 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 10:12:23,387 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 10:12:23,387 INFO ]: Initializing RCFGBuilder... [2018-06-25 10:12:23,387 INFO ]: RCFGBuilder initialized [2018-06-25 10:12:23,388 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 10:12:23,402 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 10:12:23,402 INFO ]: Found specification of procedure gotoProc [2018-06-25 10:12:23,402 INFO ]: Found implementation of procedure gotoProc [2018-06-25 10:12:23,402 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 10:12:23,402 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 10:12:23,402 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 10:12:23,820 INFO ]: Using library mode [2018-06-25 10:12:23,820 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 10:12:23 BoogieIcfgContainer [2018-06-25 10:12:23,820 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 10:12:23,822 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 10:12:23,822 INFO ]: Initializing TraceAbstraction... [2018-06-25 10:12:23,825 INFO ]: TraceAbstraction initialized [2018-06-25 10:12:23,825 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 10:12:23" (1/3) ... [2018-06-25 10:12:23,826 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738735a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 10:12:23, skipping insertion in model container [2018-06-25 10:12:23,826 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:12:23" (2/3) ... [2018-06-25 10:12:23,826 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738735a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 10:12:23, skipping insertion in model container [2018-06-25 10:12:23,826 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 10:12:23" (3/3) ... [2018-06-25 10:12:23,828 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 10:12:23,837 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 10:12:23,847 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 10:12:23,899 INFO ]: Using default assertion order modulation [2018-06-25 10:12:23,899 INFO ]: Interprodecural is true [2018-06-25 10:12:23,899 INFO ]: Hoare is false [2018-06-25 10:12:23,899 INFO ]: Compute interpolants for FPandBP [2018-06-25 10:12:23,899 INFO ]: Backedges is TWOTRACK [2018-06-25 10:12:23,899 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 10:12:23,899 INFO ]: Difference is false [2018-06-25 10:12:23,899 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 10:12:23,900 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 10:12:23,921 INFO ]: Start isEmpty. Operand 28 states. [2018-06-25 10:12:23,939 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 10:12:23,940 INFO ]: Found error trace [2018-06-25 10:12:23,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:23,942 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:23,948 INFO ]: Analyzing trace with hash -802239721, now seen corresponding path program 1 times [2018-06-25 10:12:23,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:23,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:23,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:23,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:23,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:24,026 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:24,085 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:12:24,088 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:24,088 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:12:24,089 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:12:24,103 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:12:24,104 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:12:24,106 INFO ]: Start difference. First operand 28 states. Second operand 4 states. [2018-06-25 10:12:24,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:24,651 INFO ]: Finished difference Result 45 states and 76 transitions. [2018-06-25 10:12:24,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:12:24,652 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 10:12:24,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:24,664 INFO ]: With dead ends: 45 [2018-06-25 10:12:24,664 INFO ]: Without dead ends: 45 [2018-06-25 10:12:24,673 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-25 10:12:24,687 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 10:12:24,721 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-25 10:12:24,722 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-25 10:12:24,727 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2018-06-25 10:12:24,728 INFO ]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 8 [2018-06-25 10:12:24,728 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:24,728 INFO ]: Abstraction has 45 states and 76 transitions. [2018-06-25 10:12:24,728 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:12:24,728 INFO ]: Start isEmpty. Operand 45 states and 76 transitions. [2018-06-25 10:12:24,730 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 10:12:24,730 INFO ]: Found error trace [2018-06-25 10:12:24,730 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:24,730 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:24,730 INFO ]: Analyzing trace with hash -791723498, now seen corresponding path program 1 times [2018-06-25 10:12:24,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:24,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:24,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:24,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:24,731 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:24,736 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:24,761 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:12:24,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:24,761 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:12:24,762 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:12:24,762 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:12:24,762 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:12:24,763 INFO ]: Start difference. First operand 45 states and 76 transitions. Second operand 4 states. [2018-06-25 10:12:24,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:24,997 INFO ]: Finished difference Result 64 states and 109 transitions. [2018-06-25 10:12:24,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:12:24,998 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 10:12:24,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:25,001 INFO ]: With dead ends: 64 [2018-06-25 10:12:25,001 INFO ]: Without dead ends: 64 [2018-06-25 10:12:25,002 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-25 10:12:25,002 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 10:12:25,011 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-25 10:12:25,011 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 10:12:25,013 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-06-25 10:12:25,013 INFO ]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-06-25 10:12:25,013 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:25,013 INFO ]: Abstraction has 64 states and 109 transitions. [2018-06-25 10:12:25,013 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:12:25,013 INFO ]: Start isEmpty. Operand 64 states and 109 transitions. [2018-06-25 10:12:25,014 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 10:12:25,014 INFO ]: Found error trace [2018-06-25 10:12:25,014 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:25,014 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:25,014 INFO ]: Analyzing trace with hash 1249031438, now seen corresponding path program 1 times [2018-06-25 10:12:25,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:25,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:25,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:25,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,021 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:25,046 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:12:25,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:25,046 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:12:25,047 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:12:25,047 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:12:25,047 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:12:25,050 INFO ]: Start difference. First operand 64 states and 109 transitions. Second operand 4 states. [2018-06-25 10:12:25,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:25,188 INFO ]: Finished difference Result 83 states and 142 transitions. [2018-06-25 10:12:25,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:12:25,201 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 10:12:25,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:25,206 INFO ]: With dead ends: 83 [2018-06-25 10:12:25,206 INFO ]: Without dead ends: 83 [2018-06-25 10:12:25,207 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-25 10:12:25,207 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-25 10:12:25,216 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-06-25 10:12:25,216 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-25 10:12:25,219 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 142 transitions. [2018-06-25 10:12:25,219 INFO ]: Start accepts. Automaton has 83 states and 142 transitions. Word has length 9 [2018-06-25 10:12:25,219 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:25,219 INFO ]: Abstraction has 83 states and 142 transitions. [2018-06-25 10:12:25,219 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:12:25,219 INFO ]: Start isEmpty. Operand 83 states and 142 transitions. [2018-06-25 10:12:25,220 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 10:12:25,220 INFO ]: Found error trace [2018-06-25 10:12:25,221 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:25,221 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:25,221 INFO ]: Analyzing trace with hash -1177227362, now seen corresponding path program 1 times [2018-06-25 10:12:25,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:25,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:25,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:25,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,233 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:25,307 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:12:25,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:25,308 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:12:25,308 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:12:25,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:12:25,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:25,308 INFO ]: Start difference. First operand 83 states and 142 transitions. Second operand 3 states. [2018-06-25 10:12:25,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:25,343 INFO ]: Finished difference Result 87 states and 146 transitions. [2018-06-25 10:12:25,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:12:25,344 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 10:12:25,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:25,346 INFO ]: With dead ends: 87 [2018-06-25 10:12:25,346 INFO ]: Without dead ends: 87 [2018-06-25 10:12:25,347 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:25,347 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-25 10:12:25,358 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-06-25 10:12:25,358 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-25 10:12:25,361 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 146 transitions. [2018-06-25 10:12:25,361 INFO ]: Start accepts. Automaton has 87 states and 146 transitions. Word has length 11 [2018-06-25 10:12:25,361 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:25,361 INFO ]: Abstraction has 87 states and 146 transitions. [2018-06-25 10:12:25,361 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:12:25,361 INFO ]: Start isEmpty. Operand 87 states and 146 transitions. [2018-06-25 10:12:25,362 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 10:12:25,362 INFO ]: Found error trace [2018-06-25 10:12:25,362 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:25,362 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:25,363 INFO ]: Analyzing trace with hash -972980266, now seen corresponding path program 1 times [2018-06-25 10:12:25,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:25,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:25,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:25,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,372 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:25,402 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:12:25,402 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:25,402 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:12:25,402 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:12:25,403 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:12:25,403 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:25,403 INFO ]: Start difference. First operand 87 states and 146 transitions. Second operand 3 states. [2018-06-25 10:12:25,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:25,543 INFO ]: Finished difference Result 119 states and 220 transitions. [2018-06-25 10:12:25,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:12:25,543 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 10:12:25,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:25,549 INFO ]: With dead ends: 119 [2018-06-25 10:12:25,549 INFO ]: Without dead ends: 119 [2018-06-25 10:12:25,549 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:25,549 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-25 10:12:25,580 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 91. [2018-06-25 10:12:25,580 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-25 10:12:25,586 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 154 transitions. [2018-06-25 10:12:25,586 INFO ]: Start accepts. Automaton has 91 states and 154 transitions. Word has length 11 [2018-06-25 10:12:25,586 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:25,587 INFO ]: Abstraction has 91 states and 154 transitions. [2018-06-25 10:12:25,587 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:12:25,587 INFO ]: Start isEmpty. Operand 91 states and 154 transitions. [2018-06-25 10:12:25,589 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 10:12:25,589 INFO ]: Found error trace [2018-06-25 10:12:25,589 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:25,589 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:25,590 INFO ]: Analyzing trace with hash 512051556, now seen corresponding path program 1 times [2018-06-25 10:12:25,590 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:25,590 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:25,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:25,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:25,622 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:25,879 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 10:12:25,880 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:25,880 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-25 10:12:25,880 INFO ]: Interpolant automaton has 8 states [2018-06-25 10:12:25,880 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 10:12:25,880 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 10:12:25,880 INFO ]: Start difference. First operand 91 states and 154 transitions. Second operand 8 states. [2018-06-25 10:12:26,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:26,273 INFO ]: Finished difference Result 155 states and 314 transitions. [2018-06-25 10:12:26,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 10:12:26,276 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-25 10:12:26,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:26,284 INFO ]: With dead ends: 155 [2018-06-25 10:12:26,284 INFO ]: Without dead ends: 155 [2018-06-25 10:12:26,284 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-25 10:12:26,284 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-25 10:12:26,317 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 102. [2018-06-25 10:12:26,317 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-25 10:12:26,324 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 181 transitions. [2018-06-25 10:12:26,324 INFO ]: Start accepts. Automaton has 102 states and 181 transitions. Word has length 20 [2018-06-25 10:12:26,324 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:26,324 INFO ]: Abstraction has 102 states and 181 transitions. [2018-06-25 10:12:26,324 INFO ]: Interpolant automaton has 8 states. [2018-06-25 10:12:26,324 INFO ]: Start isEmpty. Operand 102 states and 181 transitions. [2018-06-25 10:12:26,330 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 10:12:26,330 INFO ]: Found error trace [2018-06-25 10:12:26,330 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:26,330 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:26,331 INFO ]: Analyzing trace with hash -1357551506, now seen corresponding path program 1 times [2018-06-25 10:12:26,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:26,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:26,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:26,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,358 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:26,443 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 10:12:26,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:26,443 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:12:26,443 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:12:26,443 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:12:26,443 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:26,444 INFO ]: Start difference. First operand 102 states and 181 transitions. Second operand 3 states. [2018-06-25 10:12:26,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:26,469 INFO ]: Finished difference Result 106 states and 185 transitions. [2018-06-25 10:12:26,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:12:26,471 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-25 10:12:26,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:26,473 INFO ]: With dead ends: 106 [2018-06-25 10:12:26,473 INFO ]: Without dead ends: 106 [2018-06-25 10:12:26,473 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:26,473 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-25 10:12:26,483 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-06-25 10:12:26,483 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-25 10:12:26,485 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-06-25 10:12:26,485 INFO ]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 20 [2018-06-25 10:12:26,486 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:26,486 INFO ]: Abstraction has 106 states and 185 transitions. [2018-06-25 10:12:26,486 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:12:26,486 INFO ]: Start isEmpty. Operand 106 states and 185 transitions. [2018-06-25 10:12:26,488 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:12:26,488 INFO ]: Found error trace [2018-06-25 10:12:26,488 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:26,488 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:26,488 INFO ]: Analyzing trace with hash 1941808968, now seen corresponding path program 1 times [2018-06-25 10:12:26,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:26,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:26,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:26,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,496 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:26,521 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 10:12:26,522 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:26,522 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 10:12:26,522 INFO ]: Interpolant automaton has 3 states [2018-06-25 10:12:26,522 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 10:12:26,522 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:26,522 INFO ]: Start difference. First operand 106 states and 185 transitions. Second operand 3 states. [2018-06-25 10:12:26,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:26,537 INFO ]: Finished difference Result 125 states and 228 transitions. [2018-06-25 10:12:26,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 10:12:26,546 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-25 10:12:26,546 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:26,548 INFO ]: With dead ends: 125 [2018-06-25 10:12:26,548 INFO ]: Without dead ends: 121 [2018-06-25 10:12:26,548 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 10:12:26,548 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-25 10:12:26,567 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-06-25 10:12:26,567 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-25 10:12:26,568 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 181 transitions. [2018-06-25 10:12:26,569 INFO ]: Start accepts. Automaton has 106 states and 181 transitions. Word has length 21 [2018-06-25 10:12:26,569 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:26,574 INFO ]: Abstraction has 106 states and 181 transitions. [2018-06-25 10:12:26,574 INFO ]: Interpolant automaton has 3 states. [2018-06-25 10:12:26,574 INFO ]: Start isEmpty. Operand 106 states and 181 transitions. [2018-06-25 10:12:26,575 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:12:26,575 INFO ]: Found error trace [2018-06-25 10:12:26,575 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:26,575 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:26,576 INFO ]: Analyzing trace with hash 1747376610, now seen corresponding path program 1 times [2018-06-25 10:12:26,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:26,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:26,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:26,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,590 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:26,709 INFO ]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 10:12:26,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:26,709 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:12:26,709 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:12:26,709 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:12:26,709 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:12:26,709 INFO ]: Start difference. First operand 106 states and 181 transitions. Second operand 4 states. [2018-06-25 10:12:26,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:26,870 INFO ]: Finished difference Result 122 states and 204 transitions. [2018-06-25 10:12:26,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:12:26,871 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-25 10:12:26,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:26,872 INFO ]: With dead ends: 122 [2018-06-25 10:12:26,872 INFO ]: Without dead ends: 106 [2018-06-25 10:12:26,873 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:12:26,873 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-25 10:12:26,880 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-06-25 10:12:26,880 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-25 10:12:26,881 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 175 transitions. [2018-06-25 10:12:26,881 INFO ]: Start accepts. Automaton has 106 states and 175 transitions. Word has length 21 [2018-06-25 10:12:26,881 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:26,882 INFO ]: Abstraction has 106 states and 175 transitions. [2018-06-25 10:12:26,882 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:12:26,882 INFO ]: Start isEmpty. Operand 106 states and 175 transitions. [2018-06-25 10:12:26,882 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:12:26,882 INFO ]: Found error trace [2018-06-25 10:12:26,883 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:26,883 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:26,883 INFO ]: Analyzing trace with hash 865293304, now seen corresponding path program 1 times [2018-06-25 10:12:26,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:26,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:26,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:26,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:26,893 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:26,963 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 10:12:26,963 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:12:26,963 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-25 10:12:26,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:27,005 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:27,012 INFO ]: Computing forward predicates... [2018-06-25 10:12:27,037 INFO ]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 10:12:27,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:12:27,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 10:12:27,071 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:12:27,072 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:12:27,072 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:12:27,072 INFO ]: Start difference. First operand 106 states and 175 transitions. Second operand 5 states. [2018-06-25 10:12:27,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:27,508 INFO ]: Finished difference Result 102 states and 166 transitions. [2018-06-25 10:12:27,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:12:27,509 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-25 10:12:27,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:27,510 INFO ]: With dead ends: 102 [2018-06-25 10:12:27,510 INFO ]: Without dead ends: 73 [2018-06-25 10:12:27,510 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:12:27,510 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-25 10:12:27,515 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-06-25 10:12:27,515 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 10:12:27,516 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2018-06-25 10:12:27,516 INFO ]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 21 [2018-06-25 10:12:27,516 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:27,516 INFO ]: Abstraction has 69 states and 108 transitions. [2018-06-25 10:12:27,516 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:12:27,516 INFO ]: Start isEmpty. Operand 69 states and 108 transitions. [2018-06-25 10:12:27,517 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 10:12:27,517 INFO ]: Found error trace [2018-06-25 10:12:27,517 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:27,517 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:27,518 INFO ]: Analyzing trace with hash 1425116108, now seen corresponding path program 1 times [2018-06-25 10:12:27,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:27,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:27,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:27,518 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:27,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:27,533 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:28,018 INFO ]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 10:12:28,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:12:28,018 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-25 10:12:28,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:28,065 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:28,069 INFO ]: Computing forward predicates... [2018-06-25 10:12:28,263 INFO ]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 10:12:28,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:12:28,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 10:12:28,283 INFO ]: Interpolant automaton has 12 states [2018-06-25 10:12:28,284 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 10:12:28,284 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-25 10:12:28,284 INFO ]: Start difference. First operand 69 states and 108 transitions. Second operand 12 states. [2018-06-25 10:12:28,761 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:28,761 INFO ]: Finished difference Result 82 states and 132 transitions. [2018-06-25 10:12:28,761 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 10:12:28,761 INFO ]: Start accepts. Automaton has 12 states. Word has length 29 [2018-06-25 10:12:28,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:28,762 INFO ]: With dead ends: 82 [2018-06-25 10:12:28,762 INFO ]: Without dead ends: 82 [2018-06-25 10:12:28,763 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-06-25 10:12:28,763 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-25 10:12:28,768 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 57. [2018-06-25 10:12:28,768 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 10:12:28,768 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2018-06-25 10:12:28,768 INFO ]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 29 [2018-06-25 10:12:28,769 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:28,769 INFO ]: Abstraction has 57 states and 81 transitions. [2018-06-25 10:12:28,769 INFO ]: Interpolant automaton has 12 states. [2018-06-25 10:12:28,769 INFO ]: Start isEmpty. Operand 57 states and 81 transitions. [2018-06-25 10:12:28,770 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 10:12:28,770 INFO ]: Found error trace [2018-06-25 10:12:28,770 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:12:28,770 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:12:28,770 INFO ]: Analyzing trace with hash 1735721358, now seen corresponding path program 1 times [2018-06-25 10:12:28,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:12:28,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:12:28,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:28,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:12:28,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:12:28,780 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:12:28,826 INFO ]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 10:12:28,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:12:28,826 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 10:12:28,827 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:12:28,827 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:12:28,827 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:12:28,827 INFO ]: Start difference. First operand 57 states and 81 transitions. Second operand 5 states. [2018-06-25 10:12:28,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:12:28,853 INFO ]: Finished difference Result 30 states and 38 transitions. [2018-06-25 10:12:28,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:12:28,854 INFO ]: Start accepts. Automaton has 5 states. Word has length 30 [2018-06-25 10:12:28,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:12:28,854 INFO ]: With dead ends: 30 [2018-06-25 10:12:28,854 INFO ]: Without dead ends: 0 [2018-06-25 10:12:28,855 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:12:28,855 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 10:12:28,855 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 10:12:28,855 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 10:12:28,855 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 10:12:28,855 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-06-25 10:12:28,855 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:12:28,855 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 10:12:28,855 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:12:28,855 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 10:12:28,855 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 10:12:28,859 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 10:12:28 BoogieIcfgContainer [2018-06-25 10:12:28,859 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 10:12:28,860 INFO ]: Toolchain (without parser) took 5583.60 ms. Allocated memory was 308.8 MB in the beginning and 338.2 MB in the end (delta: 29.4 MB). Free memory was 263.2 MB in the beginning and 248.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 44.5 MB. Max. memory is 3.6 GB. [2018-06-25 10:12:28,861 INFO ]: SmtParser took 0.10 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-25 10:12:28,862 INFO ]: ChcToBoogie took 63.20 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:12:28,862 INFO ]: Boogie Preprocessor took 41.13 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:12:28,863 INFO ]: RCFGBuilder took 433.00 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 247.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:12:28,863 INFO ]: TraceAbstraction took 5037.27 ms. Allocated memory was 308.8 MB in the beginning and 338.2 MB in the end (delta: 29.4 MB). Free memory was 247.2 MB in the beginning and 248.0 MB in the end (delta: -821.3 kB). Peak memory consumption was 28.5 MB. Max. memory is 3.6 GB. [2018-06-25 10:12:28,866 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 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 63.20 ms. Allocated memory is still 308.8 MB. Free memory was 263.2 MB in the beginning and 261.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 41.13 ms. Allocated memory is still 308.8 MB. Free memory was 261.2 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 433.00 ms. Allocated memory is still 308.8 MB. Free memory was 259.2 MB in the beginning and 247.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5037.27 ms. Allocated memory was 308.8 MB in the beginning and 338.2 MB in the end (delta: 29.4 MB). Free memory was 247.2 MB in the beginning and 248.0 MB in the end (delta: -821.3 kB). Peak memory consumption was 28.5 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, 28 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 513 SDtfs, 362 SDslu, 808 SDs, 0 SdLazy, 438 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 125 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 12899 SizeOfPredicates, 10 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 93/97 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__limit2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_10-12-28-877.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_10-12-28-877.csv Received shutdown request...