java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:09:34,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:09:34,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:09:34,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:09:34,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:09:34,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:09:34,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:09:34,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:09:34,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:09:34,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:09:34,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:09:34,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:09:34,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:09:34,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:09:34,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:09:34,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:09:34,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:09:34,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:09:34,968 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:09:34,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:09:34,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:09:34,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:09:34,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:09:34,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:09:34,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:09:34,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:09:34,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:09:34,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:09:34,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:09:34,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:09:34,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:09:34,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:09:34,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:09:34,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:09:34,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:09:34,995 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:09:35,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:09:35,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:09:35,019 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:09:35,022 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:09:35,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:09:35,023 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:09:35,023 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:09:35,023 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:09:35,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:09:35,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:09:35,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:09:35,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:09:35,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:09:35,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:09:35,025 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:09:35,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:09:35,026 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:09:35,026 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:09:35,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:09:35,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:09:35,027 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:09:35,028 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:09:35,028 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:09:35,078 INFO ]: Repository-Root is: /tmp [2018-06-25 09:09:35,096 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:09:35,102 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:09:35,103 INFO ]: Initializing SmtParser... [2018-06-25 09:09:35,104 INFO ]: SmtParser initialized [2018-06-25 09:09:35,104 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 [2018-06-25 09:09:35,105 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:09:35,195 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 unknown [2018-06-25 09:09:35,722 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/009b-horn.smt2 [2018-06-25 09:09:35,726 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:09:35,733 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:09:35,733 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:09:35,733 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:09:35,733 INFO ]: ChcToBoogie initialized [2018-06-25 09:09:35,737 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,822 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35 Unit [2018-06-25 09:09:35,822 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:09:35,823 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:09:35,823 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:09:35,823 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:09:35,843 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,843 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,862 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,862 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,873 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,875 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,879 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... [2018-06-25 09:09:35,883 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:09:35,883 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:09:35,883 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:09:35,883 INFO ]: RCFGBuilder initialized [2018-06-25 09:09:35,884 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:09:35,898 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:09:35,898 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:09:35,898 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:09:35,898 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:09:35,898 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:09:35,898 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:09:36,935 INFO ]: Using library mode [2018-06-25 09:09:36,935 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:09:36 BoogieIcfgContainer [2018-06-25 09:09:36,935 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:09:36,936 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:09:36,937 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:09:36,941 INFO ]: TraceAbstraction initialized [2018-06-25 09:09:36,941 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:09:35" (1/3) ... [2018-06-25 09:09:36,942 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410ce5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:09:36, skipping insertion in model container [2018-06-25 09:09:36,942 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:09:35" (2/3) ... [2018-06-25 09:09:36,942 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410ce5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:09:36, skipping insertion in model container [2018-06-25 09:09:36,942 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:09:36" (3/3) ... [2018-06-25 09:09:36,944 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:09:36,953 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:09:36,962 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:09:36,999 INFO ]: Using default assertion order modulation [2018-06-25 09:09:37,000 INFO ]: Interprodecural is true [2018-06-25 09:09:37,000 INFO ]: Hoare is false [2018-06-25 09:09:37,000 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:09:37,000 INFO ]: Backedges is TWOTRACK [2018-06-25 09:09:37,000 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:09:37,000 INFO ]: Difference is false [2018-06-25 09:09:37,000 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:09:37,000 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:09:37,013 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:09:37,026 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:09:37,026 INFO ]: Found error trace [2018-06-25 09:09:37,027 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:37,027 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:37,034 INFO ]: Analyzing trace with hash 1901628066, now seen corresponding path program 1 times [2018-06-25 09:09:37,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:37,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:37,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:37,076 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:37,076 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:37,120 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:37,181 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:37,184 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:09:37,184 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:09:37,186 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:09:37,199 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:09:37,199 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:37,201 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:09:37,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:37,984 INFO ]: Finished difference Result 9 states and 65 transitions. [2018-06-25 09:09:37,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:09:37,986 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:09:37,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:37,995 INFO ]: With dead ends: 9 [2018-06-25 09:09:37,995 INFO ]: Without dead ends: 9 [2018-06-25 09:09:37,997 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:38,014 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:09:38,031 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:09:38,032 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:09:38,033 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2018-06-25 09:09:38,034 INFO ]: Start accepts. Automaton has 9 states and 65 transitions. Word has length 7 [2018-06-25 09:09:38,035 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:38,035 INFO ]: Abstraction has 9 states and 65 transitions. [2018-06-25 09:09:38,035 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:09:38,035 INFO ]: Start isEmpty. Operand 9 states and 65 transitions. [2018-06-25 09:09:38,036 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:09:38,036 INFO ]: Found error trace [2018-06-25 09:09:38,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:38,036 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:38,036 INFO ]: Analyzing trace with hash -1135046519, now seen corresponding path program 1 times [2018-06-25 09:09:38,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:38,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:38,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:38,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:38,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:38,054 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:38,175 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:38,175 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:09:38,175 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:09:38,177 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:09:38,177 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:09:38,177 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:38,177 INFO ]: Start difference. First operand 9 states and 65 transitions. Second operand 3 states. [2018-06-25 09:09:38,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:38,671 INFO ]: Finished difference Result 11 states and 123 transitions. [2018-06-25 09:09:38,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:09:38,671 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:09:38,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:38,672 INFO ]: With dead ends: 11 [2018-06-25 09:09:38,672 INFO ]: Without dead ends: 11 [2018-06-25 09:09:38,673 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:38,673 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:09:38,676 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:09:38,676 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:09:38,677 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2018-06-25 09:09:38,677 INFO ]: Start accepts. Automaton has 11 states and 123 transitions. Word has length 8 [2018-06-25 09:09:38,677 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:38,677 INFO ]: Abstraction has 11 states and 123 transitions. [2018-06-25 09:09:38,677 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:09:38,677 INFO ]: Start isEmpty. Operand 11 states and 123 transitions. [2018-06-25 09:09:38,677 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:09:38,677 INFO ]: Found error trace [2018-06-25 09:09:38,677 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:38,677 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:38,678 INFO ]: Analyzing trace with hash -1193228342, now seen corresponding path program 1 times [2018-06-25 09:09:38,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:38,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:38,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:38,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:38,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:38,689 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:38,810 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:38,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:09:38,810 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:09:38,810 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:09:38,810 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:09:38,810 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:38,810 INFO ]: Start difference. First operand 11 states and 123 transitions. Second operand 3 states. [2018-06-25 09:09:39,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:39,264 INFO ]: Finished difference Result 14 states and 210 transitions. [2018-06-25 09:09:39,382 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:09:39,382 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:09:39,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:39,384 INFO ]: With dead ends: 14 [2018-06-25 09:09:39,384 INFO ]: Without dead ends: 14 [2018-06-25 09:09:39,385 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:39,385 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:09:39,389 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-25 09:09:39,389 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:09:39,391 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 181 transitions. [2018-06-25 09:09:39,391 INFO ]: Start accepts. Automaton has 13 states and 181 transitions. Word has length 8 [2018-06-25 09:09:39,391 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:39,391 INFO ]: Abstraction has 13 states and 181 transitions. [2018-06-25 09:09:39,391 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:09:39,391 INFO ]: Start isEmpty. Operand 13 states and 181 transitions. [2018-06-25 09:09:39,392 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:09:39,392 INFO ]: Found error trace [2018-06-25 09:09:39,392 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:39,392 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:39,392 INFO ]: Analyzing trace with hash -1185840174, now seen corresponding path program 1 times [2018-06-25 09:09:39,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:39,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:39,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:39,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:39,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:39,407 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:39,462 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:39,462 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:09:39,462 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:09:39,462 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:09:39,462 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:09:39,462 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:39,462 INFO ]: Start difference. First operand 13 states and 181 transitions. Second operand 3 states. [2018-06-25 09:09:39,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:39,607 INFO ]: Finished difference Result 17 states and 297 transitions. [2018-06-25 09:09:39,607 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:09:39,607 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:09:39,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:39,608 INFO ]: With dead ends: 17 [2018-06-25 09:09:39,608 INFO ]: Without dead ends: 17 [2018-06-25 09:09:39,609 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:39,609 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:09:39,613 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-25 09:09:39,613 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:09:39,614 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 239 transitions. [2018-06-25 09:09:39,614 INFO ]: Start accepts. Automaton has 15 states and 239 transitions. Word has length 8 [2018-06-25 09:09:39,614 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:39,614 INFO ]: Abstraction has 15 states and 239 transitions. [2018-06-25 09:09:39,614 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:09:39,630 INFO ]: Start isEmpty. Operand 15 states and 239 transitions. [2018-06-25 09:09:39,630 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:09:39,630 INFO ]: Found error trace [2018-06-25 09:09:39,630 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:39,630 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:39,631 INFO ]: Analyzing trace with hash -1123964267, now seen corresponding path program 1 times [2018-06-25 09:09:39,631 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:39,631 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:39,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:39,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:39,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:39,654 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:39,715 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:39,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:39,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:39,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:39,760 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:39,768 INFO ]: Computing forward predicates... [2018-06-25 09:09:39,860 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:39,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:39,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:09:39,892 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:09:39,892 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:09:39,892 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:09:39,892 INFO ]: Start difference. First operand 15 states and 239 transitions. Second operand 4 states. [2018-06-25 09:09:40,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:40,672 INFO ]: Finished difference Result 20 states and 384 transitions. [2018-06-25 09:09:40,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:09:40,672 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:09:40,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:40,673 INFO ]: With dead ends: 20 [2018-06-25 09:09:40,673 INFO ]: Without dead ends: 20 [2018-06-25 09:09:40,673 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:09:40,674 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:09:40,677 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-25 09:09:40,678 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:09:40,679 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 355 transitions. [2018-06-25 09:09:40,679 INFO ]: Start accepts. Automaton has 19 states and 355 transitions. Word has length 8 [2018-06-25 09:09:40,679 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:40,679 INFO ]: Abstraction has 19 states and 355 transitions. [2018-06-25 09:09:40,679 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:09:40,679 INFO ]: Start isEmpty. Operand 19 states and 355 transitions. [2018-06-25 09:09:40,680 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:09:40,680 INFO ]: Found error trace [2018-06-25 09:09:40,680 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:40,680 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:40,680 INFO ]: Analyzing trace with hash -886112494, now seen corresponding path program 1 times [2018-06-25 09:09:40,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:40,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:40,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:40,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:40,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:40,695 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:40,732 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:40,732 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:09:40,732 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:09:40,732 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:09:40,732 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:09:40,732 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:40,733 INFO ]: Start difference. First operand 19 states and 355 transitions. Second operand 3 states. [2018-06-25 09:09:40,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:40,881 INFO ]: Finished difference Result 26 states and 343 transitions. [2018-06-25 09:09:40,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:09:40,881 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:09:40,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:40,883 INFO ]: With dead ends: 26 [2018-06-25 09:09:40,883 INFO ]: Without dead ends: 22 [2018-06-25 09:09:40,883 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:40,883 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:09:40,887 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-25 09:09:40,887 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:09:40,888 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 269 transitions. [2018-06-25 09:09:40,888 INFO ]: Start accepts. Automaton has 19 states and 269 transitions. Word has length 9 [2018-06-25 09:09:40,888 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:40,888 INFO ]: Abstraction has 19 states and 269 transitions. [2018-06-25 09:09:40,888 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:09:40,888 INFO ]: Start isEmpty. Operand 19 states and 269 transitions. [2018-06-25 09:09:40,889 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:09:40,889 INFO ]: Found error trace [2018-06-25 09:09:40,889 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:40,889 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:40,889 INFO ]: Analyzing trace with hash -1802245326, now seen corresponding path program 1 times [2018-06-25 09:09:40,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:40,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:40,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:40,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:40,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:40,915 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:40,955 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:40,955 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:09:40,955 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:09:40,955 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:09:40,955 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:09:40,955 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:40,956 INFO ]: Start difference. First operand 19 states and 269 transitions. Second operand 3 states. [2018-06-25 09:09:41,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:41,131 INFO ]: Finished difference Result 29 states and 374 transitions. [2018-06-25 09:09:41,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:09:41,132 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:09:41,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:41,133 INFO ]: With dead ends: 29 [2018-06-25 09:09:41,133 INFO ]: Without dead ends: 29 [2018-06-25 09:09:41,133 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:09:41,133 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:09:41,139 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-25 09:09:41,139 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:09:41,140 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 344 transitions. [2018-06-25 09:09:41,140 INFO ]: Start accepts. Automaton has 25 states and 344 transitions. Word has length 9 [2018-06-25 09:09:41,140 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:41,140 INFO ]: Abstraction has 25 states and 344 transitions. [2018-06-25 09:09:41,140 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:09:41,140 INFO ]: Start isEmpty. Operand 25 states and 344 transitions. [2018-06-25 09:09:41,141 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:09:41,141 INFO ]: Found error trace [2018-06-25 09:09:41,141 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:41,141 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:41,141 INFO ]: Analyzing trace with hash -1787468990, now seen corresponding path program 1 times [2018-06-25 09:09:41,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:41,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:41,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:41,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:41,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:41,160 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:41,208 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:41,209 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:41,209 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:41,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:41,260 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:41,262 INFO ]: Computing forward predicates... [2018-06-25 09:09:41,379 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:41,410 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:09:41,411 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 09:09:41,411 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:09:41,411 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:09:41,411 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:09:41,411 INFO ]: Start difference. First operand 25 states and 344 transitions. Second operand 5 states. [2018-06-25 09:09:41,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:41,824 INFO ]: Finished difference Result 46 states and 396 transitions. [2018-06-25 09:09:41,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:09:41,824 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 09:09:41,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:41,825 INFO ]: With dead ends: 46 [2018-06-25 09:09:41,826 INFO ]: Without dead ends: 44 [2018-06-25 09:09:41,826 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:09:41,826 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-25 09:09:41,832 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-06-25 09:09:41,832 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 09:09:41,833 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 345 transitions. [2018-06-25 09:09:41,833 INFO ]: Start accepts. Automaton has 30 states and 345 transitions. Word has length 9 [2018-06-25 09:09:41,833 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:41,833 INFO ]: Abstraction has 30 states and 345 transitions. [2018-06-25 09:09:41,833 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:09:41,833 INFO ]: Start isEmpty. Operand 30 states and 345 transitions. [2018-06-25 09:09:41,834 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:09:41,834 INFO ]: Found error trace [2018-06-25 09:09:41,834 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:41,834 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:41,834 INFO ]: Analyzing trace with hash -1842880250, now seen corresponding path program 1 times [2018-06-25 09:09:41,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:41,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:41,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:41,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:41,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:41,875 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:41,955 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:41,955 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:41,955 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:41,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:41,982 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:41,985 INFO ]: Computing forward predicates... [2018-06-25 09:09:42,465 WARN ]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-25 09:09:42,492 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:42,525 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:42,525 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-25 09:09:42,525 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:09:42,525 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:09:42,525 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:09:42,525 INFO ]: Start difference. First operand 30 states and 345 transitions. Second operand 7 states. [2018-06-25 09:09:42,882 WARN ]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-25 09:09:53,991 WARN ]: Spent 1.22 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-06-25 09:09:55,400 WARN ]: Spent 870.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-06-25 09:10:04,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:10:04,684 INFO ]: Finished difference Result 52 states and 631 transitions. [2018-06-25 09:10:04,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:10:04,684 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:10:04,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:10:04,686 INFO ]: With dead ends: 52 [2018-06-25 09:10:04,686 INFO ]: Without dead ends: 43 [2018-06-25 09:10:04,686 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:10:04,686 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 09:10:04,690 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-06-25 09:10:04,690 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 09:10:04,691 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 285 transitions. [2018-06-25 09:10:04,691 INFO ]: Start accepts. Automaton has 26 states and 285 transitions. Word has length 9 [2018-06-25 09:10:04,691 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:10:04,691 INFO ]: Abstraction has 26 states and 285 transitions. [2018-06-25 09:10:04,691 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:10:04,691 INFO ]: Start isEmpty. Operand 26 states and 285 transitions. [2018-06-25 09:10:04,691 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:10:04,691 INFO ]: Found error trace [2018-06-25 09:10:04,691 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:10:04,692 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:10:04,692 INFO ]: Analyzing trace with hash -812230814, now seen corresponding path program 1 times [2018-06-25 09:10:04,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:10:04,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:10:04,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:10:04,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:10:04,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:10:04,710 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:10:04,795 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:10:04,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:10:04,795 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:10:04,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:10:04,829 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:10:04,830 INFO ]: Computing forward predicates... [2018-06-25 09:10:04,958 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:10:04,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:10:04,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-25 09:10:04,980 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:10:04,980 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:10:04,980 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:10:04,980 INFO ]: Start difference. First operand 26 states and 285 transitions. Second operand 7 states. Received shutdown request... [2018-06-25 09:10:58,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:10:58,386 WARN ]: Verification canceled [2018-06-25 09:10:58,390 WARN ]: Timeout [2018-06-25 09:10:58,390 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:10:58 BoogieIcfgContainer [2018-06-25 09:10:58,390 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:10:58,391 INFO ]: Toolchain (without parser) took 82664.29 ms. Allocated memory was 302.5 MB in the beginning and 384.3 MB in the end (delta: 81.8 MB). Free memory was 229.0 MB in the beginning and 193.8 MB in the end (delta: 35.2 MB). Peak memory consumption was 117.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:10:58,392 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:10:58,392 INFO ]: ChcToBoogie took 89.64 ms. Allocated memory is still 302.5 MB. Free memory was 229.0 MB in the beginning and 225.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:10:58,393 INFO ]: Boogie Preprocessor took 59.78 ms. Allocated memory is still 302.5 MB. Free memory was 225.0 MB in the beginning and 223.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:10:58,394 INFO ]: RCFGBuilder took 1052.15 ms. Allocated memory was 302.5 MB in the beginning and 320.9 MB in the end (delta: 18.4 MB). Free memory was 223.0 MB in the beginning and 275.8 MB in the end (delta: -52.8 MB). Peak memory consumption was 46.9 MB. Max. memory is 3.6 GB. [2018-06-25 09:10:58,394 INFO ]: TraceAbstraction took 81453.97 ms. Allocated memory was 320.9 MB in the beginning and 384.3 MB in the end (delta: 63.4 MB). Free memory was 275.8 MB in the beginning and 193.8 MB in the end (delta: 82.0 MB). Peak memory consumption was 145.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:10:58,398 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 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 89.64 ms. Allocated memory is still 302.5 MB. Free memory was 229.0 MB in the beginning and 225.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 59.78 ms. Allocated memory is still 302.5 MB. Free memory was 225.0 MB in the beginning and 223.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1052.15 ms. Allocated memory was 302.5 MB in the beginning and 320.9 MB in the end (delta: 18.4 MB). Free memory was 223.0 MB in the beginning and 275.8 MB in the end (delta: -52.8 MB). Peak memory consumption was 46.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 81453.97 ms. Allocated memory was 320.9 MB in the beginning and 384.3 MB in the end (delta: 63.4 MB). Free memory was 275.8 MB in the beginning and 193.8 MB in the end (delta: 82.0 MB). Peak memory consumption was 145.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (26states) and interpolant automaton (currently 6 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 81.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 79.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 12 SDslu, 87 SDs, 0 SdLazy, 977 SolverSat, 325 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 54.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=8, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 105 ConstructedInterpolants, 5 QuantifiedInterpolants, 2962 SizeOfPredicates, 10 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 20/29 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-10-58-409.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/009b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-10-58-409.csv Completed graceful shutdown