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/hopv/lia/termination/Ackermann02.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:34:16,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:34:16,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:34:16,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:34:16,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:34:16,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:34:16,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:34:16,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:34:16,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:34:16,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:34:16,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:34:16,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:34:16,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:34:16,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:34:16,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:34:16,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:34:16,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:34:16,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:34:16,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:34:16,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:34:16,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:34:16,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:34:16,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:34:16,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:34:16,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:34:16,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:34:16,924 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:34:16,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:34:16,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:34:16,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:34:16,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:34:16,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:34:16,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:34:16,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:34:16,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:34:16,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:34:16,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:34:16,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:34:16,945 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:34:16,945 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:34:16,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:34:16,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:34:16,946 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:34:16,947 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:34:16,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:34:16,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:34:16,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:34:16,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:34:16,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:34:16,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:34:16,948 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:34:16,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:34:16,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:34:16,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:34:16,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:34:16,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:34:16,949 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:34:16,950 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:34:16,950 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:34:16,997 INFO ]: Repository-Root is: /tmp [2018-06-25 09:34:17,011 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:34:17,018 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:34:17,019 INFO ]: Initializing SmtParser... [2018-06-25 09:34:17,019 INFO ]: SmtParser initialized [2018-06-25 09:34:17,020 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann02.smt2 [2018-06-25 09:34:17,021 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:34:17,113 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann02.smt2 unknown [2018-06-25 09:34:17,613 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann02.smt2 [2018-06-25 09:34:17,618 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:34:17,623 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:34:17,623 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:34:17,623 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:34:17,623 INFO ]: ChcToBoogie initialized [2018-06-25 09:34:17,626 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,689 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17 Unit [2018-06-25 09:34:17,689 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:34:17,690 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:34:17,690 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:34:17,690 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:34:17,710 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,710 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,725 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,725 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,737 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,740 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,742 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... [2018-06-25 09:34:17,745 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:34:17,746 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:34:17,746 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:34:17,746 INFO ]: RCFGBuilder initialized [2018-06-25 09:34:17,747 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:34:17,757 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:34:17,757 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:34:17,758 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:34:17,758 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:34:17,758 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:34:17,758 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 09:34:18,732 INFO ]: Using library mode [2018-06-25 09:34:18,735 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:34:18 BoogieIcfgContainer [2018-06-25 09:34:18,735 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:34:18,736 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:34:18,736 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:34:18,739 INFO ]: TraceAbstraction initialized [2018-06-25 09:34:18,740 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:34:17" (1/3) ... [2018-06-25 09:34:18,741 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62471b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:34:18, skipping insertion in model container [2018-06-25 09:34:18,741 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:34:17" (2/3) ... [2018-06-25 09:34:18,741 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62471b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:34:18, skipping insertion in model container [2018-06-25 09:34:18,741 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:34:18" (3/3) ... [2018-06-25 09:34:18,744 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:34:18,752 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:34:18,759 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:34:18,799 INFO ]: Using default assertion order modulation [2018-06-25 09:34:18,799 INFO ]: Interprodecural is true [2018-06-25 09:34:18,799 INFO ]: Hoare is false [2018-06-25 09:34:18,800 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:34:18,800 INFO ]: Backedges is TWOTRACK [2018-06-25 09:34:18,800 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:34:18,800 INFO ]: Difference is false [2018-06-25 09:34:18,800 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:34:18,800 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:34:18,814 INFO ]: Start isEmpty. Operand 48 states. [2018-06-25 09:34:18,827 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:34:18,827 INFO ]: Found error trace [2018-06-25 09:34:18,828 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:18,829 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:18,835 INFO ]: Analyzing trace with hash 1136191808, now seen corresponding path program 1 times [2018-06-25 09:34:18,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:18,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:18,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:18,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:18,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:18,924 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:19,032 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:34:19,035 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:19,036 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:34:19,037 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:34:19,053 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:34:19,054 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:34:19,063 INFO ]: Start difference. First operand 48 states. Second operand 4 states. [2018-06-25 09:34:19,930 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:19,930 INFO ]: Finished difference Result 88 states and 143 transitions. [2018-06-25 09:34:19,930 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:34:19,932 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:34:19,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:19,950 INFO ]: With dead ends: 88 [2018-06-25 09:34:19,950 INFO ]: Without dead ends: 85 [2018-06-25 09:34:19,952 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 09:34:19,971 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-25 09:34:20,010 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-06-25 09:34:20,012 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-25 09:34:20,017 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2018-06-25 09:34:20,018 INFO ]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 8 [2018-06-25 09:34:20,019 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:20,019 INFO ]: Abstraction has 85 states and 137 transitions. [2018-06-25 09:34:20,019 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:34:20,019 INFO ]: Start isEmpty. Operand 85 states and 137 transitions. [2018-06-25 09:34:20,023 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:34:20,023 INFO ]: Found error trace [2018-06-25 09:34:20,023 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:20,023 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:20,023 INFO ]: Analyzing trace with hash -750846056, now seen corresponding path program 1 times [2018-06-25 09:34:20,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:20,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:20,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:20,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:20,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:20,041 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:20,099 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:34:20,099 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:20,099 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:34:20,100 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:34:20,101 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:34:20,101 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:34:20,101 INFO ]: Start difference. First operand 85 states and 137 transitions. Second operand 4 states. [2018-06-25 09:34:20,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:20,904 INFO ]: Finished difference Result 120 states and 193 transitions. [2018-06-25 09:34:20,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:34:20,905 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:34:20,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:20,911 INFO ]: With dead ends: 120 [2018-06-25 09:34:20,911 INFO ]: Without dead ends: 120 [2018-06-25 09:34:20,911 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:34:20,912 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-25 09:34:20,930 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-06-25 09:34:20,930 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-25 09:34:20,935 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 193 transitions. [2018-06-25 09:34:20,935 INFO ]: Start accepts. Automaton has 120 states and 193 transitions. Word has length 11 [2018-06-25 09:34:20,936 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:20,936 INFO ]: Abstraction has 120 states and 193 transitions. [2018-06-25 09:34:20,936 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:34:20,936 INFO ]: Start isEmpty. Operand 120 states and 193 transitions. [2018-06-25 09:34:20,939 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:34:20,940 INFO ]: Found error trace [2018-06-25 09:34:20,940 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:20,940 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:20,940 INFO ]: Analyzing trace with hash 1966055172, now seen corresponding path program 1 times [2018-06-25 09:34:20,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:20,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:20,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:20,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:20,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:20,951 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:21,010 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:34:21,010 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:21,010 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:34:21,010 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:34:21,010 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:34:21,010 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:34:21,011 INFO ]: Start difference. First operand 120 states and 193 transitions. Second operand 4 states. [2018-06-25 09:34:21,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:21,473 INFO ]: Finished difference Result 147 states and 235 transitions. [2018-06-25 09:34:21,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:34:21,474 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:34:21,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:21,478 INFO ]: With dead ends: 147 [2018-06-25 09:34:21,478 INFO ]: Without dead ends: 147 [2018-06-25 09:34:21,479 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 09:34:21,479 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-25 09:34:21,495 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-06-25 09:34:21,495 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-25 09:34:21,500 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 235 transitions. [2018-06-25 09:34:21,501 INFO ]: Start accepts. Automaton has 147 states and 235 transitions. Word has length 13 [2018-06-25 09:34:21,501 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:21,501 INFO ]: Abstraction has 147 states and 235 transitions. [2018-06-25 09:34:21,501 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:34:21,501 INFO ]: Start isEmpty. Operand 147 states and 235 transitions. [2018-06-25 09:34:21,504 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:34:21,504 INFO ]: Found error trace [2018-06-25 09:34:21,504 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:21,504 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:21,504 INFO ]: Analyzing trace with hash 13996599, now seen corresponding path program 1 times [2018-06-25 09:34:21,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:21,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:21,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:21,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:21,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:21,535 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:21,773 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:34:21,774 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:21,774 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:34:21,774 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:34:21,774 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:34:21,774 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:34:21,774 INFO ]: Start difference. First operand 147 states and 235 transitions. Second operand 4 states. [2018-06-25 09:34:22,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:22,151 INFO ]: Finished difference Result 335 states and 678 transitions. [2018-06-25 09:34:22,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:34:22,152 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-25 09:34:22,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:22,185 INFO ]: With dead ends: 335 [2018-06-25 09:34:22,186 INFO ]: Without dead ends: 335 [2018-06-25 09:34:22,188 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:34:22,189 INFO ]: Start minimizeSevpa. Operand 335 states. [2018-06-25 09:34:22,256 INFO ]: Finished minimizeSevpa. Reduced states from 335 to 155. [2018-06-25 09:34:22,257 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-25 09:34:22,260 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 247 transitions. [2018-06-25 09:34:22,260 INFO ]: Start accepts. Automaton has 155 states and 247 transitions. Word has length 16 [2018-06-25 09:34:22,260 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:22,260 INFO ]: Abstraction has 155 states and 247 transitions. [2018-06-25 09:34:22,261 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:34:22,261 INFO ]: Start isEmpty. Operand 155 states and 247 transitions. [2018-06-25 09:34:22,269 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:34:22,269 INFO ]: Found error trace [2018-06-25 09:34:22,269 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:22,269 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:22,270 INFO ]: Analyzing trace with hash 1588996046, now seen corresponding path program 1 times [2018-06-25 09:34:22,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:22,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:22,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:22,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:22,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:22,324 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:22,378 INFO ]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:34:22,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:34:22,378 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 09:34:22,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:22,457 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:22,464 INFO ]: Computing forward predicates... [2018-06-25 09:34:22,538 INFO ]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:34:22,558 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:34:22,558 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 09:34:22,558 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:34:22,558 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:34:22,558 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:34:22,558 INFO ]: Start difference. First operand 155 states and 247 transitions. Second operand 5 states. [2018-06-25 09:34:23,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:23,083 INFO ]: Finished difference Result 215 states and 407 transitions. [2018-06-25 09:34:23,084 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:34:23,084 INFO ]: Start accepts. Automaton has 5 states. Word has length 27 [2018-06-25 09:34:23,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:23,093 INFO ]: With dead ends: 215 [2018-06-25 09:34:23,093 INFO ]: Without dead ends: 212 [2018-06-25 09:34:23,094 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:34:23,094 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-25 09:34:23,123 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 155. [2018-06-25 09:34:23,127 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-25 09:34:23,132 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2018-06-25 09:34:23,133 INFO ]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 27 [2018-06-25 09:34:23,133 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:23,133 INFO ]: Abstraction has 155 states and 244 transitions. [2018-06-25 09:34:23,133 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:34:23,133 INFO ]: Start isEmpty. Operand 155 states and 244 transitions. [2018-06-25 09:34:23,138 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 09:34:23,138 INFO ]: Found error trace [2018-06-25 09:34:23,138 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:23,138 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:23,139 INFO ]: Analyzing trace with hash 2105326922, now seen corresponding path program 1 times [2018-06-25 09:34:23,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:23,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:23,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:23,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:23,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:23,202 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:23,459 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-06-25 09:34:23,660 INFO ]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:34:23,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:34:23,660 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 09:34:23,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:23,735 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:23,739 INFO ]: Computing forward predicates... [2018-06-25 09:34:23,889 INFO ]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:34:23,924 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:34:23,924 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-06-25 09:34:23,924 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:34:23,924 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:34:23,924 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:34:23,924 INFO ]: Start difference. First operand 155 states and 244 transitions. Second operand 10 states. [2018-06-25 09:34:27,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:27,513 INFO ]: Finished difference Result 612 states and 2030 transitions. [2018-06-25 09:34:27,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:34:27,513 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-25 09:34:27,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:27,556 INFO ]: With dead ends: 612 [2018-06-25 09:34:27,556 INFO ]: Without dead ends: 593 [2018-06-25 09:34:27,556 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:34:27,557 INFO ]: Start minimizeSevpa. Operand 593 states. [2018-06-25 09:34:27,795 INFO ]: Finished minimizeSevpa. Reduced states from 593 to 188. [2018-06-25 09:34:27,795 INFO ]: Start removeUnreachable. Operand 188 states. [2018-06-25 09:34:27,799 INFO ]: Finished removeUnreachable. Reduced from 188 states to 188 states and 313 transitions. [2018-06-25 09:34:27,799 INFO ]: Start accepts. Automaton has 188 states and 313 transitions. Word has length 27 [2018-06-25 09:34:27,799 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:27,799 INFO ]: Abstraction has 188 states and 313 transitions. [2018-06-25 09:34:27,799 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:34:27,799 INFO ]: Start isEmpty. Operand 188 states and 313 transitions. [2018-06-25 09:34:27,802 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:34:27,802 INFO ]: Found error trace [2018-06-25 09:34:27,802 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:27,802 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:27,802 INFO ]: Analyzing trace with hash 753207280, now seen corresponding path program 1 times [2018-06-25 09:34:27,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:27,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:27,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:27,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:27,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:27,820 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:27,874 INFO ]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:34:27,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:27,875 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:34:27,875 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:34:27,875 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:34:27,875 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:34:27,875 INFO ]: Start difference. First operand 188 states and 313 transitions. Second operand 4 states. [2018-06-25 09:34:28,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:28,179 INFO ]: Finished difference Result 232 states and 392 transitions. [2018-06-25 09:34:28,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:34:28,179 INFO ]: Start accepts. Automaton has 4 states. Word has length 28 [2018-06-25 09:34:28,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:28,182 INFO ]: With dead ends: 232 [2018-06-25 09:34:28,182 INFO ]: Without dead ends: 174 [2018-06-25 09:34:28,182 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:34:28,182 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-25 09:34:28,193 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-06-25 09:34:28,194 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-25 09:34:28,196 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 283 transitions. [2018-06-25 09:34:28,196 INFO ]: Start accepts. Automaton has 174 states and 283 transitions. Word has length 28 [2018-06-25 09:34:28,196 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:28,196 INFO ]: Abstraction has 174 states and 283 transitions. [2018-06-25 09:34:28,196 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:34:28,196 INFO ]: Start isEmpty. Operand 174 states and 283 transitions. [2018-06-25 09:34:28,204 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:34:28,205 INFO ]: Found error trace [2018-06-25 09:34:28,205 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:28,205 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:28,205 INFO ]: Analyzing trace with hash -487208218, now seen corresponding path program 1 times [2018-06-25 09:34:28,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:28,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:28,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:28,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:28,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:28,231 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:28,278 INFO ]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-25 09:34:28,278 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:28,278 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:34:28,278 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:34:28,279 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:34:28,279 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:34:28,279 INFO ]: Start difference. First operand 174 states and 283 transitions. Second operand 5 states. [2018-06-25 09:34:28,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:28,441 INFO ]: Finished difference Result 256 states and 562 transitions. [2018-06-25 09:34:28,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:34:28,441 INFO ]: Start accepts. Automaton has 5 states. Word has length 45 [2018-06-25 09:34:28,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:28,447 INFO ]: With dead ends: 256 [2018-06-25 09:34:28,447 INFO ]: Without dead ends: 256 [2018-06-25 09:34:28,447 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:34:28,447 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-25 09:34:28,466 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 167. [2018-06-25 09:34:28,466 INFO ]: Start removeUnreachable. Operand 167 states. [2018-06-25 09:34:28,468 INFO ]: Finished removeUnreachable. Reduced from 167 states to 167 states and 269 transitions. [2018-06-25 09:34:28,468 INFO ]: Start accepts. Automaton has 167 states and 269 transitions. Word has length 45 [2018-06-25 09:34:28,468 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:28,468 INFO ]: Abstraction has 167 states and 269 transitions. [2018-06-25 09:34:28,468 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:34:28,468 INFO ]: Start isEmpty. Operand 167 states and 269 transitions. [2018-06-25 09:34:28,472 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-25 09:34:28,472 INFO ]: Found error trace [2018-06-25 09:34:28,472 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:28,472 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:28,473 INFO ]: Analyzing trace with hash -860994586, now seen corresponding path program 1 times [2018-06-25 09:34:28,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:28,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:28,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:28,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:28,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:28,491 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:28,640 INFO ]: Checked inductivity of 37 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 09:34:28,640 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:28,640 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:34:28,641 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:34:28,641 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:34:28,641 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:34:28,641 INFO ]: Start difference. First operand 167 states and 269 transitions. Second operand 4 states. [2018-06-25 09:34:28,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:28,813 INFO ]: Finished difference Result 230 states and 375 transitions. [2018-06-25 09:34:28,813 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:34:28,813 INFO ]: Start accepts. Automaton has 4 states. Word has length 45 [2018-06-25 09:34:28,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:28,816 INFO ]: With dead ends: 230 [2018-06-25 09:34:28,816 INFO ]: Without dead ends: 204 [2018-06-25 09:34:28,816 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 09:34:28,817 INFO ]: Start minimizeSevpa. Operand 204 states. [2018-06-25 09:34:28,829 INFO ]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-06-25 09:34:28,829 INFO ]: Start removeUnreachable. Operand 204 states. [2018-06-25 09:34:28,831 INFO ]: Finished removeUnreachable. Reduced from 204 states to 204 states and 327 transitions. [2018-06-25 09:34:28,831 INFO ]: Start accepts. Automaton has 204 states and 327 transitions. Word has length 45 [2018-06-25 09:34:28,831 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:28,831 INFO ]: Abstraction has 204 states and 327 transitions. [2018-06-25 09:34:28,831 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:34:28,831 INFO ]: Start isEmpty. Operand 204 states and 327 transitions. [2018-06-25 09:34:28,839 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-25 09:34:28,839 INFO ]: Found error trace [2018-06-25 09:34:28,840 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:28,840 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:28,840 INFO ]: Analyzing trace with hash -356304554, now seen corresponding path program 1 times [2018-06-25 09:34:28,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:28,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:28,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:28,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:28,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:28,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:28,982 INFO ]: Checked inductivity of 100 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-25 09:34:28,982 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:34:28,982 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 09:34:28,982 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:34:28,982 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:34:28,982 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:34:28,982 INFO ]: Start difference. First operand 204 states and 327 transitions. Second operand 7 states. [2018-06-25 09:34:30,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:30,081 INFO ]: Finished difference Result 675 states and 1737 transitions. [2018-06-25 09:34:30,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:34:30,082 INFO ]: Start accepts. Automaton has 7 states. Word has length 69 [2018-06-25 09:34:30,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:30,101 INFO ]: With dead ends: 675 [2018-06-25 09:34:30,101 INFO ]: Without dead ends: 649 [2018-06-25 09:34:30,102 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:34:30,102 INFO ]: Start minimizeSevpa. Operand 649 states. [2018-06-25 09:34:30,157 INFO ]: Finished minimizeSevpa. Reduced states from 649 to 349. [2018-06-25 09:34:30,157 INFO ]: Start removeUnreachable. Operand 349 states. [2018-06-25 09:34:30,161 INFO ]: Finished removeUnreachable. Reduced from 349 states to 349 states and 572 transitions. [2018-06-25 09:34:30,161 INFO ]: Start accepts. Automaton has 349 states and 572 transitions. Word has length 69 [2018-06-25 09:34:30,161 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:30,161 INFO ]: Abstraction has 349 states and 572 transitions. [2018-06-25 09:34:30,161 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:34:30,161 INFO ]: Start isEmpty. Operand 349 states and 572 transitions. [2018-06-25 09:34:30,174 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-25 09:34:30,174 INFO ]: Found error trace [2018-06-25 09:34:30,174 INFO ]: trace histogram [6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:30,174 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:30,175 INFO ]: Analyzing trace with hash -2007333348, now seen corresponding path program 1 times [2018-06-25 09:34:30,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:30,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:30,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:30,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:30,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:30,207 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:30,427 INFO ]: Checked inductivity of 142 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-25 09:34:30,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:34:30,427 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:34:30,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:30,527 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:30,533 INFO ]: Computing forward predicates... [2018-06-25 09:34:30,555 INFO ]: Checked inductivity of 142 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-25 09:34:30,575 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:34:30,575 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-06-25 09:34:30,575 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:34:30,575 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:34:30,575 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:34:30,575 INFO ]: Start difference. First operand 349 states and 572 transitions. Second operand 12 states. [2018-06-25 09:34:34,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:34,522 INFO ]: Finished difference Result 828 states and 2128 transitions. [2018-06-25 09:34:34,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 09:34:34,522 INFO ]: Start accepts. Automaton has 12 states. Word has length 80 [2018-06-25 09:34:34,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:34,546 INFO ]: With dead ends: 828 [2018-06-25 09:34:34,546 INFO ]: Without dead ends: 798 [2018-06-25 09:34:34,547 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=507, Invalid=2799, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 09:34:34,547 INFO ]: Start minimizeSevpa. Operand 798 states. [2018-06-25 09:34:34,612 INFO ]: Finished minimizeSevpa. Reduced states from 798 to 391. [2018-06-25 09:34:34,612 INFO ]: Start removeUnreachable. Operand 391 states. [2018-06-25 09:34:34,617 INFO ]: Finished removeUnreachable. Reduced from 391 states to 391 states and 638 transitions. [2018-06-25 09:34:34,618 INFO ]: Start accepts. Automaton has 391 states and 638 transitions. Word has length 80 [2018-06-25 09:34:34,618 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:34,618 INFO ]: Abstraction has 391 states and 638 transitions. [2018-06-25 09:34:34,618 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:34:34,618 INFO ]: Start isEmpty. Operand 391 states and 638 transitions. [2018-06-25 09:34:34,631 INFO ]: Finished isEmpty. Found accepting run of length 92 [2018-06-25 09:34:34,631 INFO ]: Found error trace [2018-06-25 09:34:34,631 INFO ]: trace histogram [7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:34,632 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:34,632 INFO ]: Analyzing trace with hash 1662714961, now seen corresponding path program 1 times [2018-06-25 09:34:34,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:34,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:34,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:34,632 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:34,632 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:34,672 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:34,960 INFO ]: Checked inductivity of 191 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-06-25 09:34:34,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:34:34,960 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-25 09:34:34,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:35,086 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:35,094 INFO ]: Computing forward predicates... [2018-06-25 09:34:35,189 INFO ]: Checked inductivity of 191 backedges. 82 proven. 6 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-06-25 09:34:35,209 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:34:35,209 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-25 09:34:35,209 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:34:35,209 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:34:35,209 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:34:35,210 INFO ]: Start difference. First operand 391 states and 638 transitions. Second operand 15 states. [2018-06-25 09:34:36,728 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 09:34:42,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:34:42,167 INFO ]: Finished difference Result 1104 states and 3353 transitions. [2018-06-25 09:34:42,168 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-06-25 09:34:42,168 INFO ]: Start accepts. Automaton has 15 states. Word has length 91 [2018-06-25 09:34:42,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:34:42,192 INFO ]: With dead ends: 1104 [2018-06-25 09:34:42,192 INFO ]: Without dead ends: 1104 [2018-06-25 09:34:42,195 INFO ]: 0 DeclaredPredicates, 196 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=653, Invalid=5353, Unknown=0, NotChecked=0, Total=6006 [2018-06-25 09:34:42,195 INFO ]: Start minimizeSevpa. Operand 1104 states. [2018-06-25 09:34:42,279 INFO ]: Finished minimizeSevpa. Reduced states from 1104 to 427. [2018-06-25 09:34:42,279 INFO ]: Start removeUnreachable. Operand 427 states. [2018-06-25 09:34:42,284 INFO ]: Finished removeUnreachable. Reduced from 427 states to 427 states and 715 transitions. [2018-06-25 09:34:42,285 INFO ]: Start accepts. Automaton has 427 states and 715 transitions. Word has length 91 [2018-06-25 09:34:42,285 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:34:42,285 INFO ]: Abstraction has 427 states and 715 transitions. [2018-06-25 09:34:42,285 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:34:42,285 INFO ]: Start isEmpty. Operand 427 states and 715 transitions. [2018-06-25 09:34:42,302 INFO ]: Finished isEmpty. Found accepting run of length 104 [2018-06-25 09:34:42,302 INFO ]: Found error trace [2018-06-25 09:34:42,303 INFO ]: trace histogram [8, 8, 8, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:34:42,303 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:34:42,305 INFO ]: Analyzing trace with hash -2109238317, now seen corresponding path program 1 times [2018-06-25 09:34:42,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:34:42,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:34:42,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:42,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:42,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:34:42,348 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:42,641 INFO ]: Checked inductivity of 264 backedges. 109 proven. 22 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-06-25 09:34:42,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:34:42,641 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:34:42,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:34:42,827 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:34:42,840 INFO ]: Computing forward predicates... [2018-06-25 09:34:43,127 INFO ]: Checked inductivity of 264 backedges. 77 proven. 63 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-25 09:34:43,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:34:43,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-06-25 09:34:43,150 INFO ]: Interpolant automaton has 23 states [2018-06-25 09:34:43,150 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 09:34:43,151 INFO ]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:34:43,151 INFO ]: Start difference. First operand 427 states and 715 transitions. Second operand 23 states. [2018-06-25 09:34:46,133 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 09:34:47,351 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 09:34:47,797 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 09:34:48,691 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 Received shutdown request... [2018-06-25 09:35:18,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2018-06-25 09:35:18,155 WARN ]: Verification canceled [2018-06-25 09:35:18,159 WARN ]: Timeout [2018-06-25 09:35:18,159 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:35:18 BoogieIcfgContainer [2018-06-25 09:35:18,159 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:35:18,160 INFO ]: Toolchain (without parser) took 60541.64 ms. Allocated memory was 306.2 MB in the beginning and 1.0 GB in the end (delta: 720.9 MB). Free memory was 242.7 MB in the beginning and 662.0 MB in the end (delta: -419.2 MB). Peak memory consumption was 301.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:18,160 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:35:18,160 INFO ]: ChcToBoogie took 66.60 ms. Allocated memory is still 306.2 MB. Free memory was 242.7 MB in the beginning and 239.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:18,161 INFO ]: Boogie Preprocessor took 55.42 ms. Allocated memory is still 306.2 MB. Free memory was 239.7 MB in the beginning and 237.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:18,161 INFO ]: RCFGBuilder took 988.78 ms. Allocated memory is still 306.2 MB. Free memory was 237.7 MB in the beginning and 205.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:18,161 INFO ]: TraceAbstraction took 59423.01 ms. Allocated memory was 306.2 MB in the beginning and 1.0 GB in the end (delta: 720.9 MB). Free memory was 205.8 MB in the beginning and 662.0 MB in the end (delta: -456.2 MB). Peak memory consumption was 264.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:18,163 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.2 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.60 ms. Allocated memory is still 306.2 MB. Free memory was 242.7 MB in the beginning and 239.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 55.42 ms. Allocated memory is still 306.2 MB. Free memory was 239.7 MB in the beginning and 237.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 988.78 ms. Allocated memory is still 306.2 MB. Free memory was 237.7 MB in the beginning and 205.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59423.01 ms. Allocated memory was 306.2 MB in the beginning and 1.0 GB in the end (delta: 720.9 MB). Free memory was 205.8 MB in the beginning and 662.0 MB in the end (delta: -456.2 MB). Peak memory consumption was 264.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (427states) and interpolant automaton (currently 430 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (4816 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. TIMEOUT Result, 59.3s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 54.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2779 SDtfs, 2455 SDslu, 13867 SDs, 0 SdLazy, 44572 SolverSat, 8577 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1114 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 646 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90943 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=12, 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.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 2115 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 105834 SizeOfPredicates, 26 NumberOfNonLiveVariables, 3756 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 1306/1414 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann02.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-35-18-172.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann02.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-35-18-172.csv Completed graceful shutdown