java -Xss1g -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_No_Goto.epf -i /storage/chc-comp/hopv/lia/fpice/inductive.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:25:35,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:25:35,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:25:35,723 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:25:35,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:25:35,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:25:35,726 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:25:35,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:25:35,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:25:35,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:25:35,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:25:35,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:25:35,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:25:35,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:25:35,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:25:35,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:25:35,737 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:25:35,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:25:35,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:25:35,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:25:35,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:25:35,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:25:35,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:25:35,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:25:35,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:25:35,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:25:35,764 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:25:35,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:25:35,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:25:35,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:25:35,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:25:35,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:25:35,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:25:35,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:25:35,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:25:35,771 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:25:35,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:25:35,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:25:35,786 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:25:35,786 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:25:35,787 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:25:35,787 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:25:35,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:25:35,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:25:35,787 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:25:35,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:25:35,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:25:35,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:25:35,788 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:25:35,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:25:35,789 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:25:35,789 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:25:35,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:25:35,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:25:35,789 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:25:35,791 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:25:35,791 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:25:35,834 INFO ]: Repository-Root is: /tmp [2018-06-22 11:25:35,847 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:25:35,850 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:25:35,854 INFO ]: Initializing SmtParser... [2018-06-22 11:25:35,854 INFO ]: SmtParser initialized [2018-06-22 11:25:35,855 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/fpice/inductive.smt2 [2018-06-22 11:25:35,856 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-22 11:25:35,951 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/fpice/inductive.smt2 unknown [2018-06-22 11:25:36,189 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/fpice/inductive.smt2 [2018-06-22 11:25:36,195 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:25:36,200 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:25:36,201 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:25:36,201 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:25:36,201 INFO ]: ChcToBoogie initialized [2018-06-22 11:25:36,204 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,247 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36 Unit [2018-06-22 11:25:36,247 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:25:36,248 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:25:36,248 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:25:36,248 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:25:36,264 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,264 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,271 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,271 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,274 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,276 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,277 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (1/1) ... [2018-06-22 11:25:36,278 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:25:36,279 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:25:36,279 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:25:36,279 INFO ]: RCFGBuilder initialized [2018-06-22 11:25:36,280 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (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-22 11:25:36,290 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:25:36,290 INFO ]: Found specification of procedure False [2018-06-22 11:25:36,290 INFO ]: Found implementation of procedure False [2018-06-22 11:25:36,290 INFO ]: Specification and implementation of procedure loopDLRunknownCLN3 given in one single declaration [2018-06-22 11:25:36,290 INFO ]: Found specification of procedure loopDLRunknownCLN3 [2018-06-22 11:25:36,290 INFO ]: Found implementation of procedure loopDLRunknownCLN3 [2018-06-22 11:25:36,290 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:25:36,290 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:25:36,290 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-22 11:25:36,616 INFO ]: Using library mode [2018-06-22 11:25:36,617 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:25:36 BoogieIcfgContainer [2018-06-22 11:25:36,617 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:25:36,618 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:25:36,618 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:25:36,625 INFO ]: TraceAbstraction initialized [2018-06-22 11:25:36,626 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:25:36" (1/3) ... [2018-06-22 11:25:36,626 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b899ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:25:36, skipping insertion in model container [2018-06-22 11:25:36,627 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:25:36" (2/3) ... [2018-06-22 11:25:36,627 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b899ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:25:36, skipping insertion in model container [2018-06-22 11:25:36,627 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:25:36" (3/3) ... [2018-06-22 11:25:36,629 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:25:36,636 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:25:36,643 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:25:36,681 INFO ]: Using default assertion order modulation [2018-06-22 11:25:36,681 INFO ]: Interprodecural is true [2018-06-22 11:25:36,681 INFO ]: Hoare is false [2018-06-22 11:25:36,681 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:25:36,681 INFO ]: Backedges is TWOTRACK [2018-06-22 11:25:36,681 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:25:36,681 INFO ]: Difference is false [2018-06-22 11:25:36,681 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:25:36,682 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:25:36,694 INFO ]: Start isEmpty. Operand 17 states. [2018-06-22 11:25:36,704 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:25:36,704 INFO ]: Found error trace [2018-06-22 11:25:36,705 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:25:36,705 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:36,710 INFO ]: Analyzing trace with hash 102253829, now seen corresponding path program 1 times [2018-06-22 11:25:36,711 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:36,711 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:36,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:36,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:36,742 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:36,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:36,778 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:25:36,780 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:36,780 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:25:36,782 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:25:36,794 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:25:36,794 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:25:36,796 INFO ]: Start difference. First operand 17 states. Second operand 2 states. [2018-06-22 11:25:36,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:36,817 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-22 11:25:36,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:25:36,818 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:25:36,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:36,833 INFO ]: With dead ends: 15 [2018-06-22 11:25:36,833 INFO ]: Without dead ends: 15 [2018-06-22 11:25:36,835 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:25:36,852 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:25:36,882 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:25:36,883 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:25:36,884 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-22 11:25:36,885 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 5 [2018-06-22 11:25:36,886 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:36,886 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-22 11:25:36,886 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:25:36,886 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-22 11:25:36,887 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:25:36,887 INFO ]: Found error trace [2018-06-22 11:25:36,887 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:36,887 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:36,887 INFO ]: Analyzing trace with hash 1789993902, now seen corresponding path program 1 times [2018-06-22 11:25:36,887 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:36,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:36,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:36,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:36,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:36,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:36,966 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:25:36,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:36,967 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:36,968 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:36,968 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:36,968 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:36,968 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 4 states. [2018-06-22 11:25:37,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:37,063 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 11:25:37,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:37,063 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:25:37,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:37,064 INFO ]: With dead ends: 19 [2018-06-22 11:25:37,064 INFO ]: Without dead ends: 19 [2018-06-22 11:25:37,065 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:37,065 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:25:37,073 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:25:37,073 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:25:37,073 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2018-06-22 11:25:37,074 INFO ]: Start accepts. Automaton has 17 states and 29 transitions. Word has length 9 [2018-06-22 11:25:37,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:37,074 INFO ]: Abstraction has 17 states and 29 transitions. [2018-06-22 11:25:37,074 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:37,074 INFO ]: Start isEmpty. Operand 17 states and 29 transitions. [2018-06-22 11:25:37,075 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:25:37,075 INFO ]: Found error trace [2018-06-22 11:25:37,075 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:37,076 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:37,076 INFO ]: Analyzing trace with hash 203263859, now seen corresponding path program 1 times [2018-06-22 11:25:37,076 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:37,076 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:37,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:37,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:37,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:37,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:37,148 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:25:37,148 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:37,148 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:37,148 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:37,148 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:37,148 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:37,148 INFO ]: Start difference. First operand 17 states and 29 transitions. Second operand 4 states. [2018-06-22 11:25:37,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:37,294 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:25:37,295 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:37,295 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:25:37,295 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:37,296 INFO ]: With dead ends: 19 [2018-06-22 11:25:37,296 INFO ]: Without dead ends: 19 [2018-06-22 11:25:37,296 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:37,296 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:25:37,300 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:25:37,300 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:25:37,301 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-22 11:25:37,301 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 13 [2018-06-22 11:25:37,301 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:37,301 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-22 11:25:37,301 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:37,301 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-22 11:25:37,302 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:25:37,302 INFO ]: Found error trace [2018-06-22 11:25:37,302 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:37,303 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:37,303 INFO ]: Analyzing trace with hash 194282840, now seen corresponding path program 1 times [2018-06-22 11:25:37,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:37,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:37,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:37,304 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:37,304 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:37,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:37,376 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:25:37,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:37,377 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:37,377 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:37,377 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:37,377 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:37,377 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 4 states. [2018-06-22 11:25:37,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:37,560 INFO ]: Finished difference Result 21 states and 36 transitions. [2018-06-22 11:25:37,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:37,560 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:25:37,560 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:37,561 INFO ]: With dead ends: 21 [2018-06-22 11:25:37,561 INFO ]: Without dead ends: 21 [2018-06-22 11:25:37,562 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:37,562 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:25:37,567 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:25:37,567 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:25:37,568 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-06-22 11:25:37,568 INFO ]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 13 [2018-06-22 11:25:37,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:37,568 INFO ]: Abstraction has 19 states and 34 transitions. [2018-06-22 11:25:37,568 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:37,568 INFO ]: Start isEmpty. Operand 19 states and 34 transitions. [2018-06-22 11:25:37,569 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:25:37,569 INFO ]: Found error trace [2018-06-22 11:25:37,569 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:37,569 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:37,569 INFO ]: Analyzing trace with hash 1713939613, now seen corresponding path program 1 times [2018-06-22 11:25:37,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:37,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:37,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:37,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:37,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:37,581 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:37,643 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:25:37,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:37,643 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-22 11:25:37,651 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:37,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:37,691 INFO ]: Computing forward predicates... [2018-06-22 11:25:37,894 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:25:37,924 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:37,924 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-22 11:25:37,925 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:25:37,925 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:25:37,925 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:25:37,925 INFO ]: Start difference. First operand 19 states and 34 transitions. Second operand 9 states. [2018-06-22 11:25:38,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:38,749 INFO ]: Finished difference Result 27 states and 49 transitions. [2018-06-22 11:25:38,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:25:38,750 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:25:38,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:38,751 INFO ]: With dead ends: 27 [2018-06-22 11:25:38,751 INFO ]: Without dead ends: 25 [2018-06-22 11:25:38,751 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:25:38,751 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:25:38,758 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:25:38,758 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:25:38,759 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 38 transitions. [2018-06-22 11:25:38,759 INFO ]: Start accepts. Automaton has 21 states and 38 transitions. Word has length 17 [2018-06-22 11:25:38,759 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:38,759 INFO ]: Abstraction has 21 states and 38 transitions. [2018-06-22 11:25:38,759 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:25:38,759 INFO ]: Start isEmpty. Operand 21 states and 38 transitions. [2018-06-22 11:25:38,761 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:25:38,761 INFO ]: Found error trace [2018-06-22 11:25:38,761 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:38,761 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:38,761 INFO ]: Analyzing trace with hash -50968013, now seen corresponding path program 1 times [2018-06-22 11:25:38,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:38,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:38,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:38,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:38,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:38,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:38,801 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:25:38,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:38,801 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-22 11:25:38,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:38,825 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:38,826 INFO ]: Computing forward predicates... [2018-06-22 11:25:38,852 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:25:38,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:38,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 11:25:38,873 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:25:38,873 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:25:38,873 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:25:38,874 INFO ]: Start difference. First operand 21 states and 38 transitions. Second operand 7 states. [2018-06-22 11:25:39,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:39,070 INFO ]: Finished difference Result 23 states and 43 transitions. [2018-06-22 11:25:39,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:25:39,070 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:25:39,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:39,071 INFO ]: With dead ends: 23 [2018-06-22 11:25:39,071 INFO ]: Without dead ends: 22 [2018-06-22 11:25:39,072 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:25:39,072 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:25:39,076 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-22 11:25:39,076 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:25:39,077 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2018-06-22 11:25:39,077 INFO ]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 13 [2018-06-22 11:25:39,077 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:39,077 INFO ]: Abstraction has 18 states and 29 transitions. [2018-06-22 11:25:39,077 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:25:39,077 INFO ]: Start isEmpty. Operand 18 states and 29 transitions. [2018-06-22 11:25:39,078 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:25:39,078 INFO ]: Found error trace [2018-06-22 11:25:39,078 INFO ]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:39,078 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:39,079 INFO ]: Analyzing trace with hash -1990351759, now seen corresponding path program 2 times [2018-06-22 11:25:39,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:39,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:39,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:39,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:39,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:39,091 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:39,126 INFO ]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:25:39,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:39,126 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-22 11:25:39,134 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:25:39,161 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:25:39,161 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:39,164 INFO ]: Computing forward predicates... [2018-06-22 11:25:39,177 INFO ]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:25:39,201 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:25:39,201 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 11:25:39,201 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:39,201 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:39,201 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:39,202 INFO ]: Start difference. First operand 18 states and 29 transitions. Second operand 4 states. [2018-06-22 11:25:39,277 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:39,278 INFO ]: Finished difference Result 20 states and 33 transitions. [2018-06-22 11:25:39,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:39,278 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:25:39,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:39,279 INFO ]: With dead ends: 20 [2018-06-22 11:25:39,279 INFO ]: Without dead ends: 20 [2018-06-22 11:25:39,279 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:39,279 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:25:39,285 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:25:39,286 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:25:39,286 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2018-06-22 11:25:39,286 INFO ]: Start accepts. Automaton has 20 states and 33 transitions. Word has length 25 [2018-06-22 11:25:39,286 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:39,287 INFO ]: Abstraction has 20 states and 33 transitions. [2018-06-22 11:25:39,287 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:39,287 INFO ]: Start isEmpty. Operand 20 states and 33 transitions. [2018-06-22 11:25:39,290 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:25:39,290 INFO ]: Found error trace [2018-06-22 11:25:39,290 INFO ]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:39,290 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:39,290 INFO ]: Analyzing trace with hash -867174196, now seen corresponding path program 1 times [2018-06-22 11:25:39,290 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:39,290 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:39,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:39,291 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:39,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:39,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:39,529 INFO ]: Checked inductivity of 31 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:25:39,529 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:39,529 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) [2018-06-22 11:25:39,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:25:39,568 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:39,570 INFO ]: Computing forward predicates... [2018-06-22 11:25:39,708 INFO ]: Checked inductivity of 31 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:25:39,732 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:39,732 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-06-22 11:25:39,732 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:25:39,732 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:25:39,732 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:25:39,732 INFO ]: Start difference. First operand 20 states and 33 transitions. Second operand 14 states. [2018-06-22 11:25:40,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:40,525 INFO ]: Finished difference Result 40 states and 83 transitions. [2018-06-22 11:25:40,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:25:40,526 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:25:40,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:40,527 INFO ]: With dead ends: 40 [2018-06-22 11:25:40,527 INFO ]: Without dead ends: 39 [2018-06-22 11:25:40,527 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:25:40,528 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:25:40,537 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-06-22 11:25:40,537 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:25:40,538 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 66 transitions. [2018-06-22 11:25:40,538 INFO ]: Start accepts. Automaton has 33 states and 66 transitions. Word has length 25 [2018-06-22 11:25:40,538 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:40,538 INFO ]: Abstraction has 33 states and 66 transitions. [2018-06-22 11:25:40,538 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:25:40,538 INFO ]: Start isEmpty. Operand 33 states and 66 transitions. [2018-06-22 11:25:40,540 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:25:40,540 INFO ]: Found error trace [2018-06-22 11:25:40,540 INFO ]: trace histogram [8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:40,540 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:40,540 INFO ]: Analyzing trace with hash -1131396387, now seen corresponding path program 1 times [2018-06-22 11:25:40,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:40,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:40,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:40,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:40,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:40,554 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:40,596 INFO ]: Checked inductivity of 88 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 11:25:40,596 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:40,596 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:40,597 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:40,597 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:40,597 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:40,597 INFO ]: Start difference. First operand 33 states and 66 transitions. Second operand 4 states. [2018-06-22 11:25:40,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:40,613 INFO ]: Finished difference Result 35 states and 70 transitions. [2018-06-22 11:25:40,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:40,613 INFO ]: Start accepts. Automaton has 4 states. Word has length 37 [2018-06-22 11:25:40,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:40,616 INFO ]: With dead ends: 35 [2018-06-22 11:25:40,616 INFO ]: Without dead ends: 32 [2018-06-22 11:25:40,616 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:40,616 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:25:40,623 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:25:40,623 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:25:40,624 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2018-06-22 11:25:40,624 INFO ]: Start accepts. Automaton has 32 states and 59 transitions. Word has length 37 [2018-06-22 11:25:40,625 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:40,625 INFO ]: Abstraction has 32 states and 59 transitions. [2018-06-22 11:25:40,625 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:40,625 INFO ]: Start isEmpty. Operand 32 states and 59 transitions. [2018-06-22 11:25:40,626 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:25:40,626 INFO ]: Found error trace [2018-06-22 11:25:40,626 INFO ]: trace histogram [8, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:40,626 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:40,627 INFO ]: Analyzing trace with hash 207845056, now seen corresponding path program 2 times [2018-06-22 11:25:40,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:40,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:40,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:40,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:25:40,627 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:40,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:40,696 INFO ]: Checked inductivity of 90 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-22 11:25:40,696 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:40,696 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:40,697 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:40,697 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:40,697 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:40,697 INFO ]: Start difference. First operand 32 states and 59 transitions. Second operand 4 states. [2018-06-22 11:25:40,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:40,799 INFO ]: Finished difference Result 35 states and 54 transitions. [2018-06-22 11:25:40,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:40,799 INFO ]: Start accepts. Automaton has 4 states. Word has length 37 [2018-06-22 11:25:40,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:40,800 INFO ]: With dead ends: 35 [2018-06-22 11:25:40,800 INFO ]: Without dead ends: 31 [2018-06-22 11:25:40,800 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:40,800 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:25:40,805 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 11:25:40,805 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:25:40,806 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2018-06-22 11:25:40,806 INFO ]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 37 [2018-06-22 11:25:40,806 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:40,806 INFO ]: Abstraction has 31 states and 47 transitions. [2018-06-22 11:25:40,806 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:40,806 INFO ]: Start isEmpty. Operand 31 states and 47 transitions. [2018-06-22 11:25:40,807 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:25:40,807 INFO ]: Found error trace [2018-06-22 11:25:40,807 INFO ]: trace histogram [7, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:40,807 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:40,808 INFO ]: Analyzing trace with hash 1753698235, now seen corresponding path program 3 times [2018-06-22 11:25:40,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:40,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:40,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:40,808 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:40,808 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:40,824 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:40,912 INFO ]: Checked inductivity of 67 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:25:40,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:25:40,913 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-22 11:25:40,919 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:25:40,965 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:25:40,965 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:40,968 INFO ]: Computing forward predicates... [2018-06-22 11:25:41,047 INFO ]: Checked inductivity of 67 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-22 11:25:41,067 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:25:41,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-06-22 11:25:41,067 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:25:41,067 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:25:41,068 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:25:41,068 INFO ]: Start difference. First operand 31 states and 47 transitions. Second operand 16 states. [2018-06-22 11:25:42,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:42,151 INFO ]: Finished difference Result 57 states and 118 transitions. [2018-06-22 11:25:42,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:25:42,151 INFO ]: Start accepts. Automaton has 16 states. Word has length 33 [2018-06-22 11:25:42,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:42,153 INFO ]: With dead ends: 57 [2018-06-22 11:25:42,153 INFO ]: Without dead ends: 50 [2018-06-22 11:25:42,153 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:25:42,153 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:25:42,165 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 38. [2018-06-22 11:25:42,165 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:25:42,166 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 68 transitions. [2018-06-22 11:25:42,166 INFO ]: Start accepts. Automaton has 38 states and 68 transitions. Word has length 33 [2018-06-22 11:25:42,166 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:42,166 INFO ]: Abstraction has 38 states and 68 transitions. [2018-06-22 11:25:42,166 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:25:42,166 INFO ]: Start isEmpty. Operand 38 states and 68 transitions. [2018-06-22 11:25:42,173 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:25:42,173 INFO ]: Found error trace [2018-06-22 11:25:42,174 INFO ]: trace histogram [7, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:42,174 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:42,174 INFO ]: Analyzing trace with hash 1023383822, now seen corresponding path program 2 times [2018-06-22 11:25:42,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:42,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:42,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:42,175 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:42,175 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:42,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:42,230 INFO ]: Checked inductivity of 66 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-22 11:25:42,230 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:42,230 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:42,230 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:42,231 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:42,231 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:42,231 INFO ]: Start difference. First operand 38 states and 68 transitions. Second operand 4 states. [2018-06-22 11:25:42,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:42,262 INFO ]: Finished difference Result 40 states and 70 transitions. [2018-06-22 11:25:42,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:25:42,266 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-22 11:25:42,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:42,267 INFO ]: With dead ends: 40 [2018-06-22 11:25:42,267 INFO ]: Without dead ends: 30 [2018-06-22 11:25:42,267 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:42,267 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:25:42,271 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:25:42,271 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:25:42,271 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-06-22 11:25:42,271 INFO ]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 33 [2018-06-22 11:25:42,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:42,271 INFO ]: Abstraction has 30 states and 41 transitions. [2018-06-22 11:25:42,271 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:42,271 INFO ]: Start isEmpty. Operand 30 states and 41 transitions. [2018-06-22 11:25:42,272 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:25:42,272 INFO ]: Found error trace [2018-06-22 11:25:42,273 INFO ]: trace histogram [8, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:25:42,273 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:25:42,273 INFO ]: Analyzing trace with hash 1082367387, now seen corresponding path program 4 times [2018-06-22 11:25:42,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:25:42,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:25:42,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:42,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:25:42,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:25:42,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:25:42,429 INFO ]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 11:25:42,429 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:25:42,429 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:25:42,429 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:25:42,429 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:25:42,429 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:25:42,429 INFO ]: Start difference. First operand 30 states and 41 transitions. Second operand 4 states. [2018-06-22 11:25:42,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:25:42,455 INFO ]: Finished difference Result 22 states and 27 transitions. [2018-06-22 11:25:42,455 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:25:42,455 INFO ]: Start accepts. Automaton has 4 states. Word has length 37 [2018-06-22 11:25:42,455 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:25:42,456 INFO ]: With dead ends: 22 [2018-06-22 11:25:42,456 INFO ]: Without dead ends: 0 [2018-06-22 11:25:42,456 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-22 11:25:42,456 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:25:42,456 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:25:42,456 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:25:42,456 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:25:42,456 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-06-22 11:25:42,456 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:25:42,456 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:25:42,456 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:25:42,456 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:25:42,456 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:25:42,460 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:25:42 BoogieIcfgContainer [2018-06-22 11:25:42,460 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:25:42,460 INFO ]: Toolchain (without parser) took 6264.76 ms. Allocated memory was 307.8 MB in the beginning and 367.0 MB in the end (delta: 59.2 MB). Free memory was 263.1 MB in the beginning and 205.1 MB in the end (delta: 58.1 MB). Peak memory consumption was 117.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:42,462 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:25:42,462 INFO ]: ChcToBoogie took 46.07 ms. Allocated memory is still 307.8 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:42,462 INFO ]: Boogie Preprocessor took 30.66 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 260.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:25:42,463 INFO ]: RCFGBuilder took 337.97 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 250.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:42,463 INFO ]: TraceAbstraction took 5842.00 ms. Allocated memory was 307.8 MB in the beginning and 367.0 MB in the end (delta: 59.2 MB). Free memory was 250.1 MB in the beginning and 205.1 MB in the end (delta: 45.0 MB). Peak memory consumption was 104.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:25:42,466 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 46.07 ms. Allocated memory is still 307.8 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 30.66 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 260.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 337.97 ms. Allocated memory is still 307.8 MB. Free memory was 260.1 MB in the beginning and 250.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5842.00 ms. Allocated memory was 307.8 MB in the beginning and 367.0 MB in the end (delta: 59.2 MB). Free memory was 250.1 MB in the beginning and 205.1 MB in the end (delta: 45.0 MB). Peak memory consumption was 104.3 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 3 procedures, 17 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 53 SDslu, 620 SDs, 0 SdLazy, 1622 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 410 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 18848 SizeOfPredicates, 28 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 547/627 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/inductive.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-25-42-477.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inductive.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-25-42-477.csv Received shutdown request...