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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:28:15,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:28:15,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:28:15,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:28:15,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:28:15,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:28:15,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:28:15,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:28:15,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:28:15,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:28:15,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:28:15,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:28:15,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:28:15,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:28:15,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:28:15,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:28:15,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:28:15,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:28:15,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:28:15,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:28:15,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:28:15,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:28:15,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:28:15,991 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:28:15,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:28:15,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:28:15,993 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:28:15,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:28:15,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:28:15,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:28:15,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:28:15,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:28:15,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:28:15,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:28:15,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:28:15,997 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:28:16,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:28:16,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:28:16,010 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:28:16,011 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:28:16,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:28:16,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:28:16,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:28:16,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:28:16,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:28:16,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:28:16,015 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:28:16,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:28:16,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:28:16,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:28:16,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:28:16,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:28:16,016 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:28:16,018 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:28:16,018 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:28:16,070 INFO ]: Repository-Root is: /tmp [2018-06-22 01:28:16,085 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:28:16,090 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:28:16,091 INFO ]: Initializing SmtParser... [2018-06-22 01:28:16,091 INFO ]: SmtParser initialized [2018-06-22 01:28:16,092 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 [2018-06-22 01:28:16,093 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 01:28:16,187 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 unknown [2018-06-22 01:28:16,381 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/013b-horn.smt2 [2018-06-22 01:28:16,386 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:28:16,392 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:28:16,392 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:28:16,392 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:28:16,393 INFO ]: ChcToBoogie initialized [2018-06-22 01:28:16,396 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,461 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16 Unit [2018-06-22 01:28:16,461 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:28:16,462 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:28:16,462 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:28:16,462 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:28:16,480 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,481 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,486 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,486 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,490 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,492 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,497 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... [2018-06-22 01:28:16,499 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:28:16,499 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:28:16,499 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:28:16,499 INFO ]: RCFGBuilder initialized [2018-06-22 01:28:16,500 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:28:16,513 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:28:16,513 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:28:16,513 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:28:16,514 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:28:16,514 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:28:16,514 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:28:16,851 INFO ]: Using library mode [2018-06-22 01:28:16,852 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:16 BoogieIcfgContainer [2018-06-22 01:28:16,852 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:28:16,853 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:28:16,853 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:28:16,857 INFO ]: TraceAbstraction initialized [2018-06-22 01:28:16,857 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:28:16" (1/3) ... [2018-06-22 01:28:16,858 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8454d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:28:16, skipping insertion in model container [2018-06-22 01:28:16,858 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:28:16" (2/3) ... [2018-06-22 01:28:16,858 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8454d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:28:16, skipping insertion in model container [2018-06-22 01:28:16,858 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:28:16" (3/3) ... [2018-06-22 01:28:16,861 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:28:16,868 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:28:16,876 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:28:16,910 INFO ]: Using default assertion order modulation [2018-06-22 01:28:16,911 INFO ]: Interprodecural is true [2018-06-22 01:28:16,911 INFO ]: Hoare is false [2018-06-22 01:28:16,911 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:28:16,911 INFO ]: Backedges is TWOTRACK [2018-06-22 01:28:16,911 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:28:16,911 INFO ]: Difference is false [2018-06-22 01:28:16,911 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:28:16,911 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:28:16,928 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:28:16,940 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:28:16,940 INFO ]: Found error trace [2018-06-22 01:28:16,941 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:28:16,941 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:16,946 INFO ]: Analyzing trace with hash -1689540588, now seen corresponding path program 1 times [2018-06-22 01:28:16,949 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:16,949 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:16,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:16,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:16,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,013 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,035 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:17,037 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:17,038 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:28:17,039 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:28:17,049 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:28:17,049 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:28:17,051 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:28:17,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:17,075 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-22 01:28:17,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:28:17,077 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:28:17,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:17,091 INFO ]: With dead ends: 10 [2018-06-22 01:28:17,092 INFO ]: Without dead ends: 10 [2018-06-22 01:28:17,093 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 01:28:17,106 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:28:17,121 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:28:17,122 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:17,122 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-22 01:28:17,124 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 6 [2018-06-22 01:28:17,124 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:17,124 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-22 01:28:17,124 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:28:17,124 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-22 01:28:17,124 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:17,124 INFO ]: Found error trace [2018-06-22 01:28:17,124 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:17,124 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:17,124 INFO ]: Analyzing trace with hash -821796999, now seen corresponding path program 1 times [2018-06-22 01:28:17,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:17,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:17,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:17,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,176 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:17,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:17,176 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:17,177 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:17,178 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:17,178 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:17,178 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-22 01:28:17,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:17,211 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-22 01:28:17,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:17,212 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:17,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:17,214 INFO ]: With dead ends: 12 [2018-06-22 01:28:17,214 INFO ]: Without dead ends: 12 [2018-06-22 01:28:17,215 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-22 01:28:17,215 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:28:17,217 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-22 01:28:17,217 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:28:17,217 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-22 01:28:17,217 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-22 01:28:17,218 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:17,218 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-22 01:28:17,218 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:17,218 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-22 01:28:17,218 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:17,218 INFO ]: Found error trace [2018-06-22 01:28:17,218 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:17,218 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:17,219 INFO ]: Analyzing trace with hash -821707626, now seen corresponding path program 1 times [2018-06-22 01:28:17,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:17,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:17,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:17,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,292 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:17,293 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:17,293 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:17,293 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:17,293 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:17,293 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:17,293 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-22 01:28:17,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:17,356 INFO ]: Finished difference Result 13 states and 20 transitions. [2018-06-22 01:28:17,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:17,357 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:17,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:17,357 INFO ]: With dead ends: 13 [2018-06-22 01:28:17,357 INFO ]: Without dead ends: 13 [2018-06-22 01:28:17,357 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-22 01:28:17,358 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:28:17,360 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-22 01:28:17,360 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:17,361 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-22 01:28:17,361 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 7 [2018-06-22 01:28:17,361 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:17,361 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-22 01:28:17,361 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:17,361 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-22 01:28:17,361 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:28:17,361 INFO ]: Found error trace [2018-06-22 01:28:17,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:17,361 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:17,361 INFO ]: Analyzing trace with hash -827844572, now seen corresponding path program 1 times [2018-06-22 01:28:17,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:17,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:17,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:17,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,434 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:17,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:17,434 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:17,434 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:17,434 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:17,434 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:17,435 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2018-06-22 01:28:17,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:17,461 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-22 01:28:17,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:17,462 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:28:17,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:17,462 INFO ]: With dead ends: 11 [2018-06-22 01:28:17,462 INFO ]: Without dead ends: 11 [2018-06-22 01:28:17,462 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-22 01:28:17,463 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:28:17,464 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:28:17,464 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:17,464 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:28:17,464 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2018-06-22 01:28:17,464 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:17,464 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:28:17,465 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:17,465 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:28:17,466 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:17,466 INFO ]: Found error trace [2018-06-22 01:28:17,466 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:17,466 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:17,467 INFO ]: Analyzing trace with hash 302402911, now seen corresponding path program 1 times [2018-06-22 01:28:17,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:17,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:17,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:17,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,485 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,556 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:17,556 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:17,556 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:28:17,556 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:17,556 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:17,556 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:17,557 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2018-06-22 01:28:17,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:17,691 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 01:28:17,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:28:17,691 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:28:17,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:17,691 INFO ]: With dead ends: 15 [2018-06-22 01:28:17,691 INFO ]: Without dead ends: 15 [2018-06-22 01:28:17,692 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:17,692 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:28:17,693 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:28:17,693 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:17,693 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:28:17,693 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-22 01:28:17,694 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:17,694 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:28:17,694 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:17,694 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:28:17,694 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:17,694 INFO ]: Found error trace [2018-06-22 01:28:17,694 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:17,694 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:17,694 INFO ]: Analyzing trace with hash 304845773, now seen corresponding path program 1 times [2018-06-22 01:28:17,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:17,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:17,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:17,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:17,709 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,907 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:17,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:17,908 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 01:28:17,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:17,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:17,948 INFO ]: Computing forward predicates... [2018-06-22 01:28:18,210 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:28:18,241 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:28:18,241 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-22 01:28:18,241 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:28:18,241 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:28:18,241 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:18,242 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 5 states. [2018-06-22 01:28:18,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:18,314 INFO ]: Finished difference Result 15 states and 19 transitions. [2018-06-22 01:28:18,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:18,316 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:28:18,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:18,317 INFO ]: With dead ends: 15 [2018-06-22 01:28:18,317 INFO ]: Without dead ends: 15 [2018-06-22 01:28:18,317 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:18,317 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:28:18,319 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:28:18,319 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:18,319 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-22 01:28:18,319 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-22 01:28:18,319 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:18,319 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-22 01:28:18,319 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:28:18,319 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-22 01:28:18,319 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:28:18,319 INFO ]: Found error trace [2018-06-22 01:28:18,319 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:18,320 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:18,320 INFO ]: Analyzing trace with hash 106616459, now seen corresponding path program 1 times [2018-06-22 01:28:18,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:18,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:18,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:18,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:18,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:18,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:18,366 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:18,366 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:18,366 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:28:18,366 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:28:18,366 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:28:18,366 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:28:18,366 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 3 states. [2018-06-22 01:28:18,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:18,371 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-22 01:28:18,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:28:18,372 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:28:18,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:18,372 INFO ]: With dead ends: 12 [2018-06-22 01:28:18,372 INFO ]: Without dead ends: 11 [2018-06-22 01:28:18,372 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-22 01:28:18,373 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:28:18,374 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:28:18,374 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:28:18,374 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-22 01:28:18,374 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-22 01:28:18,374 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:18,374 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-22 01:28:18,374 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:28:18,374 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-22 01:28:18,374 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:28:18,374 INFO ]: Found error trace [2018-06-22 01:28:18,375 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:18,375 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:18,375 INFO ]: Analyzing trace with hash 784550064, now seen corresponding path program 1 times [2018-06-22 01:28:18,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:18,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:18,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:18,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:18,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:18,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:18,426 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:18,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:28:18,426 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:28:18,426 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:28:18,426 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:28:18,426 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:28:18,426 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-06-22 01:28:18,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:18,478 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-22 01:28:18,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:28:18,478 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:28:18,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:18,478 INFO ]: With dead ends: 11 [2018-06-22 01:28:18,478 INFO ]: Without dead ends: 10 [2018-06-22 01:28:18,479 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:28:18,479 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:28:18,480 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:28:18,480 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:28:18,480 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-22 01:28:18,480 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2018-06-22 01:28:18,480 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:18,480 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-22 01:28:18,480 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:28:18,481 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-22 01:28:18,481 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:28:18,481 INFO ]: Found error trace [2018-06-22 01:28:18,481 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:28:18,481 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:28:18,481 INFO ]: Analyzing trace with hash 865819912, now seen corresponding path program 1 times [2018-06-22 01:28:18,481 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:28:18,481 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:28:18,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:18,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:28:18,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:28:18,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:18,715 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:18,715 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:28:18,715 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) [2018-06-22 01:28:18,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:28:18,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:28:18,786 INFO ]: Computing forward predicates... [2018-06-22 01:28:18,974 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:28:18,993 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:28:18,994 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:28:18,994 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:28:18,994 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:28:18,994 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:28:18,994 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-06-22 01:28:19,123 WARN ]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-22 01:28:19,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:28:19,124 INFO ]: Finished difference Result 6 states and 6 transitions. [2018-06-22 01:28:19,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:28:19,124 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:28:19,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:28:19,124 INFO ]: With dead ends: 6 [2018-06-22 01:28:19,124 INFO ]: Without dead ends: 0 [2018-06-22 01:28:19,124 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:28:19,124 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:28:19,125 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:28:19,125 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:28:19,125 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:28:19,125 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-22 01:28:19,125 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:28:19,125 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:28:19,125 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:28:19,125 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:28:19,125 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:28:19,131 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:28:19 BoogieIcfgContainer [2018-06-22 01:28:19,131 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:28:19,132 INFO ]: Toolchain (without parser) took 2745.44 ms. Allocated memory was 302.0 MB in the beginning and 322.4 MB in the end (delta: 20.4 MB). Free memory was 257.4 MB in the beginning and 274.8 MB in the end (delta: -17.4 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:19,132 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 01:28:19,133 INFO ]: ChcToBoogie took 68.93 ms. Allocated memory is still 302.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:19,133 INFO ]: Boogie Preprocessor took 37.02 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 253.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 01:28:19,133 INFO ]: RCFGBuilder took 352.79 ms. Allocated memory is still 302.0 MB. Free memory was 253.4 MB in the beginning and 242.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:28:19,136 INFO ]: TraceAbstraction took 2278.04 ms. Allocated memory was 302.0 MB in the beginning and 322.4 MB in the end (delta: 20.4 MB). Free memory was 242.2 MB in the beginning and 274.8 MB in the end (delta: -32.5 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:28:19,139 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 68.93 ms. Allocated memory is still 302.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.02 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 253.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 352.79 ms. Allocated memory is still 302.0 MB. Free memory was 253.4 MB in the beginning and 242.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2278.04 ms. Allocated memory was 302.0 MB in the beginning and 322.4 MB in the end (delta: 20.4 MB). Free memory was 242.2 MB in the beginning and 274.8 MB in the end (delta: -32.5 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 SDtfs, 34 SDslu, 85 SDs, 0 SdLazy, 45 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, 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, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 75 ConstructedInterpolants, 1 QuantifiedInterpolants, 1919 SizeOfPredicates, 10 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-28-19-154.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/013b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-28-19-154.csv Received shutdown request...