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/eldarica-misc/LIA/reve/001c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:07:22,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:07:22,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:07:22,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:07:22,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:07:22,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:07:22,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:07:22,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:07:22,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:07:22,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:07:22,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:07:22,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:07:22,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:07:22,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:07:22,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:07:22,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:07:22,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:07:22,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:07:22,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:07:22,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:07:22,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:07:22,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:07:22,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:07:22,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:07:22,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:07:22,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:07:22,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:07:22,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:07:22,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:07:22,868 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:07:22,868 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:07:22,869 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:07:22,869 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:07:22,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:07:22,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:07:22,871 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:07:22,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:07:22,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:07:22,884 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:07:22,884 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:07:22,885 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:07:22,885 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:07:22,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:07:22,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:07:22,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:07:22,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:07:22,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:07:22,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:07:22,887 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:07:22,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:07:22,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:07:22,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:07:22,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:07:22,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:07:22,888 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:07:22,889 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:07:22,889 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:07:22,935 INFO ]: Repository-Root is: /tmp [2018-06-22 11:07:22,951 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:07:22,956 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:07:22,958 INFO ]: Initializing SmtParser... [2018-06-22 11:07:22,958 INFO ]: SmtParser initialized [2018-06-22 11:07:22,959 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/001c-horn.smt2 [2018-06-22 11:07:22,961 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:07:23,053 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001c-horn.smt2 unknown [2018-06-22 11:07:23,424 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001c-horn.smt2 [2018-06-22 11:07:23,429 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:07:23,435 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:07:23,435 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:07:23,435 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:07:23,435 INFO ]: ChcToBoogie initialized [2018-06-22 11:07:23,439 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,505 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23 Unit [2018-06-22 11:07:23,505 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:07:23,509 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:07:23,509 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:07:23,509 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:07:23,531 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,531 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,552 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,552 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,571 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,575 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,587 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... [2018-06-22 11:07:23,590 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:07:23,591 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:07:23,591 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:07:23,591 INFO ]: RCFGBuilder initialized [2018-06-22 11:07:23,601 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:07:23,623 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:07:23,623 INFO ]: Found specification of procedure False [2018-06-22 11:07:23,623 INFO ]: Found implementation of procedure False [2018-06-22 11:07:23,623 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:07:23,623 INFO ]: Found specification of procedure REC__f [2018-06-22 11:07:23,623 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:07:23,623 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:07:23,623 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:07:23,623 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:07:23,624 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:07:23,624 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:07:23,624 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:07:23,624 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:07:23,624 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:07:23,624 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:07:24,599 INFO ]: Using library mode [2018-06-22 11:07:24,600 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:07:24 BoogieIcfgContainer [2018-06-22 11:07:24,600 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:07:24,602 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:07:24,602 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:07:24,605 INFO ]: TraceAbstraction initialized [2018-06-22 11:07:24,605 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:07:23" (1/3) ... [2018-06-22 11:07:24,606 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39223e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:07:24, skipping insertion in model container [2018-06-22 11:07:24,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:07:23" (2/3) ... [2018-06-22 11:07:24,607 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39223e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:07:24, skipping insertion in model container [2018-06-22 11:07:24,607 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:07:24" (3/3) ... [2018-06-22 11:07:24,608 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:07:24,617 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:07:24,625 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:07:24,664 INFO ]: Using default assertion order modulation [2018-06-22 11:07:24,664 INFO ]: Interprodecural is true [2018-06-22 11:07:24,664 INFO ]: Hoare is false [2018-06-22 11:07:24,664 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:07:24,664 INFO ]: Backedges is TWOTRACK [2018-06-22 11:07:24,664 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:07:24,664 INFO ]: Difference is false [2018-06-22 11:07:24,664 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:07:24,664 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:07:24,682 INFO ]: Start isEmpty. Operand 91 states. [2018-06-22 11:07:24,706 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:07:24,707 INFO ]: Found error trace [2018-06-22 11:07:24,708 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:07:24,708 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:24,712 INFO ]: Analyzing trace with hash 353329204, now seen corresponding path program 1 times [2018-06-22 11:07:24,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:24,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:24,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:24,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:24,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:24,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:24,788 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:07:24,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:24,791 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:07:24,793 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:07:24,809 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:07:24,809 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:07:24,814 INFO ]: Start difference. First operand 91 states. Second operand 2 states. [2018-06-22 11:07:24,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:24,851 INFO ]: Finished difference Result 67 states and 143 transitions. [2018-06-22 11:07:24,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:07:24,852 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:07:24,852 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:24,866 INFO ]: With dead ends: 67 [2018-06-22 11:07:24,866 INFO ]: Without dead ends: 67 [2018-06-22 11:07:24,867 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:07:24,884 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:07:24,935 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-22 11:07:24,938 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:07:24,946 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 143 transitions. [2018-06-22 11:07:24,947 INFO ]: Start accepts. Automaton has 67 states and 143 transitions. Word has length 5 [2018-06-22 11:07:24,948 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:24,948 INFO ]: Abstraction has 67 states and 143 transitions. [2018-06-22 11:07:24,948 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:07:24,948 INFO ]: Start isEmpty. Operand 67 states and 143 transitions. [2018-06-22 11:07:24,963 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:07:24,963 INFO ]: Found error trace [2018-06-22 11:07:24,963 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:24,963 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:24,963 INFO ]: Analyzing trace with hash 658292445, now seen corresponding path program 1 times [2018-06-22 11:07:24,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:24,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:24,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:24,965 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:24,965 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:25,002 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:25,061 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:07:25,061 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:25,061 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:25,062 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:25,062 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:25,063 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:25,063 INFO ]: Start difference. First operand 67 states and 143 transitions. Second operand 4 states. [2018-06-22 11:07:25,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:25,590 INFO ]: Finished difference Result 71 states and 167 transitions. [2018-06-22 11:07:25,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:25,591 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:07:25,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:25,595 INFO ]: With dead ends: 71 [2018-06-22 11:07:25,595 INFO ]: Without dead ends: 71 [2018-06-22 11:07:25,596 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:07:25,596 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:07:25,617 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 11:07:25,617 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:07:25,619 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 165 transitions. [2018-06-22 11:07:25,620 INFO ]: Start accepts. Automaton has 69 states and 165 transitions. Word has length 9 [2018-06-22 11:07:25,620 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:25,620 INFO ]: Abstraction has 69 states and 165 transitions. [2018-06-22 11:07:25,620 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:25,620 INFO ]: Start isEmpty. Operand 69 states and 165 transitions. [2018-06-22 11:07:25,625 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:25,625 INFO ]: Found error trace [2018-06-22 11:07:25,625 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:25,625 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:25,625 INFO ]: Analyzing trace with hash -1964502738, now seen corresponding path program 1 times [2018-06-22 11:07:25,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:25,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:25,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:25,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:25,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:25,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:25,711 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:07:25,711 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:25,753 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:25,753 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:25,753 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:25,753 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:25,754 INFO ]: Start difference. First operand 69 states and 165 transitions. Second operand 4 states. [2018-06-22 11:07:26,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:26,283 INFO ]: Finished difference Result 71 states and 165 transitions. [2018-06-22 11:07:26,285 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:26,285 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:07:26,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:26,288 INFO ]: With dead ends: 71 [2018-06-22 11:07:26,288 INFO ]: Without dead ends: 67 [2018-06-22 11:07:26,291 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:07:26,291 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:07:26,311 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-06-22 11:07:26,312 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 11:07:26,318 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 155 transitions. [2018-06-22 11:07:26,318 INFO ]: Start accepts. Automaton has 65 states and 155 transitions. Word has length 13 [2018-06-22 11:07:26,318 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:26,318 INFO ]: Abstraction has 65 states and 155 transitions. [2018-06-22 11:07:26,318 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:26,318 INFO ]: Start isEmpty. Operand 65 states and 155 transitions. [2018-06-22 11:07:26,327 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:26,327 INFO ]: Found error trace [2018-06-22 11:07:26,327 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:26,327 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:26,327 INFO ]: Analyzing trace with hash 1466926716, now seen corresponding path program 1 times [2018-06-22 11:07:26,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:26,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:26,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:26,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:26,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:26,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:26,380 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:07:26,380 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:26,380 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:26,381 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:26,381 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:26,381 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:26,381 INFO ]: Start difference. First operand 65 states and 155 transitions. Second operand 4 states. [2018-06-22 11:07:27,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:27,073 INFO ]: Finished difference Result 69 states and 179 transitions. [2018-06-22 11:07:27,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:27,073 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:07:27,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:27,076 INFO ]: With dead ends: 69 [2018-06-22 11:07:27,076 INFO ]: Without dead ends: 69 [2018-06-22 11:07:27,077 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:07:27,077 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-22 11:07:27,090 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-06-22 11:07:27,090 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:07:27,092 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 177 transitions. [2018-06-22 11:07:27,092 INFO ]: Start accepts. Automaton has 67 states and 177 transitions. Word has length 13 [2018-06-22 11:07:27,092 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:27,092 INFO ]: Abstraction has 67 states and 177 transitions. [2018-06-22 11:07:27,092 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:27,092 INFO ]: Start isEmpty. Operand 67 states and 177 transitions. [2018-06-22 11:07:27,097 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:27,097 INFO ]: Found error trace [2018-06-22 11:07:27,097 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:27,097 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:27,097 INFO ]: Analyzing trace with hash -263036310, now seen corresponding path program 1 times [2018-06-22 11:07:27,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:27,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:27,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:27,099 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:27,099 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:27,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:27,162 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:07:27,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:27,162 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:07:27,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:27,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:27,227 INFO ]: Computing forward predicates... [2018-06-22 11:07:27,322 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:07:27,345 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:27,345 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-22 11:07:27,345 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:07:27,345 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:07:27,345 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:07:27,345 INFO ]: Start difference. First operand 67 states and 177 transitions. Second operand 8 states. [2018-06-22 11:07:29,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:29,116 INFO ]: Finished difference Result 124 states and 597 transitions. [2018-06-22 11:07:29,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:07:29,116 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:07:29,116 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:29,123 INFO ]: With dead ends: 124 [2018-06-22 11:07:29,123 INFO ]: Without dead ends: 122 [2018-06-22 11:07:29,123 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:07:29,123 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 11:07:29,188 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-06-22 11:07:29,188 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-22 11:07:29,193 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 576 transitions. [2018-06-22 11:07:29,193 INFO ]: Start accepts. Automaton has 118 states and 576 transitions. Word has length 13 [2018-06-22 11:07:29,193 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:29,193 INFO ]: Abstraction has 118 states and 576 transitions. [2018-06-22 11:07:29,193 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:07:29,193 INFO ]: Start isEmpty. Operand 118 states and 576 transitions. [2018-06-22 11:07:29,200 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:07:29,200 INFO ]: Found error trace [2018-06-22 11:07:29,200 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:29,200 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:29,201 INFO ]: Analyzing trace with hash -210552378, now seen corresponding path program 1 times [2018-06-22 11:07:29,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:29,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:29,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:29,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:29,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:29,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:29,309 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:07:29,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:29,309 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:07:29,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:29,333 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:29,335 INFO ]: Computing forward predicates... [2018-06-22 11:07:29,446 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:07:29,468 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:29,468 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2018-06-22 11:07:29,468 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:07:29,468 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:07:29,469 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:07:29,469 INFO ]: Start difference. First operand 118 states and 576 transitions. Second operand 7 states. [2018-06-22 11:07:29,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:29,825 INFO ]: Finished difference Result 130 states and 613 transitions. [2018-06-22 11:07:29,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:07:29,827 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-22 11:07:29,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:29,830 INFO ]: With dead ends: 130 [2018-06-22 11:07:29,830 INFO ]: Without dead ends: 130 [2018-06-22 11:07:29,830 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:07:29,830 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 11:07:29,891 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-06-22 11:07:29,891 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 11:07:29,895 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 608 transitions. [2018-06-22 11:07:29,895 INFO ]: Start accepts. Automaton has 126 states and 608 transitions. Word has length 13 [2018-06-22 11:07:29,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:29,895 INFO ]: Abstraction has 126 states and 608 transitions. [2018-06-22 11:07:29,896 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:07:29,896 INFO ]: Start isEmpty. Operand 126 states and 608 transitions. [2018-06-22 11:07:29,904 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:29,904 INFO ]: Found error trace [2018-06-22 11:07:29,904 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:29,904 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:29,904 INFO ]: Analyzing trace with hash 641836654, now seen corresponding path program 1 times [2018-06-22 11:07:29,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:29,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:29,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:29,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:29,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:29,912 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:30,018 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:07:30,018 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:30,018 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:30,018 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:30,018 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:30,018 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:30,019 INFO ]: Start difference. First operand 126 states and 608 transitions. Second operand 4 states. [2018-06-22 11:07:30,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:30,401 INFO ]: Finished difference Result 144 states and 770 transitions. [2018-06-22 11:07:30,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:30,403 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:07:30,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:30,410 INFO ]: With dead ends: 144 [2018-06-22 11:07:30,410 INFO ]: Without dead ends: 144 [2018-06-22 11:07:30,411 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:07:30,411 INFO ]: Start minimizeSevpa. Operand 144 states. [2018-06-22 11:07:30,463 INFO ]: Finished minimizeSevpa. Reduced states from 144 to 134. [2018-06-22 11:07:30,463 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 11:07:30,471 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 661 transitions. [2018-06-22 11:07:30,472 INFO ]: Start accepts. Automaton has 134 states and 661 transitions. Word has length 17 [2018-06-22 11:07:30,472 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:30,472 INFO ]: Abstraction has 134 states and 661 transitions. [2018-06-22 11:07:30,472 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:30,472 INFO ]: Start isEmpty. Operand 134 states and 661 transitions. [2018-06-22 11:07:30,487 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:30,487 INFO ]: Found error trace [2018-06-22 11:07:30,487 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:30,487 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:30,487 INFO ]: Analyzing trace with hash -1792062731, now seen corresponding path program 1 times [2018-06-22 11:07:30,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:30,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:30,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:30,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:30,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:30,500 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:30,582 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:07:30,582 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:07:30,582 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:07:30,583 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:07:30,583 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:07:30,583 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:07:30,583 INFO ]: Start difference. First operand 134 states and 661 transitions. Second operand 4 states. [2018-06-22 11:07:30,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:30,770 INFO ]: Finished difference Result 116 states and 471 transitions. [2018-06-22 11:07:30,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:07:30,864 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:07:30,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:30,866 INFO ]: With dead ends: 116 [2018-06-22 11:07:30,866 INFO ]: Without dead ends: 99 [2018-06-22 11:07:30,866 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:07:30,867 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-22 11:07:30,882 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-06-22 11:07:30,882 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:07:30,885 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 399 transitions. [2018-06-22 11:07:30,885 INFO ]: Start accepts. Automaton has 99 states and 399 transitions. Word has length 17 [2018-06-22 11:07:30,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:30,885 INFO ]: Abstraction has 99 states and 399 transitions. [2018-06-22 11:07:30,885 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:07:30,885 INFO ]: Start isEmpty. Operand 99 states and 399 transitions. [2018-06-22 11:07:30,892 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:30,892 INFO ]: Found error trace [2018-06-22 11:07:30,892 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:30,892 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:30,892 INFO ]: Analyzing trace with hash 609034324, now seen corresponding path program 1 times [2018-06-22 11:07:30,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:30,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:30,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:30,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:30,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:30,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:30,990 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:07:30,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:30,990 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:07:30,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:31,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:31,018 INFO ]: Computing forward predicates... [2018-06-22 11:07:31,078 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:07:31,111 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:31,111 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-22 11:07:31,112 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:31,112 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:31,112 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:31,112 INFO ]: Start difference. First operand 99 states and 399 transitions. Second operand 9 states. [2018-06-22 11:07:32,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:32,124 INFO ]: Finished difference Result 128 states and 550 transitions. [2018-06-22 11:07:32,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:07:32,124 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:07:32,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:32,127 INFO ]: With dead ends: 128 [2018-06-22 11:07:32,127 INFO ]: Without dead ends: 124 [2018-06-22 11:07:32,128 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:07:32,128 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 11:07:32,155 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 107. [2018-06-22 11:07:32,155 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:07:32,158 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 437 transitions. [2018-06-22 11:07:32,158 INFO ]: Start accepts. Automaton has 107 states and 437 transitions. Word has length 17 [2018-06-22 11:07:32,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:32,158 INFO ]: Abstraction has 107 states and 437 transitions. [2018-06-22 11:07:32,158 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:32,158 INFO ]: Start isEmpty. Operand 107 states and 437 transitions. [2018-06-22 11:07:32,162 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:32,162 INFO ]: Found error trace [2018-06-22 11:07:32,162 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:32,162 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:32,162 INFO ]: Analyzing trace with hash -1354553357, now seen corresponding path program 1 times [2018-06-22 11:07:32,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:32,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:32,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:32,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:32,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:32,178 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:32,521 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:07:32,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:32,521 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:07:32,536 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:07:32,563 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:32,565 INFO ]: Computing forward predicates... [2018-06-22 11:07:32,987 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:07:33,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:33,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:07:33,008 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:33,008 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:33,008 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:33,008 INFO ]: Start difference. First operand 107 states and 437 transitions. Second operand 9 states. [2018-06-22 11:07:34,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:34,434 INFO ]: Finished difference Result 224 states and 1568 transitions. [2018-06-22 11:07:34,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:07:34,435 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:07:34,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:34,444 INFO ]: With dead ends: 224 [2018-06-22 11:07:34,444 INFO ]: Without dead ends: 224 [2018-06-22 11:07:34,444 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:07:34,445 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-22 11:07:34,568 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 199. [2018-06-22 11:07:34,569 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 11:07:34,576 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 1296 transitions. [2018-06-22 11:07:34,576 INFO ]: Start accepts. Automaton has 199 states and 1296 transitions. Word has length 17 [2018-06-22 11:07:34,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:34,577 INFO ]: Abstraction has 199 states and 1296 transitions. [2018-06-22 11:07:34,577 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:34,577 INFO ]: Start isEmpty. Operand 199 states and 1296 transitions. [2018-06-22 11:07:34,582 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:07:34,582 INFO ]: Found error trace [2018-06-22 11:07:34,582 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:34,582 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:34,582 INFO ]: Analyzing trace with hash -949978008, now seen corresponding path program 1 times [2018-06-22 11:07:34,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:34,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:34,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:34,583 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:34,583 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:34,595 INFO ]: Conjunction of SSA is sat [2018-06-22 11:07:34,597 INFO ]: Counterexample might be feasible [2018-06-22 11:07:34,619 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:07:34 BoogieIcfgContainer [2018-06-22 11:07:34,619 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:07:34,619 INFO ]: Toolchain (without parser) took 11189.60 ms. Allocated memory was 302.0 MB in the beginning and 427.8 MB in the end (delta: 125.8 MB). Free memory was 248.4 MB in the beginning and 390.1 MB in the end (delta: -141.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:07:34,621 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:07:34,621 INFO ]: ChcToBoogie took 70.38 ms. Allocated memory is still 302.0 MB. Free memory was 248.4 MB in the beginning and 245.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:07:34,621 INFO ]: Boogie Preprocessor took 81.23 ms. Allocated memory is still 302.0 MB. Free memory was 245.4 MB in the beginning and 244.4 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:07:34,623 INFO ]: RCFGBuilder took 1009.54 ms. Allocated memory is still 302.0 MB. Free memory was 244.4 MB in the beginning and 214.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:07:34,623 INFO ]: TraceAbstraction took 10016.70 ms. Allocated memory was 302.0 MB in the beginning and 427.8 MB in the end (delta: 125.8 MB). Free memory was 213.4 MB in the beginning and 390.1 MB in the end (delta: -176.7 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:07:34,626 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 70.38 ms. Allocated memory is still 302.0 MB. Free memory was 248.4 MB in the beginning and 245.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 81.23 ms. Allocated memory is still 302.0 MB. Free memory was 245.4 MB in the beginning and 244.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 1009.54 ms. Allocated memory is still 302.0 MB. Free memory was 244.4 MB in the beginning and 214.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 10016.70 ms. Allocated memory was 302.0 MB in the beginning and 427.8 MB in the end (delta: 125.8 MB). Free memory was 213.4 MB in the beginning and 390.1 MB in the end (delta: -176.7 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (((((((!(hbv_False_2_Int == 0) && hbv_False_2_Int + -1 == hbv_False_4_Int) && hbv_False_5_Int + -1 == 0) && !(hbv_False_3_Int == 0)) && !(hbv_False_7_Int == hbv_False_3_Int + 1)) && hbv_False_1_Int + -1 == hbv_False_6_Int) && !(hbv_False_1_Int == 0)) && hbv_False_2_Int == hbv_False_3_Int) && hbv_False_1_Int == hbv_False_5_Int; [L0] CALL call REC_f_(hbv_False_1_Int, hbv_False_4_Int, hbv_False_8_Int); [L0] assume (((hhv_REC_f__0_Int + -1 >= 0 && !(hhv_REC_f__0_Int == 0)) && hhv_REC_f__0_Int + -1 == hbv_REC_f__1_Int) && -1 * hbv_REC_f__2_Int == -1) && hhv_REC_f__1_Int == 0; [L0] CALL call REC_f_(hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int); [L0] assume hhv_REC_f__1_Int + 1 == hhv_REC_f__2_Int && hhv_REC_f__0_Int == 0; [L0] RET call REC_f_(hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int); [L0] RET call REC_f_(hbv_False_1_Int, hbv_False_4_Int, hbv_False_8_Int); [L0] CALL call REC_f_(hbv_False_6_Int, hbv_False_8_Int, hbv_False_7_Int); [L0] assume hhv_REC_f__1_Int + 1 == hhv_REC_f__2_Int && hhv_REC_f__0_Int == 0; [L0] RET call REC_f_(hbv_False_6_Int, hbv_False_8_Int, hbv_False_7_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 91 locations, 1 error locations. UNSAFE Result, 9.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1267 SDtfs, 58 SDslu, 2964 SDs, 0 SdLazy, 2593 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 4952 SizeOfPredicates, 15 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 26/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/001c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-07-34-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/001c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-07-34-641.csv Received shutdown request...