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/llreve-bench/smt2/rec__add-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:29:19,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:29:19,621 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:29:19,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:29:19,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:29:19,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:29:19,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:29:19,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:29:19,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:29:19,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:29:19,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:29:19,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:29:19,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:29:19,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:29:19,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:29:19,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:29:19,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:29:19,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:29:19,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:29:19,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:29:19,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:29:19,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:29:19,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:29:19,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:29:19,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:29:19,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:29:19,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:29:19,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:29:19,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:29:19,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:29:19,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:29:19,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:29:19,688 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:29:19,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:29:19,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:29:19,690 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:29:19,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:29:19,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:29:19,707 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:29:19,707 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:29:19,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:29:19,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:29:19,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:29:19,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:29:19,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:29:19,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:29:19,709 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:29:19,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:29:19,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:29:19,710 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:29:19,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:29:19,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:29:19,710 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:29:19,712 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:29:19,712 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:29:19,758 INFO ]: Repository-Root is: /tmp [2018-06-22 02:29:19,775 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:29:19,782 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:29:19,783 INFO ]: Initializing SmtParser... [2018-06-22 02:29:19,784 INFO ]: SmtParser initialized [2018-06-22 02:29:19,784 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-22 02:29:19,786 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 02:29:19,883 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@41cf1731 [2018-06-22 02:29:20,111 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__add-horn.smt2 [2018-06-22 02:29:20,116 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:29:20,123 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:29:20,124 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:29:20,124 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:29:20,124 INFO ]: ChcToBoogie initialized [2018-06-22 02:29:20,129 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,196 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20 Unit [2018-06-22 02:29:20,196 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:29:20,197 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:29:20,197 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:29:20,197 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:29:20,220 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,220 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,230 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,230 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,246 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,249 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,250 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... [2018-06-22 02:29:20,261 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:29:20,262 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:29:20,262 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:29:20,262 INFO ]: RCFGBuilder initialized [2018-06-22 02:29:20,263 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 02:29:20,274 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:29:20,274 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:29:20,274 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:29:20,274 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:29:20,274 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:29:20,274 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:29:20,764 INFO ]: Using library mode [2018-06-22 02:29:20,764 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:29:20 BoogieIcfgContainer [2018-06-22 02:29:20,765 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:29:20,766 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:29:20,766 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:29:20,770 INFO ]: TraceAbstraction initialized [2018-06-22 02:29:20,770 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:29:20" (1/3) ... [2018-06-22 02:29:20,771 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392737a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:29:20, skipping insertion in model container [2018-06-22 02:29:20,771 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:29:20" (2/3) ... [2018-06-22 02:29:20,771 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392737a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:29:20, skipping insertion in model container [2018-06-22 02:29:20,771 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:29:20" (3/3) ... [2018-06-22 02:29:20,773 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:29:20,785 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:29:20,797 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:29:20,850 INFO ]: Using default assertion order modulation [2018-06-22 02:29:20,851 INFO ]: Interprodecural is true [2018-06-22 02:29:20,851 INFO ]: Hoare is false [2018-06-22 02:29:20,851 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:29:20,851 INFO ]: Backedges is TWOTRACK [2018-06-22 02:29:20,851 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:29:20,851 INFO ]: Difference is false [2018-06-22 02:29:20,851 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:29:20,851 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:29:20,874 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 02:29:20,890 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:29:20,890 INFO ]: Found error trace [2018-06-22 02:29:20,891 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:20,891 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:20,897 INFO ]: Analyzing trace with hash 109750059, now seen corresponding path program 1 times [2018-06-22 02:29:20,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:20,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:20,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:20,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:20,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:20,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:21,027 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:21,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:21,033 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:21,035 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:21,052 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:21,053 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:21,057 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-22 02:29:21,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:21,804 INFO ]: Finished difference Result 55 states and 105 transitions. [2018-06-22 02:29:21,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:21,807 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:29:21,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:21,826 INFO ]: With dead ends: 55 [2018-06-22 02:29:21,826 INFO ]: Without dead ends: 55 [2018-06-22 02:29:21,828 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:21,862 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 02:29:21,893 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 02:29:21,896 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 02:29:21,900 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 105 transitions. [2018-06-22 02:29:21,906 INFO ]: Start accepts. Automaton has 55 states and 105 transitions. Word has length 8 [2018-06-22 02:29:21,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:21,907 INFO ]: Abstraction has 55 states and 105 transitions. [2018-06-22 02:29:21,907 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:21,907 INFO ]: Start isEmpty. Operand 55 states and 105 transitions. [2018-06-22 02:29:21,911 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:29:21,911 INFO ]: Found error trace [2018-06-22 02:29:21,912 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:21,912 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:21,912 INFO ]: Analyzing trace with hash -1874137058, now seen corresponding path program 1 times [2018-06-22 02:29:21,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:21,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:21,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:21,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:21,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:21,922 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:21,964 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:21,964 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:21,964 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:21,966 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:21,966 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:21,966 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:21,966 INFO ]: Start difference. First operand 55 states and 105 transitions. Second operand 4 states. [2018-06-22 02:29:22,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:22,209 INFO ]: Finished difference Result 81 states and 156 transitions. [2018-06-22 02:29:22,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:22,210 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:29:22,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:22,216 INFO ]: With dead ends: 81 [2018-06-22 02:29:22,216 INFO ]: Without dead ends: 81 [2018-06-22 02:29:22,217 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 02:29:22,217 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 02:29:22,237 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-22 02:29:22,237 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 02:29:22,244 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 156 transitions. [2018-06-22 02:29:22,245 INFO ]: Start accepts. Automaton has 81 states and 156 transitions. Word has length 9 [2018-06-22 02:29:22,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:22,246 INFO ]: Abstraction has 81 states and 156 transitions. [2018-06-22 02:29:22,246 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:22,246 INFO ]: Start isEmpty. Operand 81 states and 156 transitions. [2018-06-22 02:29:22,247 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:29:22,247 INFO ]: Found error trace [2018-06-22 02:29:22,247 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:22,247 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:22,247 INFO ]: Analyzing trace with hash -1881525226, now seen corresponding path program 1 times [2018-06-22 02:29:22,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:22,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:22,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:22,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:22,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:22,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:22,426 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:22,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:22,426 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:22,426 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:22,426 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:22,426 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:22,426 INFO ]: Start difference. First operand 81 states and 156 transitions. Second operand 4 states. [2018-06-22 02:29:22,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:22,812 INFO ]: Finished difference Result 107 states and 207 transitions. [2018-06-22 02:29:22,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:22,812 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:29:22,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:22,816 INFO ]: With dead ends: 107 [2018-06-22 02:29:22,816 INFO ]: Without dead ends: 107 [2018-06-22 02:29:22,817 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:22,817 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 02:29:22,830 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-06-22 02:29:22,830 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 02:29:22,834 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 207 transitions. [2018-06-22 02:29:22,834 INFO ]: Start accepts. Automaton has 107 states and 207 transitions. Word has length 9 [2018-06-22 02:29:22,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:22,834 INFO ]: Abstraction has 107 states and 207 transitions. [2018-06-22 02:29:22,834 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:22,834 INFO ]: Start isEmpty. Operand 107 states and 207 transitions. [2018-06-22 02:29:22,836 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:29:22,836 INFO ]: Found error trace [2018-06-22 02:29:22,837 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:22,837 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:22,837 INFO ]: Analyzing trace with hash 247246400, now seen corresponding path program 1 times [2018-06-22 02:29:22,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:22,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:22,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:22,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:22,838 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:22,846 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:22,882 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:22,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:22,882 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:22,882 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:22,883 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:22,883 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:22,883 INFO ]: Start difference. First operand 107 states and 207 transitions. Second operand 4 states. [2018-06-22 02:29:23,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:23,199 INFO ]: Finished difference Result 133 states and 258 transitions. [2018-06-22 02:29:23,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:23,200 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:29:23,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:23,205 INFO ]: With dead ends: 133 [2018-06-22 02:29:23,205 INFO ]: Without dead ends: 133 [2018-06-22 02:29:23,206 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 02:29:23,206 INFO ]: Start minimizeSevpa. Operand 133 states. [2018-06-22 02:29:23,220 INFO ]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-06-22 02:29:23,221 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-22 02:29:23,224 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 258 transitions. [2018-06-22 02:29:23,224 INFO ]: Start accepts. Automaton has 133 states and 258 transitions. Word has length 11 [2018-06-22 02:29:23,224 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:23,225 INFO ]: Abstraction has 133 states and 258 transitions. [2018-06-22 02:29:23,225 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:23,225 INFO ]: Start isEmpty. Operand 133 states and 258 transitions. [2018-06-22 02:29:23,228 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:29:23,228 INFO ]: Found error trace [2018-06-22 02:29:23,228 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:23,228 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:23,228 INFO ]: Analyzing trace with hash 701305521, now seen corresponding path program 1 times [2018-06-22 02:29:23,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:23,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:23,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:23,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:23,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:23,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:23,321 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:23,321 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:23,321 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:29:23,322 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:29:23,322 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:29:23,322 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:23,322 INFO ]: Start difference. First operand 133 states and 258 transitions. Second operand 3 states. [2018-06-22 02:29:23,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:23,597 INFO ]: Finished difference Result 186 states and 393 transitions. [2018-06-22 02:29:23,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:29:23,598 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:29:23,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:23,607 INFO ]: With dead ends: 186 [2018-06-22 02:29:23,607 INFO ]: Without dead ends: 186 [2018-06-22 02:29:23,607 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 02:29:23,608 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 02:29:23,640 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 135. [2018-06-22 02:29:23,640 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 02:29:23,647 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 265 transitions. [2018-06-22 02:29:23,647 INFO ]: Start accepts. Automaton has 135 states and 265 transitions. Word has length 12 [2018-06-22 02:29:23,647 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:23,648 INFO ]: Abstraction has 135 states and 265 transitions. [2018-06-22 02:29:23,648 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:29:23,648 INFO ]: Start isEmpty. Operand 135 states and 265 transitions. [2018-06-22 02:29:23,651 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:29:23,651 INFO ]: Found error trace [2018-06-22 02:29:23,651 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:23,651 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:23,651 INFO ]: Analyzing trace with hash 697611437, now seen corresponding path program 1 times [2018-06-22 02:29:23,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:23,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:23,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:23,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:23,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:23,671 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:23,737 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:23,737 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:23,737 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:23,737 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:23,737 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:23,737 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:23,738 INFO ]: Start difference. First operand 135 states and 265 transitions. Second operand 4 states. [2018-06-22 02:29:23,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:23,913 INFO ]: Finished difference Result 191 states and 398 transitions. [2018-06-22 02:29:23,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:29:23,915 INFO ]: Start accepts. Automaton has 4 states. Word has length 12 [2018-06-22 02:29:23,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:23,925 INFO ]: With dead ends: 191 [2018-06-22 02:29:23,925 INFO ]: Without dead ends: 186 [2018-06-22 02:29:23,925 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 02:29:23,925 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 02:29:23,960 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 135. [2018-06-22 02:29:23,964 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 02:29:23,967 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 260 transitions. [2018-06-22 02:29:23,967 INFO ]: Start accepts. Automaton has 135 states and 260 transitions. Word has length 12 [2018-06-22 02:29:23,967 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:23,967 INFO ]: Abstraction has 135 states and 260 transitions. [2018-06-22 02:29:23,967 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:23,967 INFO ]: Start isEmpty. Operand 135 states and 260 transitions. [2018-06-22 02:29:23,969 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:29:23,969 INFO ]: Found error trace [2018-06-22 02:29:23,969 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:23,969 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:23,969 INFO ]: Analyzing trace with hash 778553584, now seen corresponding path program 1 times [2018-06-22 02:29:23,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:23,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:23,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:23,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:23,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:23,981 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:24,053 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:24,053 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:24,053 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:29:24,053 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:29:24,053 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:29:24,053 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:24,054 INFO ]: Start difference. First operand 135 states and 260 transitions. Second operand 3 states. [2018-06-22 02:29:24,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:24,115 INFO ]: Finished difference Result 170 states and 346 transitions. [2018-06-22 02:29:24,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:29:24,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:29:24,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:24,121 INFO ]: With dead ends: 170 [2018-06-22 02:29:24,121 INFO ]: Without dead ends: 170 [2018-06-22 02:29:24,122 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 02:29:24,123 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 02:29:24,146 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 140. [2018-06-22 02:29:24,146 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 02:29:24,155 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 265 transitions. [2018-06-22 02:29:24,155 INFO ]: Start accepts. Automaton has 140 states and 265 transitions. Word has length 12 [2018-06-22 02:29:24,155 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:24,155 INFO ]: Abstraction has 140 states and 265 transitions. [2018-06-22 02:29:24,155 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:29:24,155 INFO ]: Start isEmpty. Operand 140 states and 265 transitions. [2018-06-22 02:29:24,157 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:29:24,157 INFO ]: Found error trace [2018-06-22 02:29:24,157 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:24,157 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:24,157 INFO ]: Analyzing trace with hash 464467071, now seen corresponding path program 1 times [2018-06-22 02:29:24,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:24,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:24,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:24,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:24,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:24,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:24,298 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:29:24,299 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:24,299 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:29:24,299 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:29:24,299 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:29:24,299 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:24,299 INFO ]: Start difference. First operand 140 states and 265 transitions. Second operand 3 states. [2018-06-22 02:29:24,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:24,342 INFO ]: Finished difference Result 171 states and 346 transitions. [2018-06-22 02:29:24,343 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:29:24,343 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:29:24,343 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:24,346 INFO ]: With dead ends: 171 [2018-06-22 02:29:24,346 INFO ]: Without dead ends: 171 [2018-06-22 02:29:24,346 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:24,346 INFO ]: Start minimizeSevpa. Operand 171 states. [2018-06-22 02:29:24,358 INFO ]: Finished minimizeSevpa. Reduced states from 171 to 144. [2018-06-22 02:29:24,358 INFO ]: Start removeUnreachable. Operand 144 states. [2018-06-22 02:29:24,359 INFO ]: Finished removeUnreachable. Reduced from 144 states to 144 states and 268 transitions. [2018-06-22 02:29:24,360 INFO ]: Start accepts. Automaton has 144 states and 268 transitions. Word has length 12 [2018-06-22 02:29:24,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:24,360 INFO ]: Abstraction has 144 states and 268 transitions. [2018-06-22 02:29:24,360 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:29:24,360 INFO ]: Start isEmpty. Operand 144 states and 268 transitions. [2018-06-22 02:29:24,364 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:29:24,365 INFO ]: Found error trace [2018-06-22 02:29:24,365 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:24,365 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:24,365 INFO ]: Analyzing trace with hash -947599721, now seen corresponding path program 1 times [2018-06-22 02:29:24,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:24,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:24,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:24,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:24,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:24,380 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:24,535 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:29:24,535 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:24,535 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 02:29:24,545 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:24,575 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:24,584 INFO ]: Computing forward predicates... [2018-06-22 02:29:24,623 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 02:29:24,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:24,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:29:24,645 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:29:24,645 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:29:24,645 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:24,645 INFO ]: Start difference. First operand 144 states and 268 transitions. Second operand 5 states. [2018-06-22 02:29:25,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:25,224 INFO ]: Finished difference Result 186 states and 386 transitions. [2018-06-22 02:29:25,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:25,225 INFO ]: Start accepts. Automaton has 5 states. Word has length 20 [2018-06-22 02:29:25,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:25,227 INFO ]: With dead ends: 186 [2018-06-22 02:29:25,227 INFO ]: Without dead ends: 186 [2018-06-22 02:29:25,228 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:29:25,228 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 02:29:25,255 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 156. [2018-06-22 02:29:25,255 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-22 02:29:25,257 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 296 transitions. [2018-06-22 02:29:25,257 INFO ]: Start accepts. Automaton has 156 states and 296 transitions. Word has length 20 [2018-06-22 02:29:25,259 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:25,259 INFO ]: Abstraction has 156 states and 296 transitions. [2018-06-22 02:29:25,259 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:29:25,259 INFO ]: Start isEmpty. Operand 156 states and 296 transitions. [2018-06-22 02:29:25,265 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-22 02:29:25,265 INFO ]: Found error trace [2018-06-22 02:29:25,265 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:25,265 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:25,266 INFO ]: Analyzing trace with hash 412517019, now seen corresponding path program 1 times [2018-06-22 02:29:25,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:25,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:25,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:25,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:25,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:25,277 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:25,303 INFO ]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:25,303 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:25,303 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:29:25,303 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:29:25,303 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:29:25,303 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:25,303 INFO ]: Start difference. First operand 156 states and 296 transitions. Second operand 3 states. [2018-06-22 02:29:25,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:25,353 INFO ]: Finished difference Result 180 states and 369 transitions. [2018-06-22 02:29:25,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:29:25,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-22 02:29:25,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:25,356 INFO ]: With dead ends: 180 [2018-06-22 02:29:25,356 INFO ]: Without dead ends: 180 [2018-06-22 02:29:25,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 02:29:25,357 INFO ]: Start minimizeSevpa. Operand 180 states. [2018-06-22 02:29:25,378 INFO ]: Finished minimizeSevpa. Reduced states from 180 to 162. [2018-06-22 02:29:25,378 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-22 02:29:25,380 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 308 transitions. [2018-06-22 02:29:25,380 INFO ]: Start accepts. Automaton has 162 states and 308 transitions. Word has length 20 [2018-06-22 02:29:25,381 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:25,381 INFO ]: Abstraction has 162 states and 308 transitions. [2018-06-22 02:29:25,381 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:29:25,381 INFO ]: Start isEmpty. Operand 162 states and 308 transitions. [2018-06-22 02:29:25,386 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:29:25,386 INFO ]: Found error trace [2018-06-22 02:29:25,386 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:25,386 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:25,386 INFO ]: Analyzing trace with hash 1948237583, now seen corresponding path program 1 times [2018-06-22 02:29:25,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:25,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:25,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:25,387 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:25,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:25,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:25,491 INFO ]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 02:29:25,491 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:25,491 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:29:25,493 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:29:25,493 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:29:25,493 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:29:25,493 INFO ]: Start difference. First operand 162 states and 308 transitions. Second operand 3 states. [2018-06-22 02:29:25,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:25,549 INFO ]: Finished difference Result 164 states and 310 transitions. [2018-06-22 02:29:25,549 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:29:25,549 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-22 02:29:25,549 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:25,551 INFO ]: With dead ends: 164 [2018-06-22 02:29:25,551 INFO ]: Without dead ends: 162 [2018-06-22 02:29:25,551 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 02:29:25,551 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-22 02:29:25,560 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-06-22 02:29:25,561 INFO ]: Start removeUnreachable. Operand 162 states. [2018-06-22 02:29:25,562 INFO ]: Finished removeUnreachable. Reduced from 162 states to 162 states and 306 transitions. [2018-06-22 02:29:25,563 INFO ]: Start accepts. Automaton has 162 states and 306 transitions. Word has length 21 [2018-06-22 02:29:25,563 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:25,563 INFO ]: Abstraction has 162 states and 306 transitions. [2018-06-22 02:29:25,563 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:29:25,563 INFO ]: Start isEmpty. Operand 162 states and 306 transitions. [2018-06-22 02:29:25,568 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:29:25,568 INFO ]: Found error trace [2018-06-22 02:29:25,568 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:25,568 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:25,568 INFO ]: Analyzing trace with hash 588120843, now seen corresponding path program 1 times [2018-06-22 02:29:25,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:25,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:25,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:25,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:25,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:25,582 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:25,864 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-06-22 02:29:25,956 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:29:25,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:25,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:25,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:25,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:26,000 INFO ]: Computing forward predicates... [2018-06-22 02:29:26,144 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:29:26,165 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:26,165 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-22 02:29:26,165 INFO ]: Interpolant automaton has 9 states [2018-06-22 02:29:26,166 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 02:29:26,166 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 02:29:26,166 INFO ]: Start difference. First operand 162 states and 306 transitions. Second operand 9 states. [2018-06-22 02:29:27,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:27,027 INFO ]: Finished difference Result 329 states and 706 transitions. [2018-06-22 02:29:27,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:29:27,027 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 02:29:27,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:27,032 INFO ]: With dead ends: 329 [2018-06-22 02:29:27,032 INFO ]: Without dead ends: 278 [2018-06-22 02:29:27,032 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:29:27,033 INFO ]: Start minimizeSevpa. Operand 278 states. [2018-06-22 02:29:27,062 INFO ]: Finished minimizeSevpa. Reduced states from 278 to 194. [2018-06-22 02:29:27,062 INFO ]: Start removeUnreachable. Operand 194 states. [2018-06-22 02:29:27,064 INFO ]: Finished removeUnreachable. Reduced from 194 states to 194 states and 361 transitions. [2018-06-22 02:29:27,064 INFO ]: Start accepts. Automaton has 194 states and 361 transitions. Word has length 21 [2018-06-22 02:29:27,064 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:27,064 INFO ]: Abstraction has 194 states and 361 transitions. [2018-06-22 02:29:27,064 INFO ]: Interpolant automaton has 9 states. [2018-06-22 02:29:27,065 INFO ]: Start isEmpty. Operand 194 states and 361 transitions. [2018-06-22 02:29:27,068 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:29:27,069 INFO ]: Found error trace [2018-06-22 02:29:27,069 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:27,069 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:27,069 INFO ]: Analyzing trace with hash -771995897, now seen corresponding path program 1 times [2018-06-22 02:29:27,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:27,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:27,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:27,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:27,208 INFO ]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:29:27,208 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:27,208 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:27,208 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:27,208 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:27,208 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:27,209 INFO ]: Start difference. First operand 194 states and 361 transitions. Second operand 4 states. [2018-06-22 02:29:27,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:27,527 INFO ]: Finished difference Result 237 states and 441 transitions. [2018-06-22 02:29:27,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:27,527 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 02:29:27,527 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:27,529 INFO ]: With dead ends: 237 [2018-06-22 02:29:27,529 INFO ]: Without dead ends: 191 [2018-06-22 02:29:27,529 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:27,529 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-22 02:29:27,539 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-06-22 02:29:27,539 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-22 02:29:27,541 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 345 transitions. [2018-06-22 02:29:27,541 INFO ]: Start accepts. Automaton has 191 states and 345 transitions. Word has length 21 [2018-06-22 02:29:27,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:27,541 INFO ]: Abstraction has 191 states and 345 transitions. [2018-06-22 02:29:27,541 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:27,541 INFO ]: Start isEmpty. Operand 191 states and 345 transitions. [2018-06-22 02:29:27,543 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:29:27,543 INFO ]: Found error trace [2018-06-22 02:29:27,543 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:27,543 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:27,544 INFO ]: Analyzing trace with hash -1760208483, now seen corresponding path program 1 times [2018-06-22 02:29:27,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:27,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:27,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:27,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:27,633 INFO ]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:27,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:27,633 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:27,633 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:27,633 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:27,633 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:27,633 INFO ]: Start difference. First operand 191 states and 345 transitions. Second operand 4 states. [2018-06-22 02:29:27,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:27,676 INFO ]: Finished difference Result 219 states and 426 transitions. [2018-06-22 02:29:27,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:29:27,677 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 02:29:27,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:27,678 INFO ]: With dead ends: 219 [2018-06-22 02:29:27,678 INFO ]: Without dead ends: 219 [2018-06-22 02:29:27,679 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 02:29:27,679 INFO ]: Start minimizeSevpa. Operand 219 states. [2018-06-22 02:29:27,691 INFO ]: Finished minimizeSevpa. Reduced states from 219 to 198. [2018-06-22 02:29:27,692 INFO ]: Start removeUnreachable. Operand 198 states. [2018-06-22 02:29:27,693 INFO ]: Finished removeUnreachable. Reduced from 198 states to 198 states and 352 transitions. [2018-06-22 02:29:27,693 INFO ]: Start accepts. Automaton has 198 states and 352 transitions. Word has length 21 [2018-06-22 02:29:27,694 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:27,694 INFO ]: Abstraction has 198 states and 352 transitions. [2018-06-22 02:29:27,694 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:27,694 INFO ]: Start isEmpty. Operand 198 states and 352 transitions. [2018-06-22 02:29:27,696 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:29:27,696 INFO ]: Found error trace [2018-06-22 02:29:27,696 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:27,696 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:27,696 INFO ]: Analyzing trace with hash 499558394, now seen corresponding path program 1 times [2018-06-22 02:29:27,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:27,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:27,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:27,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,702 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:27,816 INFO ]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 02:29:27,816 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:27,816 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:29:27,816 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:29:27,816 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:29:27,816 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:29:27,816 INFO ]: Start difference. First operand 198 states and 352 transitions. Second operand 4 states. [2018-06-22 02:29:27,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:27,915 INFO ]: Finished difference Result 223 states and 394 transitions. [2018-06-22 02:29:27,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:29:27,916 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 02:29:27,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:27,917 INFO ]: With dead ends: 223 [2018-06-22 02:29:27,917 INFO ]: Without dead ends: 164 [2018-06-22 02:29:27,917 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:27,918 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 02:29:27,926 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-06-22 02:29:27,926 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 02:29:27,928 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 284 transitions. [2018-06-22 02:29:27,928 INFO ]: Start accepts. Automaton has 164 states and 284 transitions. Word has length 21 [2018-06-22 02:29:27,928 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:27,928 INFO ]: Abstraction has 164 states and 284 transitions. [2018-06-22 02:29:27,928 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:29:27,928 INFO ]: Start isEmpty. Operand 164 states and 284 transitions. [2018-06-22 02:29:27,930 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:29:27,930 INFO ]: Found error trace [2018-06-22 02:29:27,930 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:27,930 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:27,930 INFO ]: Analyzing trace with hash -395222309, now seen corresponding path program 1 times [2018-06-22 02:29:27,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:27,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:27,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:27,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:27,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:28,082 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:29:28,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:28,082 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:28,088 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:28,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:28,108 INFO ]: Computing forward predicates... [2018-06-22 02:29:28,129 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:29:28,163 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:28,163 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:29:28,164 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:29:28,164 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:29:28,164 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:28,164 INFO ]: Start difference. First operand 164 states and 284 transitions. Second operand 5 states. [2018-06-22 02:29:28,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:28,347 INFO ]: Finished difference Result 206 states and 397 transitions. [2018-06-22 02:29:28,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:29:28,347 INFO ]: Start accepts. Automaton has 5 states. Word has length 22 [2018-06-22 02:29:28,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:28,349 INFO ]: With dead ends: 206 [2018-06-22 02:29:28,349 INFO ]: Without dead ends: 206 [2018-06-22 02:29:28,349 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:28,349 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-22 02:29:28,359 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 164. [2018-06-22 02:29:28,359 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 02:29:28,361 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 284 transitions. [2018-06-22 02:29:28,361 INFO ]: Start accepts. Automaton has 164 states and 284 transitions. Word has length 22 [2018-06-22 02:29:28,361 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:28,361 INFO ]: Abstraction has 164 states and 284 transitions. [2018-06-22 02:29:28,361 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:29:28,361 INFO ]: Start isEmpty. Operand 164 states and 284 transitions. [2018-06-22 02:29:28,362 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:29:28,363 INFO ]: Found error trace [2018-06-22 02:29:28,363 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:28,363 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:28,363 INFO ]: Analyzing trace with hash 21389681, now seen corresponding path program 1 times [2018-06-22 02:29:28,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:28,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:28,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:28,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:28,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:28,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:28,530 INFO ]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:28,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:28,530 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 02:29:28,530 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:29:28,531 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:29:28,531 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:29:28,531 INFO ]: Start difference. First operand 164 states and 284 transitions. Second operand 6 states. [2018-06-22 02:29:28,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:28,810 INFO ]: Finished difference Result 247 states and 545 transitions. [2018-06-22 02:29:28,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 02:29:28,810 INFO ]: Start accepts. Automaton has 6 states. Word has length 23 [2018-06-22 02:29:28,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:28,813 INFO ]: With dead ends: 247 [2018-06-22 02:29:28,813 INFO ]: Without dead ends: 247 [2018-06-22 02:29:28,813 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:29:28,813 INFO ]: Start minimizeSevpa. Operand 247 states. [2018-06-22 02:29:28,828 INFO ]: Finished minimizeSevpa. Reduced states from 247 to 172. [2018-06-22 02:29:28,828 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 02:29:28,829 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 312 transitions. [2018-06-22 02:29:28,829 INFO ]: Start accepts. Automaton has 172 states and 312 transitions. Word has length 23 [2018-06-22 02:29:28,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:28,830 INFO ]: Abstraction has 172 states and 312 transitions. [2018-06-22 02:29:28,830 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:29:28,830 INFO ]: Start isEmpty. Operand 172 states and 312 transitions. [2018-06-22 02:29:28,831 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:29:28,832 INFO ]: Found error trace [2018-06-22 02:29:28,832 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:28,832 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:28,832 INFO ]: Analyzing trace with hash -1027227599, now seen corresponding path program 1 times [2018-06-22 02:29:28,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:28,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:28,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:28,833 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:28,833 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:28,840 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:29,043 INFO ]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:29,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:29,043 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 02:29:29,043 INFO ]: Interpolant automaton has 6 states [2018-06-22 02:29:29,043 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 02:29:29,043 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 02:29:29,044 INFO ]: Start difference. First operand 172 states and 312 transitions. Second operand 6 states. [2018-06-22 02:29:29,521 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 02:29:30,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:30,177 INFO ]: Finished difference Result 242 states and 543 transitions. [2018-06-22 02:29:30,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:29:30,177 INFO ]: Start accepts. Automaton has 6 states. Word has length 23 [2018-06-22 02:29:30,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:30,179 INFO ]: With dead ends: 242 [2018-06-22 02:29:30,179 INFO ]: Without dead ends: 242 [2018-06-22 02:29:30,179 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:29:30,180 INFO ]: Start minimizeSevpa. Operand 242 states. [2018-06-22 02:29:30,196 INFO ]: Finished minimizeSevpa. Reduced states from 242 to 177. [2018-06-22 02:29:30,196 INFO ]: Start removeUnreachable. Operand 177 states. [2018-06-22 02:29:30,198 INFO ]: Finished removeUnreachable. Reduced from 177 states to 177 states and 330 transitions. [2018-06-22 02:29:30,198 INFO ]: Start accepts. Automaton has 177 states and 330 transitions. Word has length 23 [2018-06-22 02:29:30,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:30,198 INFO ]: Abstraction has 177 states and 330 transitions. [2018-06-22 02:29:30,198 INFO ]: Interpolant automaton has 6 states. [2018-06-22 02:29:30,198 INFO ]: Start isEmpty. Operand 177 states and 330 transitions. [2018-06-22 02:29:30,200 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:29:30,200 INFO ]: Found error trace [2018-06-22 02:29:30,200 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:30,200 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:30,200 INFO ]: Analyzing trace with hash -46466792, now seen corresponding path program 1 times [2018-06-22 02:29:30,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:30,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:30,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:30,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:30,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:30,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:30,283 INFO ]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:30,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:30,284 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:30,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:30,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:30,306 INFO ]: Computing forward predicates... [2018-06-22 02:29:30,324 INFO ]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:30,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:30,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 02:29:30,343 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:29:30,343 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:29:30,343 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:30,343 INFO ]: Start difference. First operand 177 states and 330 transitions. Second operand 5 states. [2018-06-22 02:29:30,457 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-06-22 02:29:30,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:30,541 INFO ]: Finished difference Result 212 states and 445 transitions. [2018-06-22 02:29:30,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:29:30,541 INFO ]: Start accepts. Automaton has 5 states. Word has length 23 [2018-06-22 02:29:30,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:30,543 INFO ]: With dead ends: 212 [2018-06-22 02:29:30,543 INFO ]: Without dead ends: 212 [2018-06-22 02:29:30,543 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:30,543 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-22 02:29:30,554 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 178. [2018-06-22 02:29:30,555 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-22 02:29:30,556 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 324 transitions. [2018-06-22 02:29:30,556 INFO ]: Start accepts. Automaton has 178 states and 324 transitions. Word has length 23 [2018-06-22 02:29:30,556 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:30,556 INFO ]: Abstraction has 178 states and 324 transitions. [2018-06-22 02:29:30,556 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:29:30,556 INFO ]: Start isEmpty. Operand 178 states and 324 transitions. [2018-06-22 02:29:30,558 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 02:29:30,558 INFO ]: Found error trace [2018-06-22 02:29:30,558 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:30,558 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:30,558 INFO ]: Analyzing trace with hash 1199923509, now seen corresponding path program 1 times [2018-06-22 02:29:30,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:30,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:30,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:30,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:30,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:30,567 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:30,796 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:29:30,796 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:30,796 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:29:30,796 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:29:30,797 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:29:30,797 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:29:30,797 INFO ]: Start difference. First operand 178 states and 324 transitions. Second operand 5 states. [2018-06-22 02:29:31,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:31,246 INFO ]: Finished difference Result 255 states and 589 transitions. [2018-06-22 02:29:31,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:29:31,246 INFO ]: Start accepts. Automaton has 5 states. Word has length 24 [2018-06-22 02:29:31,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:31,247 INFO ]: With dead ends: 255 [2018-06-22 02:29:31,247 INFO ]: Without dead ends: 255 [2018-06-22 02:29:31,248 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:31,248 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-22 02:29:31,268 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 173. [2018-06-22 02:29:31,268 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-22 02:29:31,270 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 308 transitions. [2018-06-22 02:29:31,270 INFO ]: Start accepts. Automaton has 173 states and 308 transitions. Word has length 24 [2018-06-22 02:29:31,270 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:31,270 INFO ]: Abstraction has 173 states and 308 transitions. [2018-06-22 02:29:31,270 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:29:31,270 INFO ]: Start isEmpty. Operand 173 states and 308 transitions. [2018-06-22 02:29:31,273 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:29:31,273 INFO ]: Found error trace [2018-06-22 02:29:31,273 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:31,273 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:31,273 INFO ]: Analyzing trace with hash -1573729171, now seen corresponding path program 1 times [2018-06-22 02:29:31,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:31,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:31,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:31,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:31,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:31,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:31,401 INFO ]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 02:29:31,401 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:31,401 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 02:29:31,401 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:29:31,402 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:29:31,402 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:31,402 INFO ]: Start difference. First operand 173 states and 308 transitions. Second operand 7 states. [2018-06-22 02:29:31,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:31,840 INFO ]: Finished difference Result 208 states and 426 transitions. [2018-06-22 02:29:31,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:29:31,840 INFO ]: Start accepts. Automaton has 7 states. Word has length 32 [2018-06-22 02:29:31,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:31,842 INFO ]: With dead ends: 208 [2018-06-22 02:29:31,842 INFO ]: Without dead ends: 206 [2018-06-22 02:29:31,842 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:29:31,842 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-22 02:29:31,854 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 172. [2018-06-22 02:29:31,854 INFO ]: Start removeUnreachable. Operand 172 states. [2018-06-22 02:29:31,855 INFO ]: Finished removeUnreachable. Reduced from 172 states to 172 states and 304 transitions. [2018-06-22 02:29:31,855 INFO ]: Start accepts. Automaton has 172 states and 304 transitions. Word has length 32 [2018-06-22 02:29:31,855 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:31,855 INFO ]: Abstraction has 172 states and 304 transitions. [2018-06-22 02:29:31,856 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:29:31,856 INFO ]: Start isEmpty. Operand 172 states and 304 transitions. [2018-06-22 02:29:31,858 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:29:31,858 INFO ]: Found error trace [2018-06-22 02:29:31,858 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:31,858 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:31,858 INFO ]: Analyzing trace with hash -1016804563, now seen corresponding path program 1 times [2018-06-22 02:29:31,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:31,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:31,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:31,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:31,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:31,873 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:32,124 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-22 02:29:32,322 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 02:29:32,525 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 02:29:32,784 INFO ]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:29:32,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:32,784 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:32,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:32,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:32,822 INFO ]: Computing forward predicates... [2018-06-22 02:29:33,042 INFO ]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:29:33,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:33,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-06-22 02:29:33,074 INFO ]: Interpolant automaton has 14 states [2018-06-22 02:29:33,074 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 02:29:33,074 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 02:29:33,074 INFO ]: Start difference. First operand 172 states and 304 transitions. Second operand 14 states. [2018-06-22 02:29:34,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:34,996 INFO ]: Finished difference Result 233 states and 479 transitions. [2018-06-22 02:29:34,998 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 02:29:34,998 INFO ]: Start accepts. Automaton has 14 states. Word has length 32 [2018-06-22 02:29:34,998 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:34,999 INFO ]: With dead ends: 233 [2018-06-22 02:29:34,999 INFO ]: Without dead ends: 225 [2018-06-22 02:29:34,999 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-06-22 02:29:35,000 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-22 02:29:35,010 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 171. [2018-06-22 02:29:35,010 INFO ]: Start removeUnreachable. Operand 171 states. [2018-06-22 02:29:35,012 INFO ]: Finished removeUnreachable. Reduced from 171 states to 171 states and 300 transitions. [2018-06-22 02:29:35,012 INFO ]: Start accepts. Automaton has 171 states and 300 transitions. Word has length 32 [2018-06-22 02:29:35,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:35,012 INFO ]: Abstraction has 171 states and 300 transitions. [2018-06-22 02:29:35,012 INFO ]: Interpolant automaton has 14 states. [2018-06-22 02:29:35,012 INFO ]: Start isEmpty. Operand 171 states and 300 transitions. [2018-06-22 02:29:35,014 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:29:35,014 INFO ]: Found error trace [2018-06-22 02:29:35,014 INFO ]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:35,014 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:35,014 INFO ]: Analyzing trace with hash 978617756, now seen corresponding path program 1 times [2018-06-22 02:29:35,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:35,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:35,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:35,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:35,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:35,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:35,105 INFO ]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:29:35,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:35,106 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:35,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:35,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:35,139 INFO ]: Computing forward predicates... [2018-06-22 02:29:35,151 INFO ]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:29:35,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:35,185 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 02:29:35,186 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:29:35,186 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:29:35,186 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:35,186 INFO ]: Start difference. First operand 171 states and 300 transitions. Second operand 7 states. [2018-06-22 02:29:35,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:35,454 INFO ]: Finished difference Result 265 states and 613 transitions. [2018-06-22 02:29:35,454 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 02:29:35,454 INFO ]: Start accepts. Automaton has 7 states. Word has length 32 [2018-06-22 02:29:35,454 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:35,456 INFO ]: With dead ends: 265 [2018-06-22 02:29:35,456 INFO ]: Without dead ends: 265 [2018-06-22 02:29:35,456 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:29:35,456 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-22 02:29:35,481 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 179. [2018-06-22 02:29:35,481 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-22 02:29:35,496 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 315 transitions. [2018-06-22 02:29:35,496 INFO ]: Start accepts. Automaton has 179 states and 315 transitions. Word has length 32 [2018-06-22 02:29:35,496 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:35,496 INFO ]: Abstraction has 179 states and 315 transitions. [2018-06-22 02:29:35,496 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:29:35,496 INFO ]: Start isEmpty. Operand 179 states and 315 transitions. [2018-06-22 02:29:35,501 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:29:35,501 INFO ]: Found error trace [2018-06-22 02:29:35,501 INFO ]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:35,501 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:35,501 INFO ]: Analyzing trace with hash -1914220384, now seen corresponding path program 1 times [2018-06-22 02:29:35,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:35,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:35,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:35,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:35,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:35,522 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:35,862 INFO ]: Checked inductivity of 19 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:29:35,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:35,862 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:35,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:35,915 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:35,917 INFO ]: Computing forward predicates... [2018-06-22 02:29:35,964 INFO ]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 02:29:35,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:35,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-22 02:29:35,984 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:29:35,984 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:29:35,984 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:29:35,984 INFO ]: Start difference. First operand 179 states and 315 transitions. Second operand 10 states. [2018-06-22 02:29:37,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:37,109 INFO ]: Finished difference Result 258 states and 593 transitions. [2018-06-22 02:29:37,110 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:29:37,110 INFO ]: Start accepts. Automaton has 10 states. Word has length 32 [2018-06-22 02:29:37,110 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:37,112 INFO ]: With dead ends: 258 [2018-06-22 02:29:37,112 INFO ]: Without dead ends: 249 [2018-06-22 02:29:37,112 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-06-22 02:29:37,113 INFO ]: Start minimizeSevpa. Operand 249 states. [2018-06-22 02:29:37,123 INFO ]: Finished minimizeSevpa. Reduced states from 249 to 146. [2018-06-22 02:29:37,123 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-22 02:29:37,124 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 251 transitions. [2018-06-22 02:29:37,124 INFO ]: Start accepts. Automaton has 146 states and 251 transitions. Word has length 32 [2018-06-22 02:29:37,124 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:37,124 INFO ]: Abstraction has 146 states and 251 transitions. [2018-06-22 02:29:37,124 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:29:37,125 INFO ]: Start isEmpty. Operand 146 states and 251 transitions. [2018-06-22 02:29:37,126 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 02:29:37,126 INFO ]: Found error trace [2018-06-22 02:29:37,126 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:37,126 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:37,126 INFO ]: Analyzing trace with hash -1340775976, now seen corresponding path program 1 times [2018-06-22 02:29:37,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:37,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:37,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:37,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:37,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:37,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:37,334 INFO ]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:29:37,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:29:37,334 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 02:29:37,335 INFO ]: Interpolant automaton has 7 states [2018-06-22 02:29:37,335 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 02:29:37,335 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:29:37,335 INFO ]: Start difference. First operand 146 states and 251 transitions. Second operand 7 states. [2018-06-22 02:29:37,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:37,696 INFO ]: Finished difference Result 234 states and 502 transitions. [2018-06-22 02:29:37,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 02:29:37,697 INFO ]: Start accepts. Automaton has 7 states. Word has length 34 [2018-06-22 02:29:37,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:37,698 INFO ]: With dead ends: 234 [2018-06-22 02:29:37,698 INFO ]: Without dead ends: 234 [2018-06-22 02:29:37,698 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 02:29:37,699 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-22 02:29:37,707 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 148. [2018-06-22 02:29:37,707 INFO ]: Start removeUnreachable. Operand 148 states. [2018-06-22 02:29:37,708 INFO ]: Finished removeUnreachable. Reduced from 148 states to 148 states and 253 transitions. [2018-06-22 02:29:37,708 INFO ]: Start accepts. Automaton has 148 states and 253 transitions. Word has length 34 [2018-06-22 02:29:37,708 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:37,708 INFO ]: Abstraction has 148 states and 253 transitions. [2018-06-22 02:29:37,708 INFO ]: Interpolant automaton has 7 states. [2018-06-22 02:29:37,708 INFO ]: Start isEmpty. Operand 148 states and 253 transitions. [2018-06-22 02:29:37,710 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 02:29:37,710 INFO ]: Found error trace [2018-06-22 02:29:37,710 INFO ]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:37,710 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:37,710 INFO ]: Analyzing trace with hash -1049398282, now seen corresponding path program 1 times [2018-06-22 02:29:37,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:37,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:37,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:37,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:37,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:37,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:37,787 INFO ]: Checked inductivity of 40 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 02:29:37,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:37,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:37,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:37,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:37,839 INFO ]: Computing forward predicates... [2018-06-22 02:29:37,943 INFO ]: Checked inductivity of 40 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 02:29:37,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:37,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-06-22 02:29:37,963 INFO ]: Interpolant automaton has 11 states [2018-06-22 02:29:37,964 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 02:29:37,964 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 02:29:37,964 INFO ]: Start difference. First operand 148 states and 253 transitions. Second operand 11 states. [2018-06-22 02:29:38,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:38,400 INFO ]: Finished difference Result 238 states and 484 transitions. [2018-06-22 02:29:38,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 02:29:38,400 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 02:29:38,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:38,402 INFO ]: With dead ends: 238 [2018-06-22 02:29:38,402 INFO ]: Without dead ends: 238 [2018-06-22 02:29:38,402 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-06-22 02:29:38,402 INFO ]: Start minimizeSevpa. Operand 238 states. [2018-06-22 02:29:38,409 INFO ]: Finished minimizeSevpa. Reduced states from 238 to 155. [2018-06-22 02:29:38,409 INFO ]: Start removeUnreachable. Operand 155 states. [2018-06-22 02:29:38,410 INFO ]: Finished removeUnreachable. Reduced from 155 states to 155 states and 263 transitions. [2018-06-22 02:29:38,410 INFO ]: Start accepts. Automaton has 155 states and 263 transitions. Word has length 43 [2018-06-22 02:29:38,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:38,410 INFO ]: Abstraction has 155 states and 263 transitions. [2018-06-22 02:29:38,410 INFO ]: Interpolant automaton has 11 states. [2018-06-22 02:29:38,410 INFO ]: Start isEmpty. Operand 155 states and 263 transitions. [2018-06-22 02:29:38,412 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 02:29:38,412 INFO ]: Found error trace [2018-06-22 02:29:38,412 INFO ]: trace histogram [5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:29:38,413 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:29:38,415 INFO ]: Analyzing trace with hash 114415614, now seen corresponding path program 1 times [2018-06-22 02:29:38,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:29:38,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:29:38,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:38,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:38,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:29:38,429 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:38,520 INFO ]: Checked inductivity of 69 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 02:29:38,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:29:38,520 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:29:38,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:29:38,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:29:38,565 INFO ]: Computing forward predicates... [2018-06-22 02:29:38,672 INFO ]: Checked inductivity of 69 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 02:29:38,694 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:29:38,694 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2018-06-22 02:29:38,694 INFO ]: Interpolant automaton has 13 states [2018-06-22 02:29:38,694 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 02:29:38,694 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 02:29:38,695 INFO ]: Start difference. First operand 155 states and 263 transitions. Second operand 13 states. [2018-06-22 02:29:39,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:29:39,098 INFO ]: Finished difference Result 129 states and 198 transitions. [2018-06-22 02:29:39,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:29:39,098 INFO ]: Start accepts. Automaton has 13 states. Word has length 53 [2018-06-22 02:29:39,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:29:39,098 INFO ]: With dead ends: 129 [2018-06-22 02:29:39,098 INFO ]: Without dead ends: 0 [2018-06-22 02:29:39,099 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:29:39,099 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:29:39,099 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:29:39,099 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:29:39,099 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:29:39,099 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-06-22 02:29:39,099 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:29:39,099 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:29:39,099 INFO ]: Interpolant automaton has 13 states. [2018-06-22 02:29:39,099 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:29:39,099 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:29:39,103 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:29:39 BoogieIcfgContainer [2018-06-22 02:29:39,103 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:29:39,104 INFO ]: Toolchain (without parser) took 18987.63 ms. Allocated memory was 295.7 MB in the beginning and 448.3 MB in the end (delta: 152.6 MB). Free memory was 249.1 MB in the beginning and 233.2 MB in the end (delta: 15.8 MB). Peak memory consumption was 168.4 MB. Max. memory is 3.6 GB. [2018-06-22 02:29:39,105 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 295.7 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:29:39,105 INFO ]: ChcToBoogie took 73.07 ms. Allocated memory is still 295.7 MB. Free memory was 249.1 MB in the beginning and 246.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:29:39,106 INFO ]: Boogie Preprocessor took 64.19 ms. Allocated memory is still 295.7 MB. Free memory was 246.1 MB in the beginning and 245.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-22 02:29:39,106 INFO ]: RCFGBuilder took 502.91 ms. Allocated memory is still 295.7 MB. Free memory was 245.1 MB in the beginning and 228.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:29:39,106 INFO ]: TraceAbstraction took 18336.78 ms. Allocated memory was 295.7 MB in the beginning and 448.3 MB in the end (delta: 152.6 MB). Free memory was 228.1 MB in the beginning and 233.2 MB in the end (delta: -5.2 MB). Peak memory consumption was 147.4 MB. Max. memory is 3.6 GB. [2018-06-22 02:29:39,109 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 295.7 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.07 ms. Allocated memory is still 295.7 MB. Free memory was 249.1 MB in the beginning and 246.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 64.19 ms. Allocated memory is still 295.7 MB. Free memory was 246.1 MB in the beginning and 245.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 502.91 ms. Allocated memory is still 295.7 MB. Free memory was 245.1 MB in the beginning and 228.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 18336.78 ms. Allocated memory was 295.7 MB in the beginning and 448.3 MB in the end (delta: 152.6 MB). Free memory was 228.1 MB in the beginning and 233.2 MB in the end (delta: -5.2 MB). Peak memory consumption was 147.4 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, 31 locations, 1 error locations. SAFE Result, 18.2s OverallTime, 27 OverallIterations, 5 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2029 SDtfs, 2117 SDslu, 5317 SDs, 0 SdLazy, 4645 SolverSat, 768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 1056 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 845 ConstructedInterpolants, 0 QuantifiedInterpolants, 51702 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1566 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 36 InterpolantComputations, 18 PerfectInterpolantSequences, 458/486 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/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-29-39-121.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__add-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-29-39-121.csv Received shutdown request...