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/llreve-bench/smt2/loop__while_after_while_if.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:54:32,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:54:32,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:54:32,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:54:32,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:54:32,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:54:32,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:54:32,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:54:32,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:54:32,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:54:32,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:54:32,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:54:32,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:54:32,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:54:32,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:54:32,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:54:32,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:54:32,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:54:32,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:54:32,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:54:32,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:54:32,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:54:32,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:54:32,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:54:32,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:54:32,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:54:32,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:54:32,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:54:32,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:54:32,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:54:32,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:54:32,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:54:32,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:54:32,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:54:32,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:54:32,520 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:54:32,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:54:32,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:54:32,534 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:54:32,534 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:54:32,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:54:32,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:54:32,536 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:54:32,536 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:54:32,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:54:32,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:54:32,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:54:32,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:54:32,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:54:32,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:54:32,537 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:54:32,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:54:32,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:54:32,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:54:32,538 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:54:32,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:54:32,539 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:54:32,540 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:54:32,540 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:54:32,576 INFO ]: Repository-Root is: /tmp [2018-06-25 09:54:32,588 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:54:32,592 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:54:32,593 INFO ]: Initializing SmtParser... [2018-06-25 09:54:32,594 INFO ]: SmtParser initialized [2018-06-25 09:54:32,594 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 [2018-06-25 09:54:32,596 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:54:32,688 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7517a6a [2018-06-25 09:54:32,946 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__while_after_while_if.smt2 [2018-06-25 09:54:32,950 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:54:32,960 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:54:32,961 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:54:32,961 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:54:32,961 INFO ]: ChcToBoogie initialized [2018-06-25 09:54:32,964 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:54:32" (1/1) ... [2018-06-25 09:54:33,007 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33 Unit [2018-06-25 09:54:33,007 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:54:33,007 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:54:33,007 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:54:33,007 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:54:33,026 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,027 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,033 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,033 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,046 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,048 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,049 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (1/1) ... [2018-06-25 09:54:33,050 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:54:33,051 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:54:33,051 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:54:33,051 INFO ]: RCFGBuilder initialized [2018-06-25 09:54:33,052 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (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:54:33,068 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:54:33,068 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:54:33,068 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:54:33,068 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:54:33,068 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:54:33,068 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:54:33,416 INFO ]: Using library mode [2018-06-25 09:54:33,417 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:54:33 BoogieIcfgContainer [2018-06-25 09:54:33,417 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:54:33,423 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:54:33,423 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:54:33,426 INFO ]: TraceAbstraction initialized [2018-06-25 09:54:33,426 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:54:32" (1/3) ... [2018-06-25 09:54:33,427 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186fc54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:54:33, skipping insertion in model container [2018-06-25 09:54:33,427 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:54:33" (2/3) ... [2018-06-25 09:54:33,427 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186fc54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:54:33, skipping insertion in model container [2018-06-25 09:54:33,427 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:54:33" (3/3) ... [2018-06-25 09:54:33,429 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:54:33,436 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:54:33,442 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:54:33,475 INFO ]: Using default assertion order modulation [2018-06-25 09:54:33,475 INFO ]: Interprodecural is true [2018-06-25 09:54:33,475 INFO ]: Hoare is false [2018-06-25 09:54:33,475 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:54:33,475 INFO ]: Backedges is TWOTRACK [2018-06-25 09:54:33,475 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:54:33,475 INFO ]: Difference is false [2018-06-25 09:54:33,475 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:54:33,475 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:54:33,489 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:54:33,501 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:54:33,501 INFO ]: Found error trace [2018-06-25 09:54:33,502 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:33,502 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:33,506 INFO ]: Analyzing trace with hash -626727232, now seen corresponding path program 1 times [2018-06-25 09:54:33,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:33,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:33,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:33,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:33,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:33,586 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:33,664 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:54:33,665 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:33,665 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:54:33,667 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:33,677 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:33,677 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:33,679 INFO ]: Start difference. First operand 12 states. Second operand 4 states. [2018-06-25 09:54:33,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:33,843 INFO ]: Finished difference Result 16 states and 33 transitions. [2018-06-25 09:54:33,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:33,844 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:54:33,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:33,861 INFO ]: With dead ends: 16 [2018-06-25 09:54:33,861 INFO ]: Without dead ends: 16 [2018-06-25 09:54:33,863 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:33,882 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:54:33,907 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 09:54:33,909 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:54:33,909 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-06-25 09:54:33,911 INFO ]: Start accepts. Automaton has 12 states and 25 transitions. Word has length 8 [2018-06-25 09:54:33,912 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:33,912 INFO ]: Abstraction has 12 states and 25 transitions. [2018-06-25 09:54:33,912 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:33,913 INFO ]: Start isEmpty. Operand 12 states and 25 transitions. [2018-06-25 09:54:33,913 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:54:33,913 INFO ]: Found error trace [2018-06-25 09:54:33,913 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:33,913 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:33,913 INFO ]: Analyzing trace with hash -622705447, now seen corresponding path program 1 times [2018-06-25 09:54:33,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:33,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:33,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:33,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:33,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:33,925 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:33,960 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:54:33,960 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:33,960 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:54:33,961 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:33,961 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:33,962 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:33,962 INFO ]: Start difference. First operand 12 states and 25 transitions. Second operand 4 states. [2018-06-25 09:54:34,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:34,071 INFO ]: Finished difference Result 17 states and 34 transitions. [2018-06-25 09:54:34,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:34,072 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:54:34,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:34,073 INFO ]: With dead ends: 17 [2018-06-25 09:54:34,073 INFO ]: Without dead ends: 17 [2018-06-25 09:54:34,073 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:34,074 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:54:34,076 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-25 09:54:34,076 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:54:34,077 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-06-25 09:54:34,077 INFO ]: Start accepts. Automaton has 13 states and 26 transitions. Word has length 8 [2018-06-25 09:54:34,077 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:34,077 INFO ]: Abstraction has 13 states and 26 transitions. [2018-06-25 09:54:34,077 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:34,077 INFO ]: Start isEmpty. Operand 13 states and 26 transitions. [2018-06-25 09:54:34,077 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:34,077 INFO ]: Found error trace [2018-06-25 09:54:34,077 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:34,077 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:34,077 INFO ]: Analyzing trace with hash -1868547448, now seen corresponding path program 1 times [2018-06-25 09:54:34,077 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:34,077 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:34,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,078 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:34,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,096 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:34,223 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:54:34,223 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:34,223 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:54:34,223 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:34,223 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:34,223 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:34,224 INFO ]: Start difference. First operand 13 states and 26 transitions. Second operand 4 states. [2018-06-25 09:54:34,350 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:34,350 INFO ]: Finished difference Result 18 states and 37 transitions. [2018-06-25 09:54:34,350 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:34,350 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:54:34,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:34,351 INFO ]: With dead ends: 18 [2018-06-25 09:54:34,351 INFO ]: Without dead ends: 17 [2018-06-25 09:54:34,351 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:34,352 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:54:34,354 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-25 09:54:34,354 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:54:34,354 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2018-06-25 09:54:34,355 INFO ]: Start accepts. Automaton has 14 states and 29 transitions. Word has length 9 [2018-06-25 09:54:34,355 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:34,355 INFO ]: Abstraction has 14 states and 29 transitions. [2018-06-25 09:54:34,355 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:34,355 INFO ]: Start isEmpty. Operand 14 states and 29 transitions. [2018-06-25 09:54:34,355 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:34,355 INFO ]: Found error trace [2018-06-25 09:54:34,355 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:34,355 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:34,355 INFO ]: Analyzing trace with hash -1864525663, now seen corresponding path program 1 times [2018-06-25 09:54:34,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:34,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:34,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:34,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,366 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:34,430 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:54:34,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:34,430 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:54:34,430 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:34,430 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:34,430 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:34,431 INFO ]: Start difference. First operand 14 states and 29 transitions. Second operand 4 states. [2018-06-25 09:54:34,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:34,473 INFO ]: Finished difference Result 15 states and 30 transitions. [2018-06-25 09:54:34,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:34,474 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:54:34,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:34,474 INFO ]: With dead ends: 15 [2018-06-25 09:54:34,474 INFO ]: Without dead ends: 13 [2018-06-25 09:54:34,474 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:34,475 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:54:34,476 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:54:34,476 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:54:34,477 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-25 09:54:34,477 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 9 [2018-06-25 09:54:34,477 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:34,477 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-25 09:54:34,477 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:34,477 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-25 09:54:34,477 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:34,477 INFO ]: Found error trace [2018-06-25 09:54:34,477 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:34,477 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:34,478 INFO ]: Analyzing trace with hash 2050546801, now seen corresponding path program 1 times [2018-06-25 09:54:34,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:34,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:34,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:34,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,490 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:34,521 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:54:34,521 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:34,521 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:54:34,521 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:54:34,521 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:54:34,521 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:54:34,521 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 3 states. [2018-06-25 09:54:34,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:34,630 INFO ]: Finished difference Result 14 states and 27 transitions. [2018-06-25 09:54:34,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:54:34,630 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:54:34,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:34,630 INFO ]: With dead ends: 14 [2018-06-25 09:54:34,631 INFO ]: Without dead ends: 13 [2018-06-25 09:54:34,631 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:54:34,631 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:54:34,633 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:54:34,633 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:54:34,633 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-06-25 09:54:34,633 INFO ]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 9 [2018-06-25 09:54:34,633 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:34,633 INFO ]: Abstraction has 13 states and 20 transitions. [2018-06-25 09:54:34,633 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:54:34,633 INFO ]: Start isEmpty. Operand 13 states and 20 transitions. [2018-06-25 09:54:34,633 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:34,633 INFO ]: Found error trace [2018-06-25 09:54:34,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:34,633 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:34,633 INFO ]: Analyzing trace with hash 2042235112, now seen corresponding path program 1 times [2018-06-25 09:54:34,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:34,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:34,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:34,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:34,661 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:34,720 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:54:34,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:54:34,721 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:54:34,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:34,765 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:34,776 INFO ]: Computing forward predicates... [2018-06-25 09:54:35,142 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:54:35,167 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:54:35,167 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 09:54:35,167 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:54:35,167 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:54:35,167 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:54:35,167 INFO ]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. [2018-06-25 09:54:35,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:35,266 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-25 09:54:35,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:54:35,266 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-25 09:54:35,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:35,267 INFO ]: With dead ends: 17 [2018-06-25 09:54:35,267 INFO ]: Without dead ends: 15 [2018-06-25 09:54:35,267 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:54:35,267 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:54:35,269 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-25 09:54:35,269 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:54:35,269 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-25 09:54:35,269 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 9 [2018-06-25 09:54:35,269 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:35,269 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-25 09:54:35,269 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:54:35,269 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-25 09:54:35,270 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:35,270 INFO ]: Found error trace [2018-06-25 09:54:35,270 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:35,270 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:35,270 INFO ]: Analyzing trace with hash -2125882106, now seen corresponding path program 1 times [2018-06-25 09:54:35,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:35,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:35,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:35,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:35,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:35,282 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:35,350 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:54:35,350 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:54:35,350 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:54:35,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:35,372 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:35,374 INFO ]: Computing forward predicates... [2018-06-25 09:54:35,644 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:54:35,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:54:35,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-25 09:54:35,680 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:54:35,680 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:54:35,680 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:35,680 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 5 states. [2018-06-25 09:54:35,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:35,845 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-25 09:54:35,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:54:35,846 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 09:54:35,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:35,847 INFO ]: With dead ends: 13 [2018-06-25 09:54:35,847 INFO ]: Without dead ends: 11 [2018-06-25 09:54:35,847 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:54:35,847 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:54:35,848 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:54:35,848 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:54:35,849 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-25 09:54:35,849 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 9 [2018-06-25 09:54:35,849 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:35,849 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-25 09:54:35,849 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:54:35,849 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-25 09:54:35,851 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:35,851 INFO ]: Found error trace [2018-06-25 09:54:35,851 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:35,851 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:35,852 INFO ]: Analyzing trace with hash -2040322354, now seen corresponding path program 1 times [2018-06-25 09:54:35,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:35,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:35,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:35,852 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:35,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:35,858 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:35,886 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:54:35,886 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:35,886 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:54:35,886 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:35,886 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:35,886 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:35,886 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2018-06-25 09:54:35,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:35,965 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 09:54:35,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:35,966 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:54:35,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:35,966 INFO ]: With dead ends: 11 [2018-06-25 09:54:35,966 INFO ]: Without dead ends: 10 [2018-06-25 09:54:35,967 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:35,967 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:54:35,968 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:54:35,968 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:54:35,968 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:54:35,968 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 9 [2018-06-25 09:54:35,968 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:35,968 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:54:35,968 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:35,968 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:54:35,968 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:54:35,968 INFO ]: Found error trace [2018-06-25 09:54:35,968 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:54:35,969 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:54:35,969 INFO ]: Analyzing trace with hash -2036300569, now seen corresponding path program 1 times [2018-06-25 09:54:35,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:54:35,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:54:35,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:35,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:54:35,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:54:35,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:54:36,012 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:54:36,012 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:54:36,012 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:54:36,012 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:54:36,012 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:54:36,013 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:54:36,013 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2018-06-25 09:54:36,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:54:36,030 INFO ]: Finished difference Result 6 states and 9 transitions. [2018-06-25 09:54:36,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:54:36,031 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:54:36,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:54:36,031 INFO ]: With dead ends: 6 [2018-06-25 09:54:36,031 INFO ]: Without dead ends: 0 [2018-06-25 09:54:36,032 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:54:36,032 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:54:36,032 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:54:36,032 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:54:36,032 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:54:36,032 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-25 09:54:36,032 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:54:36,032 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:54:36,032 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:54:36,032 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:54:36,032 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:54:36,036 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:54:36 BoogieIcfgContainer [2018-06-25 09:54:36,036 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:54:36,037 INFO ]: Toolchain (without parser) took 3086.30 ms. Allocated memory was 299.9 MB in the beginning and 323.0 MB in the end (delta: 23.1 MB). Free memory was 254.3 MB in the beginning and 255.7 MB in the end (delta: -1.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:36,038 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 299.9 MB. Free memory is still 264.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:54:36,039 INFO ]: ChcToBoogie took 46.35 ms. Allocated memory is still 299.9 MB. Free memory was 254.3 MB in the beginning and 252.3 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:54:36,039 INFO ]: Boogie Preprocessor took 43.21 ms. Allocated memory is still 299.9 MB. Free memory was 252.3 MB in the beginning and 250.3 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:54:36,040 INFO ]: RCFGBuilder took 366.26 ms. Allocated memory is still 299.9 MB. Free memory was 250.3 MB in the beginning and 240.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:36,040 INFO ]: TraceAbstraction took 2613.00 ms. Allocated memory was 299.9 MB in the beginning and 323.0 MB in the end (delta: 23.1 MB). Free memory was 238.3 MB in the beginning and 255.7 MB in the end (delta: -17.3 MB). Peak memory consumption was 5.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:54:36,044 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 299.9 MB. Free memory is still 264.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 46.35 ms. Allocated memory is still 299.9 MB. Free memory was 254.3 MB in the beginning and 252.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 43.21 ms. Allocated memory is still 299.9 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 366.26 ms. Allocated memory is still 299.9 MB. Free memory was 250.3 MB in the beginning and 240.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2613.00 ms. Allocated memory was 299.9 MB in the beginning and 323.0 MB in the end (delta: 23.1 MB). Free memory was 238.3 MB in the beginning and 255.7 MB in the end (delta: -17.3 MB). Peak memory consumption was 5.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 36 SDslu, 177 SDs, 0 SdLazy, 139 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, 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.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 1502 SizeOfPredicates, 11 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 5/9 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/loop__while_after_while_if.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-54-36-055.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__while_after_while_if.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-54-36-055.csv Received shutdown request...