java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:34:21,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:34:21,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:34:21,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:34:21,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:34:21,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:34:21,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:34:21,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:34:21,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:34:21,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:34:21,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:34:21,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:34:21,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:34:21,131 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:34:21,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:34:21,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:34:21,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:34:21,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:34:21,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:34:21,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:34:21,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:34:21,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:34:21,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:34:21,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:34:21,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:34:21,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:34:21,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:34:21,158 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:34:21,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:34:21,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:34:21,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:34:21,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:34:21,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:34:21,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:34:21,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:34:21,166 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:34:21,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:34:21,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:34:21,182 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:34:21,182 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:34:21,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:34:21,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:34:21,183 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:34:21,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:34:21,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:34:21,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:34:21,184 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:34:21,184 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:34:21,184 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:34:21,184 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:34:21,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:34:21,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:34:21,188 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:34:21,190 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:34:21,190 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:34:21,230 INFO ]: Repository-Root is: /tmp [2018-06-22 01:34:21,245 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:34:21,249 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:34:21,250 INFO ]: Initializing SmtParser... [2018-06-22 01:34:21,251 INFO ]: SmtParser initialized [2018-06-22 01:34:21,251 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 [2018-06-22 01:34:21,252 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:34:21,337 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 unknown [2018-06-22 01:34:21,556 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/025c-horn.smt2 [2018-06-22 01:34:21,560 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:34:21,566 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:34:21,566 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:34:21,566 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:34:21,566 INFO ]: ChcToBoogie initialized [2018-06-22 01:34:21,570 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,632 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21 Unit [2018-06-22 01:34:21,633 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:34:21,633 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:34:21,633 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:34:21,633 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:34:21,654 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,654 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,660 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,660 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,671 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,673 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,674 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (1/1) ... [2018-06-22 01:34:21,677 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:34:21,678 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:34:21,678 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:34:21,678 INFO ]: RCFGBuilder initialized [2018-06-22 01:34:21,679 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (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 01:34:21,694 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:34:21,694 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:34:21,694 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:34:21,694 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:34:21,694 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:34:21,694 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 01:34:22,068 INFO ]: Using library mode [2018-06-22 01:34:22,068 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:34:22 BoogieIcfgContainer [2018-06-22 01:34:22,068 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:34:22,072 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:34:22,072 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:34:22,075 INFO ]: TraceAbstraction initialized [2018-06-22 01:34:22,075 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:34:21" (1/3) ... [2018-06-22 01:34:22,077 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e724f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:34:22, skipping insertion in model container [2018-06-22 01:34:22,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:34:21" (2/3) ... [2018-06-22 01:34:22,077 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e724f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:34:22, skipping insertion in model container [2018-06-22 01:34:22,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:34:22" (3/3) ... [2018-06-22 01:34:22,079 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:34:22,088 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:34:22,097 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:34:22,151 INFO ]: Using default assertion order modulation [2018-06-22 01:34:22,151 INFO ]: Interprodecural is true [2018-06-22 01:34:22,151 INFO ]: Hoare is false [2018-06-22 01:34:22,151 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:34:22,151 INFO ]: Backedges is TWOTRACK [2018-06-22 01:34:22,151 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:34:22,151 INFO ]: Difference is false [2018-06-22 01:34:22,151 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:34:22,151 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:34:22,169 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:34:22,181 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:34:22,181 INFO ]: Found error trace [2018-06-22 01:34:22,187 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:22,187 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:22,193 INFO ]: Analyzing trace with hash -838867242, now seen corresponding path program 1 times [2018-06-22 01:34:22,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:22,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:22,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:22,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:22,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:22,275 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:22,524 WARN ]: Spent 171.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-06-22 01:34:22,527 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:22,529 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:22,529 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:22,530 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:22,540 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:22,541 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:22,542 INFO ]: Start difference. First operand 12 states. Second operand 3 states. [2018-06-22 01:34:22,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:22,726 INFO ]: Finished difference Result 15 states and 37 transitions. [2018-06-22 01:34:22,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:22,730 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:34:22,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:22,742 INFO ]: With dead ends: 15 [2018-06-22 01:34:22,742 INFO ]: Without dead ends: 15 [2018-06-22 01:34:22,754 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 01:34:22,772 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:34:22,794 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-22 01:34:22,795 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:34:22,798 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-06-22 01:34:22,799 INFO ]: Start accepts. Automaton has 11 states and 29 transitions. Word has length 7 [2018-06-22 01:34:22,800 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:22,800 INFO ]: Abstraction has 11 states and 29 transitions. [2018-06-22 01:34:22,800 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:22,800 INFO ]: Start isEmpty. Operand 11 states and 29 transitions. [2018-06-22 01:34:22,800 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:22,800 INFO ]: Found error trace [2018-06-22 01:34:22,800 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:22,801 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:22,801 INFO ]: Analyzing trace with hash -228919574, now seen corresponding path program 1 times [2018-06-22 01:34:22,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:22,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:22,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:22,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:22,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:22,811 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:22,828 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:22,828 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:22,828 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:22,830 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:22,830 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:22,830 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:22,830 INFO ]: Start difference. First operand 11 states and 29 transitions. Second operand 3 states. [2018-06-22 01:34:22,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:22,865 INFO ]: Finished difference Result 9 states and 15 transitions. [2018-06-22 01:34:22,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:22,866 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:34:22,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:22,866 INFO ]: With dead ends: 9 [2018-06-22 01:34:22,866 INFO ]: Without dead ends: 9 [2018-06-22 01:34:22,867 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:22,867 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 01:34:22,868 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 01:34:22,868 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:34:22,868 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-22 01:34:22,869 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 8 [2018-06-22 01:34:22,869 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:22,869 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-22 01:34:22,869 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:22,869 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-22 01:34:22,869 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:22,869 INFO ]: Found error trace [2018-06-22 01:34:22,869 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:22,869 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:22,869 INFO ]: Analyzing trace with hash -243338418, now seen corresponding path program 1 times [2018-06-22 01:34:22,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:22,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:22,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:22,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:22,870 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:22,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:22,937 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:22,937 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:34:22,937 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:34:22,938 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:34:22,938 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:34:22,938 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:22,938 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 3 states. [2018-06-22 01:34:23,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:23,001 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-22 01:34:23,001 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:34:23,001 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:34:23,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:23,002 INFO ]: With dead ends: 10 [2018-06-22 01:34:23,002 INFO ]: Without dead ends: 10 [2018-06-22 01:34:23,002 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:34:23,002 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:34:23,004 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-22 01:34:23,004 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 01:34:23,004 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-22 01:34:23,004 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 8 [2018-06-22 01:34:23,004 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:23,004 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-22 01:34:23,004 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:34:23,004 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-22 01:34:23,005 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:23,005 INFO ]: Found error trace [2018-06-22 01:34:23,005 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:23,005 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:23,005 INFO ]: Analyzing trace with hash -239644334, now seen corresponding path program 1 times [2018-06-22 01:34:23,005 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:23,005 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:23,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:23,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:23,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:23,015 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:23,086 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:23,086 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:23,087 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:23,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:23,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:23,141 INFO ]: Computing forward predicates... [2018-06-22 01:34:23,165 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:23,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:23,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:34:23,199 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:34:23,199 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:34:23,199 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:34:23,199 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 4 states. [2018-06-22 01:34:23,458 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:23,458 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-22 01:34:23,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:34:23,459 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:34:23,459 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:23,459 INFO ]: With dead ends: 12 [2018-06-22 01:34:23,459 INFO ]: Without dead ends: 12 [2018-06-22 01:34:23,459 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:34:23,459 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:34:23,461 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-22 01:34:23,461 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:34:23,461 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-06-22 01:34:23,461 INFO ]: Start accepts. Automaton has 10 states and 19 transitions. Word has length 8 [2018-06-22 01:34:23,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:23,461 INFO ]: Abstraction has 10 states and 19 transitions. [2018-06-22 01:34:23,461 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:34:23,462 INFO ]: Start isEmpty. Operand 10 states and 19 transitions. [2018-06-22 01:34:23,462 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:34:23,462 INFO ]: Found error trace [2018-06-22 01:34:23,462 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:23,462 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:23,462 INFO ]: Analyzing trace with hash -247032502, now seen corresponding path program 1 times [2018-06-22 01:34:23,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:23,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:23,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:23,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:23,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:23,478 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:23,625 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:23,625 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:23,625 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 01:34:23,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:23,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:23,648 INFO ]: Computing forward predicates... [2018-06-22 01:34:23,717 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:23,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:23,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-22 01:34:23,737 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:34:23,737 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:34:23,737 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:23,737 INFO ]: Start difference. First operand 10 states and 19 transitions. Second operand 5 states. [2018-06-22 01:34:23,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:23,877 INFO ]: Finished difference Result 12 states and 27 transitions. [2018-06-22 01:34:23,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:34:23,878 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 01:34:23,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:23,878 INFO ]: With dead ends: 12 [2018-06-22 01:34:23,878 INFO ]: Without dead ends: 12 [2018-06-22 01:34:23,879 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:23,879 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:34:23,880 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-22 01:34:23,880 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:34:23,880 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-06-22 01:34:23,880 INFO ]: Start accepts. Automaton has 10 states and 19 transitions. Word has length 8 [2018-06-22 01:34:23,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:23,881 INFO ]: Abstraction has 10 states and 19 transitions. [2018-06-22 01:34:23,881 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:34:23,881 INFO ]: Start isEmpty. Operand 10 states and 19 transitions. [2018-06-22 01:34:23,881 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:23,881 INFO ]: Found error trace [2018-06-22 01:34:23,881 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:23,881 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:23,881 INFO ]: Analyzing trace with hash 1041880026, now seen corresponding path program 1 times [2018-06-22 01:34:23,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:23,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:23,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:23,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:23,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:23,893 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:23,977 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:23,977 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:23,977 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 01:34:23,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:24,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:24,011 INFO ]: Computing forward predicates... [2018-06-22 01:34:24,018 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:24,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:24,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-22 01:34:24,041 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:34:24,042 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:34:24,042 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:34:24,042 INFO ]: Start difference. First operand 10 states and 19 transitions. Second operand 5 states. [2018-06-22 01:34:24,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:24,219 INFO ]: Finished difference Result 14 states and 35 transitions. [2018-06-22 01:34:24,220 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:34:24,220 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:34:24,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:24,221 INFO ]: With dead ends: 14 [2018-06-22 01:34:24,221 INFO ]: Without dead ends: 14 [2018-06-22 01:34:24,221 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 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 01:34:24,221 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:34:24,223 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:34:24,223 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:34:24,223 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-22 01:34:24,223 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 9 [2018-06-22 01:34:24,224 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:24,224 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-22 01:34:24,224 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:34:24,224 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-22 01:34:24,224 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:24,224 INFO ]: Found error trace [2018-06-22 01:34:24,224 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:24,224 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:24,224 INFO ]: Analyzing trace with hash 1034491858, now seen corresponding path program 1 times [2018-06-22 01:34:24,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:24,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:24,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:24,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:24,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:24,236 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:24,370 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:24,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:24,370 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 01:34:24,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:24,413 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:24,415 INFO ]: Computing forward predicates... [2018-06-22 01:34:24,724 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:24,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:24,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-06-22 01:34:24,743 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:24,744 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:24,744 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:24,744 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 7 states. [2018-06-22 01:34:24,940 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:24,940 INFO ]: Finished difference Result 15 states and 39 transitions. [2018-06-22 01:34:24,941 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:34:24,941 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:34:24,941 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:24,941 INFO ]: With dead ends: 15 [2018-06-22 01:34:24,941 INFO ]: Without dead ends: 15 [2018-06-22 01:34:24,942 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:24,942 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 01:34:24,943 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-22 01:34:24,943 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:34:24,943 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-22 01:34:24,944 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 9 [2018-06-22 01:34:24,944 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:24,944 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-22 01:34:24,944 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:24,944 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-22 01:34:24,944 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:24,944 INFO ]: Found error trace [2018-06-22 01:34:24,944 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:24,944 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:24,944 INFO ]: Analyzing trace with hash 1149008462, now seen corresponding path program 1 times [2018-06-22 01:34:24,944 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:24,944 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:24,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:24,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:24,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:24,955 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:25,025 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:25,025 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:25,025 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 01:34:25,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:25,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:25,044 INFO ]: Computing forward predicates... [2018-06-22 01:34:25,071 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:25,093 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:25,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:34:25,093 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:25,093 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:25,093 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:25,093 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 8 states. [2018-06-22 01:34:25,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:25,167 INFO ]: Finished difference Result 17 states and 47 transitions. [2018-06-22 01:34:25,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:34:25,167 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-22 01:34:25,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:25,168 INFO ]: With dead ends: 17 [2018-06-22 01:34:25,168 INFO ]: Without dead ends: 17 [2018-06-22 01:34:25,168 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:34:25,168 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 01:34:25,170 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-22 01:34:25,170 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:34:25,171 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-06-22 01:34:25,171 INFO ]: Start accepts. Automaton has 12 states and 27 transitions. Word has length 9 [2018-06-22 01:34:25,171 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:25,171 INFO ]: Abstraction has 12 states and 27 transitions. [2018-06-22 01:34:25,171 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:25,171 INFO ]: Start isEmpty. Operand 12 states and 27 transitions. [2018-06-22 01:34:25,171 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:34:25,171 INFO ]: Found error trace [2018-06-22 01:34:25,171 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:25,171 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:25,172 INFO ]: Analyzing trace with hash 919975254, now seen corresponding path program 2 times [2018-06-22 01:34:25,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:25,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:25,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:25,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:25,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:25,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:25,276 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:25,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:25,276 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 01:34:25,282 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:25,313 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:25,313 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:25,315 INFO ]: Computing forward predicates... [2018-06-22 01:34:25,411 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:25,432 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:25,433 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-22 01:34:25,433 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:25,433 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:25,433 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:25,433 INFO ]: Start difference. First operand 12 states and 27 transitions. Second operand 7 states. [2018-06-22 01:34:25,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:25,565 INFO ]: Finished difference Result 16 states and 43 transitions. [2018-06-22 01:34:25,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:34:25,565 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-22 01:34:25,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:25,565 INFO ]: With dead ends: 16 [2018-06-22 01:34:25,565 INFO ]: Without dead ends: 16 [2018-06-22 01:34:25,566 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:25,566 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:34:25,567 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-22 01:34:25,567 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 01:34:25,568 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-06-22 01:34:25,568 INFO ]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 9 [2018-06-22 01:34:25,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:25,568 INFO ]: Abstraction has 13 states and 31 transitions. [2018-06-22 01:34:25,568 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:25,568 INFO ]: Start isEmpty. Operand 13 states and 31 transitions. [2018-06-22 01:34:25,568 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:25,568 INFO ]: Found error trace [2018-06-22 01:34:25,568 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:25,569 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:25,569 INFO ]: Analyzing trace with hash -2066021170, now seen corresponding path program 2 times [2018-06-22 01:34:25,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:25,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:25,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:25,570 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:25,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:25,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:25,742 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:25,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:25,742 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 01:34:25,749 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:25,786 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:25,786 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:25,788 INFO ]: Computing forward predicates... [2018-06-22 01:34:25,827 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:25,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:25,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-22 01:34:25,847 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:25,847 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:25,847 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:25,847 INFO ]: Start difference. First operand 13 states and 31 transitions. Second operand 8 states. [2018-06-22 01:34:25,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:25,973 INFO ]: Finished difference Result 37 states and 108 transitions. [2018-06-22 01:34:25,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:34:25,976 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-22 01:34:25,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:25,977 INFO ]: With dead ends: 37 [2018-06-22 01:34:25,977 INFO ]: Without dead ends: 37 [2018-06-22 01:34:25,977 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:25,978 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 01:34:25,981 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-06-22 01:34:25,981 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 01:34:25,982 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2018-06-22 01:34:25,982 INFO ]: Start accepts. Automaton has 24 states and 73 transitions. Word has length 10 [2018-06-22 01:34:25,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:25,982 INFO ]: Abstraction has 24 states and 73 transitions. [2018-06-22 01:34:25,982 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:25,982 INFO ]: Start isEmpty. Operand 24 states and 73 transitions. [2018-06-22 01:34:25,983 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:25,983 INFO ]: Found error trace [2018-06-22 01:34:25,983 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:25,983 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:25,983 INFO ]: Analyzing trace with hash -2073409338, now seen corresponding path program 1 times [2018-06-22 01:34:25,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:25,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:25,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:25,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:25,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:26,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:26,054 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:26,054 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:26,054 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 01:34:26,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:26,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:26,082 INFO ]: Computing forward predicates... [2018-06-22 01:34:26,087 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:26,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:26,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:34:26,107 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:34:26,107 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:34:26,107 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:34:26,107 INFO ]: Start difference. First operand 24 states and 73 transitions. Second operand 6 states. [2018-06-22 01:34:26,175 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:26,175 INFO ]: Finished difference Result 39 states and 129 transitions. [2018-06-22 01:34:26,175 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:34:26,176 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:34:26,176 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:26,177 INFO ]: With dead ends: 39 [2018-06-22 01:34:26,177 INFO ]: Without dead ends: 39 [2018-06-22 01:34:26,177 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:26,177 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:34:26,181 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-06-22 01:34:26,181 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 01:34:26,182 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 81 transitions. [2018-06-22 01:34:26,182 INFO ]: Start accepts. Automaton has 26 states and 81 transitions. Word has length 10 [2018-06-22 01:34:26,182 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:26,182 INFO ]: Abstraction has 26 states and 81 transitions. [2018-06-22 01:34:26,182 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:34:26,182 INFO ]: Start isEmpty. Operand 26 states and 81 transitions. [2018-06-22 01:34:26,183 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:26,183 INFO ]: Found error trace [2018-06-22 01:34:26,183 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:26,183 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:26,183 INFO ]: Analyzing trace with hash 1999912918, now seen corresponding path program 2 times [2018-06-22 01:34:26,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:26,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:26,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:26,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:26,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:26,204 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:26,503 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:26,503 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:26,503 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 01:34:26,509 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:26,527 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:26,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:26,528 INFO ]: Computing forward predicates... [2018-06-22 01:34:26,555 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:26,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:26,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 01:34:26,574 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:34:26,574 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:34:26,574 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:34:26,574 INFO ]: Start difference. First operand 26 states and 81 transitions. Second operand 6 states. [2018-06-22 01:34:26,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:26,783 INFO ]: Finished difference Result 39 states and 125 transitions. [2018-06-22 01:34:26,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:34:26,783 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-22 01:34:26,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:26,784 INFO ]: With dead ends: 39 [2018-06-22 01:34:26,784 INFO ]: Without dead ends: 39 [2018-06-22 01:34:26,785 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:26,785 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 01:34:26,788 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 27. [2018-06-22 01:34:26,788 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:34:26,789 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 85 transitions. [2018-06-22 01:34:26,789 INFO ]: Start accepts. Automaton has 27 states and 85 transitions. Word has length 10 [2018-06-22 01:34:26,789 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:26,789 INFO ]: Abstraction has 27 states and 85 transitions. [2018-06-22 01:34:26,789 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:34:26,789 INFO ]: Start isEmpty. Operand 27 states and 85 transitions. [2018-06-22 01:34:26,790 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:26,790 INFO ]: Found error trace [2018-06-22 01:34:26,790 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:26,790 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:26,790 INFO ]: Analyzing trace with hash 1992524750, now seen corresponding path program 2 times [2018-06-22 01:34:26,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:26,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:26,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:26,791 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:26,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:26,799 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:26,848 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:26,848 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:26,849 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:26,854 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:26,894 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:26,894 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:26,896 INFO ]: Computing forward predicates... [2018-06-22 01:34:27,002 INFO ]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:27,021 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:27,021 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-22 01:34:27,021 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:34:27,021 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:34:27,021 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:27,021 INFO ]: Start difference. First operand 27 states and 85 transitions. Second operand 9 states. [2018-06-22 01:34:27,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:27,118 INFO ]: Finished difference Result 49 states and 163 transitions. [2018-06-22 01:34:27,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 01:34:27,120 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-22 01:34:27,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:27,121 INFO ]: With dead ends: 49 [2018-06-22 01:34:27,121 INFO ]: Without dead ends: 49 [2018-06-22 01:34:27,121 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:27,121 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 01:34:27,127 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 27. [2018-06-22 01:34:27,127 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 01:34:27,128 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 83 transitions. [2018-06-22 01:34:27,128 INFO ]: Start accepts. Automaton has 27 states and 83 transitions. Word has length 10 [2018-06-22 01:34:27,128 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:27,128 INFO ]: Abstraction has 27 states and 83 transitions. [2018-06-22 01:34:27,128 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:34:27,128 INFO ]: Start isEmpty. Operand 27 states and 83 transitions. [2018-06-22 01:34:27,128 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-22 01:34:27,128 INFO ]: Found error trace [2018-06-22 01:34:27,129 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:27,129 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:27,129 INFO ]: Analyzing trace with hash 1247572178, now seen corresponding path program 2 times [2018-06-22 01:34:27,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:27,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:27,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:27,129 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:27,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:27,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:27,191 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:27,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:27,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:27,197 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:27,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:27,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:27,210 INFO ]: Computing forward predicates... [2018-06-22 01:34:27,324 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:27,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:27,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-06-22 01:34:27,344 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:34:27,344 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:34:27,344 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:34:27,344 INFO ]: Start difference. First operand 27 states and 83 transitions. Second operand 9 states. [2018-06-22 01:34:27,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:27,507 INFO ]: Finished difference Result 38 states and 121 transitions. [2018-06-22 01:34:27,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:34:27,508 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-22 01:34:27,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:27,509 INFO ]: With dead ends: 38 [2018-06-22 01:34:27,509 INFO ]: Without dead ends: 38 [2018-06-22 01:34:27,510 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:27,510 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:34:27,513 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-06-22 01:34:27,513 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 01:34:27,514 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 83 transitions. [2018-06-22 01:34:27,514 INFO ]: Start accepts. Automaton has 28 states and 83 transitions. Word has length 10 [2018-06-22 01:34:27,514 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:27,514 INFO ]: Abstraction has 28 states and 83 transitions. [2018-06-22 01:34:27,514 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:34:27,514 INFO ]: Start isEmpty. Operand 28 states and 83 transitions. [2018-06-22 01:34:27,514 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:27,514 INFO ]: Found error trace [2018-06-22 01:34:27,514 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:27,514 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:27,515 INFO ]: Analyzing trace with hash 144256354, now seen corresponding path program 3 times [2018-06-22 01:34:27,515 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:27,515 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:27,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:27,515 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:27,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:27,524 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:27,561 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:27,561 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:27,561 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:27,566 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:27,593 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:34:27,593 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:27,594 INFO ]: Computing forward predicates... [2018-06-22 01:34:27,634 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:27,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:27,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-22 01:34:27,654 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:34:27,654 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:34:27,654 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:27,654 INFO ]: Start difference. First operand 28 states and 83 transitions. Second operand 11 states. [2018-06-22 01:34:28,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:28,083 INFO ]: Finished difference Result 122 states and 423 transitions. [2018-06-22 01:34:28,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:34:28,083 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:34:28,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:28,085 INFO ]: With dead ends: 122 [2018-06-22 01:34:28,085 INFO ]: Without dead ends: 122 [2018-06-22 01:34:28,085 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:34:28,085 INFO ]: Start minimizeSevpa. Operand 122 states. [2018-06-22 01:34:28,094 INFO ]: Finished minimizeSevpa. Reduced states from 122 to 43. [2018-06-22 01:34:28,094 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 01:34:28,095 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 145 transitions. [2018-06-22 01:34:28,095 INFO ]: Start accepts. Automaton has 43 states and 145 transitions. Word has length 11 [2018-06-22 01:34:28,095 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:28,095 INFO ]: Abstraction has 43 states and 145 transitions. [2018-06-22 01:34:28,095 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:34:28,095 INFO ]: Start isEmpty. Operand 43 states and 145 transitions. [2018-06-22 01:34:28,096 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:28,096 INFO ]: Found error trace [2018-06-22 01:34:28,096 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:28,096 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:28,096 INFO ]: Analyzing trace with hash 1855806538, now seen corresponding path program 4 times [2018-06-22 01:34:28,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:28,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:28,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:28,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:28,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:28,105 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:28,173 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:28,173 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:28,173 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:34:28,189 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:28,235 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:34:28,235 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:28,237 INFO ]: Computing forward predicates... [2018-06-22 01:34:28,291 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:28,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:28,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 01:34:28,311 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:34:28,311 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:34:28,311 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:34:28,311 INFO ]: Start difference. First operand 43 states and 145 transitions. Second operand 7 states. [2018-06-22 01:34:28,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:28,412 INFO ]: Finished difference Result 60 states and 205 transitions. [2018-06-22 01:34:28,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:34:28,412 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-22 01:34:28,412 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:28,413 INFO ]: With dead ends: 60 [2018-06-22 01:34:28,413 INFO ]: Without dead ends: 60 [2018-06-22 01:34:28,413 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:28,413 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 01:34:28,416 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-06-22 01:34:28,416 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 01:34:28,417 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 149 transitions. [2018-06-22 01:34:28,417 INFO ]: Start accepts. Automaton has 44 states and 149 transitions. Word has length 11 [2018-06-22 01:34:28,417 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:28,417 INFO ]: Abstraction has 44 states and 149 transitions. [2018-06-22 01:34:28,417 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:34:28,417 INFO ]: Start isEmpty. Operand 44 states and 149 transitions. [2018-06-22 01:34:28,418 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:28,418 INFO ]: Found error trace [2018-06-22 01:34:28,418 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:28,418 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:28,418 INFO ]: Analyzing trace with hash 1634161498, now seen corresponding path program 5 times [2018-06-22 01:34:28,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:28,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:28,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:28,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:28,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:28,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:28,564 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:28,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:28,565 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:28,571 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:34:28,588 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-22 01:34:28,588 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:28,589 INFO ]: Computing forward predicates... [2018-06-22 01:34:28,695 INFO ]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:28,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:28,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-22 01:34:28,714 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:34:28,714 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:34:28,714 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:28,714 INFO ]: Start difference. First operand 44 states and 149 transitions. Second operand 11 states. [2018-06-22 01:34:29,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:29,630 INFO ]: Finished difference Result 170 states and 601 transitions. [2018-06-22 01:34:29,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 01:34:29,656 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:34:29,657 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:29,658 INFO ]: With dead ends: 170 [2018-06-22 01:34:29,658 INFO ]: Without dead ends: 170 [2018-06-22 01:34:29,659 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=884, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 01:34:29,659 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 01:34:29,667 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 49. [2018-06-22 01:34:29,667 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 01:34:29,668 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 169 transitions. [2018-06-22 01:34:29,668 INFO ]: Start accepts. Automaton has 49 states and 169 transitions. Word has length 11 [2018-06-22 01:34:29,668 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:29,668 INFO ]: Abstraction has 49 states and 169 transitions. [2018-06-22 01:34:29,668 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:34:29,668 INFO ]: Start isEmpty. Operand 49 states and 169 transitions. [2018-06-22 01:34:29,668 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:34:29,668 INFO ]: Found error trace [2018-06-22 01:34:29,668 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:29,669 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:29,669 INFO ]: Analyzing trace with hash -1049500714, now seen corresponding path program 3 times [2018-06-22 01:34:29,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:29,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:29,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:29,669 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:29,669 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:29,681 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:29,846 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:34:29,972 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:29,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:29,972 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:29,979 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:29,994 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 01:34:29,994 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:29,996 INFO ]: Computing forward predicates... [2018-06-22 01:34:30,434 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:30,467 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:30,467 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-22 01:34:30,467 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:34:30,467 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:34:30,467 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:34:30,467 INFO ]: Start difference. First operand 49 states and 169 transitions. Second operand 11 states. [2018-06-22 01:34:31,129 WARN ]: Spent 388.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-06-22 01:34:37,072 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:37,072 INFO ]: Finished difference Result 54 states and 189 transitions. [2018-06-22 01:34:37,072 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:34:37,072 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-22 01:34:37,072 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:37,073 INFO ]: With dead ends: 54 [2018-06-22 01:34:37,073 INFO ]: Without dead ends: 54 [2018-06-22 01:34:37,073 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:34:37,073 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:34:37,077 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-06-22 01:34:37,077 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:34:37,078 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 177 transitions. [2018-06-22 01:34:37,078 INFO ]: Start accepts. Automaton has 51 states and 177 transitions. Word has length 11 [2018-06-22 01:34:37,078 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:37,078 INFO ]: Abstraction has 51 states and 177 transitions. [2018-06-22 01:34:37,078 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:34:37,078 INFO ]: Start isEmpty. Operand 51 states and 177 transitions. [2018-06-22 01:34:37,079 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:37,079 INFO ]: Found error trace [2018-06-22 01:34:37,079 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:37,079 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:37,079 INFO ]: Analyzing trace with hash -56617138, now seen corresponding path program 6 times [2018-06-22 01:34:37,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:37,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:37,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:37,080 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:37,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:37,092 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:37,240 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:37,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:37,240 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:37,245 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 01:34:37,262 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 01:34:37,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:37,263 INFO ]: Computing forward predicates... [2018-06-22 01:34:37,310 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:37,329 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:37,329 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-22 01:34:37,329 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:34:37,329 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:34:37,329 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:37,329 INFO ]: Start difference. First operand 51 states and 177 transitions. Second operand 12 states. [2018-06-22 01:34:37,989 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:37,989 INFO ]: Finished difference Result 152 states and 545 transitions. [2018-06-22 01:34:37,989 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:34:37,989 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-22 01:34:37,990 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:37,991 INFO ]: With dead ends: 152 [2018-06-22 01:34:37,991 INFO ]: Without dead ends: 152 [2018-06-22 01:34:37,992 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:34:37,992 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 01:34:37,999 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 60. [2018-06-22 01:34:37,999 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 01:34:38,002 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 215 transitions. [2018-06-22 01:34:38,002 INFO ]: Start accepts. Automaton has 60 states and 215 transitions. Word has length 12 [2018-06-22 01:34:38,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:38,002 INFO ]: Abstraction has 60 states and 215 transitions. [2018-06-22 01:34:38,002 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:34:38,002 INFO ]: Start isEmpty. Operand 60 states and 215 transitions. [2018-06-22 01:34:38,003 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:38,003 INFO ]: Found error trace [2018-06-22 01:34:38,003 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:38,003 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:38,003 INFO ]: Analyzing trace with hash 1683476054, now seen corresponding path program 7 times [2018-06-22 01:34:38,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:38,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:38,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:38,004 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:38,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:38,023 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:38,610 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:38,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:38,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:38,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:38,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:38,634 INFO ]: Computing forward predicates... [2018-06-22 01:34:38,701 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:38,723 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:38,723 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:38,724 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:38,724 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:38,724 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:38,724 INFO ]: Start difference. First operand 60 states and 215 transitions. Second operand 8 states. [2018-06-22 01:34:38,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:38,842 INFO ]: Finished difference Result 98 states and 357 transitions. [2018-06-22 01:34:38,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:34:38,842 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:34:38,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:38,843 INFO ]: With dead ends: 98 [2018-06-22 01:34:38,843 INFO ]: Without dead ends: 98 [2018-06-22 01:34:38,843 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:34:38,843 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 01:34:38,847 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 59. [2018-06-22 01:34:38,847 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 01:34:38,848 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 211 transitions. [2018-06-22 01:34:38,848 INFO ]: Start accepts. Automaton has 59 states and 211 transitions. Word has length 12 [2018-06-22 01:34:38,848 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:38,848 INFO ]: Abstraction has 59 states and 211 transitions. [2018-06-22 01:34:38,848 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:38,848 INFO ]: Start isEmpty. Operand 59 states and 211 transitions. [2018-06-22 01:34:38,849 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:38,849 INFO ]: Found error trace [2018-06-22 01:34:38,849 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:38,849 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:38,850 INFO ]: Analyzing trace with hash -892552890, now seen corresponding path program 8 times [2018-06-22 01:34:38,850 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:38,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:38,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:38,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:34:38,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:38,865 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:38,929 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:38,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:38,929 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:38,935 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:34:38,964 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:34:38,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:38,966 INFO ]: Computing forward predicates... [2018-06-22 01:34:39,022 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:39,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:39,042 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:39,042 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:39,042 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:39,042 INFO ]: Start difference. First operand 59 states and 211 transitions. Second operand 8 states. [2018-06-22 01:34:39,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:39,273 INFO ]: Finished difference Result 100 states and 361 transitions. [2018-06-22 01:34:39,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:34:39,273 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:34:39,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:39,274 INFO ]: With dead ends: 100 [2018-06-22 01:34:39,274 INFO ]: Without dead ends: 100 [2018-06-22 01:34:39,274 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:34:39,274 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 01:34:39,278 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 62. [2018-06-22 01:34:39,278 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:34:39,279 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 223 transitions. [2018-06-22 01:34:39,279 INFO ]: Start accepts. Automaton has 62 states and 223 transitions. Word has length 12 [2018-06-22 01:34:39,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:39,279 INFO ]: Abstraction has 62 states and 223 transitions. [2018-06-22 01:34:39,279 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:39,279 INFO ]: Start isEmpty. Operand 62 states and 223 transitions. [2018-06-22 01:34:39,280 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:39,280 INFO ]: Found error trace [2018-06-22 01:34:39,280 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:39,280 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:39,280 INFO ]: Analyzing trace with hash -1114197930, now seen corresponding path program 9 times [2018-06-22 01:34:39,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:39,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:39,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,281 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:39,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:39,384 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:39,384 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:39,390 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:39,406 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:34:39,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:39,408 INFO ]: Computing forward predicates... [2018-06-22 01:34:39,453 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:39,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:39,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 01:34:39,472 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:34:39,472 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:34:39,472 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:34:39,472 INFO ]: Start difference. First operand 62 states and 223 transitions. Second operand 8 states. [2018-06-22 01:34:39,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:39,702 INFO ]: Finished difference Result 110 states and 393 transitions. [2018-06-22 01:34:39,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:34:39,703 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-22 01:34:39,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:39,704 INFO ]: With dead ends: 110 [2018-06-22 01:34:39,704 INFO ]: Without dead ends: 110 [2018-06-22 01:34:39,704 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-22 01:34:39,704 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-22 01:34:39,707 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 63. [2018-06-22 01:34:39,707 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 01:34:39,708 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 227 transitions. [2018-06-22 01:34:39,708 INFO ]: Start accepts. Automaton has 63 states and 227 transitions. Word has length 12 [2018-06-22 01:34:39,708 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:39,708 INFO ]: Abstraction has 63 states and 227 transitions. [2018-06-22 01:34:39,708 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:34:39,708 INFO ]: Start isEmpty. Operand 63 states and 227 transitions. [2018-06-22 01:34:39,709 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 01:34:39,709 INFO ]: Found error trace [2018-06-22 01:34:39,709 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:39,709 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:39,709 INFO ]: Analyzing trace with hash -1121586098, now seen corresponding path program 3 times [2018-06-22 01:34:39,709 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:39,709 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:39,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,710 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:39,710 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:39,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,016 INFO ]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,017 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:40,017 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:40,027 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 01:34:40,043 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 01:34:40,043 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,046 INFO ]: Computing forward predicates... [2018-06-22 01:34:40,187 INFO ]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:40,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 01:34:40,212 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:34:40,212 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:34:40,212 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:34:40,212 INFO ]: Start difference. First operand 63 states and 227 transitions. Second operand 13 states. [2018-06-22 01:34:40,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:40,393 INFO ]: Finished difference Result 164 states and 599 transitions. [2018-06-22 01:34:40,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:34:40,394 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-22 01:34:40,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:40,395 INFO ]: With dead ends: 164 [2018-06-22 01:34:40,395 INFO ]: Without dead ends: 164 [2018-06-22 01:34:40,396 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-06-22 01:34:40,396 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 01:34:40,402 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 64. [2018-06-22 01:34:40,402 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 01:34:40,403 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 229 transitions. [2018-06-22 01:34:40,403 INFO ]: Start accepts. Automaton has 64 states and 229 transitions. Word has length 12 [2018-06-22 01:34:40,403 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:40,403 INFO ]: Abstraction has 64 states and 229 transitions. [2018-06-22 01:34:40,403 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:34:40,403 INFO ]: Start isEmpty. Operand 64 states and 229 transitions. [2018-06-22 01:34:40,409 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:40,409 INFO ]: Found error trace [2018-06-22 01:34:40,409 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:40,409 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:40,409 INFO ]: Analyzing trace with hash -1988728094, now seen corresponding path program 10 times [2018-06-22 01:34:40,410 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:40,410 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:40,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:40,410 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:40,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:40,418 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,528 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:40,528 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:40,528 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:40,534 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 01:34:40,551 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 01:34:40,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:40,552 INFO ]: Computing forward predicates... [2018-06-22 01:34:41,335 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:41,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:41,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:34:41,363 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:34:41,363 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:34:41,363 INFO ]: CoverageRelationStatistics Valid=40, Invalid=198, Unknown=2, NotChecked=0, Total=240 [2018-06-22 01:34:41,363 INFO ]: Start difference. First operand 64 states and 229 transitions. Second operand 16 states. [2018-06-22 01:34:41,601 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-06-22 01:34:42,708 WARN ]: Spent 415.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-06-22 01:34:45,169 WARN ]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 35 [2018-06-22 01:34:46,988 WARN ]: Spent 628.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-06-22 01:34:47,626 WARN ]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 01:34:52,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:52,764 INFO ]: Finished difference Result 164 states and 603 transitions. [2018-06-22 01:34:52,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:34:52,766 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:34:52,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:52,767 INFO ]: With dead ends: 164 [2018-06-22 01:34:52,767 INFO ]: Without dead ends: 164 [2018-06-22 01:34:52,768 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=162, Invalid=538, Unknown=2, NotChecked=0, Total=702 [2018-06-22 01:34:52,768 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 01:34:52,771 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 65. [2018-06-22 01:34:52,771 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 01:34:52,772 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 233 transitions. [2018-06-22 01:34:52,772 INFO ]: Start accepts. Automaton has 65 states and 233 transitions. Word has length 13 [2018-06-22 01:34:52,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:52,773 INFO ]: Abstraction has 65 states and 233 transitions. [2018-06-22 01:34:52,773 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:34:52,773 INFO ]: Start isEmpty. Operand 65 states and 233 transitions. [2018-06-22 01:34:52,778 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:52,778 INFO ]: Found error trace [2018-06-22 01:34:52,778 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:52,779 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:52,779 INFO ]: Analyzing trace with hash 636198346, now seen corresponding path program 11 times [2018-06-22 01:34:52,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:52,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:52,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:52,779 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:52,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:52,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:52,909 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:52,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:34:52,909 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:34:52,914 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 01:34:52,932 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 01:34:52,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:34:52,934 INFO ]: Computing forward predicates... [2018-06-22 01:34:53,117 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:34:53,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:34:53,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-22 01:34:53,135 INFO ]: Interpolant automaton has 16 states [2018-06-22 01:34:53,135 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 01:34:53,136 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:34:53,136 INFO ]: Start difference. First operand 65 states and 233 transitions. Second operand 16 states. [2018-06-22 01:34:53,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:34:53,490 INFO ]: Finished difference Result 141 states and 519 transitions. [2018-06-22 01:34:53,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:34:53,491 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-22 01:34:53,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:34:53,492 INFO ]: With dead ends: 141 [2018-06-22 01:34:53,492 INFO ]: Without dead ends: 141 [2018-06-22 01:34:53,493 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:34:53,493 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 01:34:53,497 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 66. [2018-06-22 01:34:53,497 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:34:53,498 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 237 transitions. [2018-06-22 01:34:53,498 INFO ]: Start accepts. Automaton has 66 states and 237 transitions. Word has length 13 [2018-06-22 01:34:53,498 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:34:53,498 INFO ]: Abstraction has 66 states and 237 transitions. [2018-06-22 01:34:53,498 INFO ]: Interpolant automaton has 16 states. [2018-06-22 01:34:53,498 INFO ]: Start isEmpty. Operand 66 states and 237 transitions. [2018-06-22 01:34:53,499 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:34:53,499 INFO ]: Found error trace [2018-06-22 01:34:53,499 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:34:53,499 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:34:53,499 INFO ]: Analyzing trace with hash -1911287590, now seen corresponding path program 12 times [2018-06-22 01:34:53,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:34:53,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:34:53,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:53,502 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:34:53,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:34:53,514 INFO ]: Conjunction of SSA is sat [2018-06-22 01:34:53,515 INFO ]: Counterexample might be feasible [2018-06-22 01:34:53,543 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:34:53 BoogieIcfgContainer [2018-06-22 01:34:53,544 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:34:53,544 INFO ]: Toolchain (without parser) took 31983.46 ms. Allocated memory was 303.6 MB in the beginning and 422.6 MB in the end (delta: 119.0 MB). Free memory was 258.0 MB in the beginning and 310.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 66.7 MB. Max. memory is 3.6 GB. [2018-06-22 01:34:53,545 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.6 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:34:53,545 INFO ]: ChcToBoogie took 66.74 ms. Allocated memory is still 303.6 MB. Free memory was 258.0 MB in the beginning and 256.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:34:53,546 INFO ]: Boogie Preprocessor took 44.04 ms. Allocated memory is still 303.6 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:34:53,546 INFO ]: RCFGBuilder took 390.50 ms. Allocated memory is still 303.6 MB. Free memory was 254.0 MB in the beginning and 242.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:34:53,546 INFO ]: TraceAbstraction took 31471.67 ms. Allocated memory was 303.6 MB in the beginning and 422.6 MB in the end (delta: 119.0 MB). Free memory was 242.0 MB in the beginning and 310.3 MB in the end (delta: -68.2 MB). Peak memory consumption was 50.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:34:53,548 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.6 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.74 ms. Allocated memory is still 303.6 MB. Free memory was 258.0 MB in the beginning and 256.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.04 ms. Allocated memory is still 303.6 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 390.50 ms. Allocated memory is still 303.6 MB. Free memory was 254.0 MB in the beginning and 242.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 31471.67 ms. Allocated memory was 303.6 MB in the beginning and 422.6 MB in the end (delta: 119.0 MB). Free memory was 242.0 MB in the beginning and 310.3 MB in the end (delta: -68.2 MB). Peak memory consumption was 50.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] assume (-1 * hbv_False_3_Int == 0 && !(hbv_False_4_Int == hbv_False_5_Int)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_False_1_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_5_Int; [L0] havoc hbv_False_1_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_3_Int, hbv_False_2_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -32 == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -31 == hbv_REC_f_f_3_Int) && hbv_REC_f_f_2_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int; [L0] assume ((((((hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_0_Int <= 0)) && !(hhv_REC_f_f_2_Int <= 0)) && !(hbv_REC_f_f_1_Int + hhv_REC_f_f_0_Int + -15 + -1 >= 0)) && !(hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int + -16 + -1 >= 0)) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_4_Int) && hhv_REC_f_f_2_Int + hhv_REC_f_f_3_Int == hbv_REC_f_f_3_Int) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int, hhv_REC_f_f_4_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_3_Int, hhv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_4_Int; [L0] assume ((hhv_REC_f_f_4_Int == hhv_REC_f_f_3_Int && hhv_REC_f_f_2_Int <= 0) && hhv_REC_f_f_0_Int <= 0) && -1 * hhv_REC_f_f_1_Int == 0; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 31.3s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 188 SDtfs, 54 SDslu, 718 SDs, 0 SdLazy, 1916 SolverSat, 892 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 187 SyntacticMatches, 16 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=25, 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 802 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 440 ConstructedInterpolants, 20 QuantifiedInterpolants, 16161 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2640 ConjunctsInSsa, 473 ConjunctsInUnsatCore, 47 InterpolantComputations, 3 PerfectInterpolantSequences, 39/403 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-34-53-562.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/025c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-34-53-562.csv Received shutdown request...