java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:51:12,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:51:12,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:51:12,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:51:12,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:51:12,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:51:12,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:51:12,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:51:12,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:51:12,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:51:12,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:51:12,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:51:12,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:51:12,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:51:12,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:51:12,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:51:12,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:51:12,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:51:12,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:51:12,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:51:12,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:51:12,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:51:12,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:51:12,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:51:12,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:51:12,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:51:12,192 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:51:12,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:51:12,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:51:12,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:51:12,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:51:12,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:51:12,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:51:12,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:51:12,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:51:12,197 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:51:12,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:51:12,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:51:12,220 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:51:12,220 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:51:12,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:51:12,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:51:12,221 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:51:12,222 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:51:12,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:51:12,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:51:12,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:51:12,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:51:12,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:51:12,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:51:12,223 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:51:12,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:51:12,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:51:12,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:51:12,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:51:12,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:51:12,224 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:51:12,230 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:51:12,230 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:51:12,278 INFO ]: Repository-Root is: /tmp [2018-06-25 08:51:12,291 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:51:12,297 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:51:12,299 INFO ]: Initializing SmtParser... [2018-06-25 08:51:12,299 INFO ]: SmtParser initialized [2018-06-25 08:51:12,300 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-25 08:51:12,301 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 08:51:12,392 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 unknown [2018-06-25 08:51:12,923 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/42.c.smt2 [2018-06-25 08:51:12,928 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:51:12,935 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:51:12,935 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:51:12,935 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:51:12,935 INFO ]: ChcToBoogie initialized [2018-06-25 08:51:12,938 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:51:12" (1/1) ... [2018-06-25 08:51:13,023 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13 Unit [2018-06-25 08:51:13,023 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:51:13,024 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:51:13,024 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:51:13,024 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:51:13,044 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,044 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,057 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,057 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,075 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,077 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,083 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... [2018-06-25 08:51:13,094 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:51:13,094 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:51:13,094 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:51:13,094 INFO ]: RCFGBuilder initialized [2018-06-25 08:51:13,095 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 08:51:13,112 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:51:13,113 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:51:13,113 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:51:13,113 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:51:13,113 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:51:13,113 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:51:14,046 INFO ]: Using library mode [2018-06-25 08:51:14,047 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:51:14 BoogieIcfgContainer [2018-06-25 08:51:14,047 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:51:14,048 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:51:14,048 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:51:14,053 INFO ]: TraceAbstraction initialized [2018-06-25 08:51:14,053 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:51:12" (1/3) ... [2018-06-25 08:51:14,054 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd7d2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:51:14, skipping insertion in model container [2018-06-25 08:51:14,054 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:51:13" (2/3) ... [2018-06-25 08:51:14,054 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd7d2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:51:14, skipping insertion in model container [2018-06-25 08:51:14,054 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:51:14" (3/3) ... [2018-06-25 08:51:14,057 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:51:14,064 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:51:14,070 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:51:14,107 INFO ]: Using default assertion order modulation [2018-06-25 08:51:14,107 INFO ]: Interprodecural is true [2018-06-25 08:51:14,107 INFO ]: Hoare is false [2018-06-25 08:51:14,107 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:51:14,107 INFO ]: Backedges is TWOTRACK [2018-06-25 08:51:14,107 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:51:14,107 INFO ]: Difference is false [2018-06-25 08:51:14,107 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:51:14,107 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:51:14,123 INFO ]: Start isEmpty. Operand 48 states. [2018-06-25 08:51:14,135 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 08:51:14,135 INFO ]: Found error trace [2018-06-25 08:51:14,136 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:14,136 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:14,141 INFO ]: Analyzing trace with hash -609205455, now seen corresponding path program 1 times [2018-06-25 08:51:14,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:14,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:14,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:14,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:14,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:14,259 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:15,012 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:15,014 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:15,014 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-25 08:51:15,016 INFO ]: Interpolant automaton has 14 states [2018-06-25 08:51:15,027 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 08:51:15,028 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:51:15,029 INFO ]: Start difference. First operand 48 states. Second operand 14 states. [2018-06-25 08:51:16,030 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 08:51:16,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:16,082 INFO ]: Finished difference Result 118 states and 143 transitions. [2018-06-25 08:51:16,085 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:51:16,086 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-25 08:51:16,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:16,099 INFO ]: With dead ends: 118 [2018-06-25 08:51:16,099 INFO ]: Without dead ends: 117 [2018-06-25 08:51:16,101 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:51:16,116 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-25 08:51:16,136 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 57. [2018-06-25 08:51:16,138 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 08:51:16,139 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2018-06-25 08:51:16,140 INFO ]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 24 [2018-06-25 08:51:16,140 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:16,140 INFO ]: Abstraction has 57 states and 70 transitions. [2018-06-25 08:51:16,140 INFO ]: Interpolant automaton has 14 states. [2018-06-25 08:51:16,140 INFO ]: Start isEmpty. Operand 57 states and 70 transitions. [2018-06-25 08:51:16,141 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 08:51:16,141 INFO ]: Found error trace [2018-06-25 08:51:16,141 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:16,141 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:16,142 INFO ]: Analyzing trace with hash 499006390, now seen corresponding path program 1 times [2018-06-25 08:51:16,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:16,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:16,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:16,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:16,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:16,187 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:16,435 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:16,435 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:16,462 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-25 08:51:16,463 INFO ]: Interpolant automaton has 14 states [2018-06-25 08:51:16,464 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 08:51:16,464 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:51:16,464 INFO ]: Start difference. First operand 57 states and 70 transitions. Second operand 14 states. [2018-06-25 08:51:16,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:16,864 INFO ]: Finished difference Result 112 states and 136 transitions. [2018-06-25 08:51:16,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:51:16,865 INFO ]: Start accepts. Automaton has 14 states. Word has length 24 [2018-06-25 08:51:16,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:16,866 INFO ]: With dead ends: 112 [2018-06-25 08:51:16,866 INFO ]: Without dead ends: 110 [2018-06-25 08:51:16,867 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:51:16,868 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-25 08:51:16,877 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 56. [2018-06-25 08:51:16,877 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-25 08:51:16,878 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-06-25 08:51:16,878 INFO ]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 24 [2018-06-25 08:51:16,879 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:16,879 INFO ]: Abstraction has 56 states and 68 transitions. [2018-06-25 08:51:16,879 INFO ]: Interpolant automaton has 14 states. [2018-06-25 08:51:16,879 INFO ]: Start isEmpty. Operand 56 states and 68 transitions. [2018-06-25 08:51:16,881 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 08:51:16,881 INFO ]: Found error trace [2018-06-25 08:51:16,881 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:16,881 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:16,882 INFO ]: Analyzing trace with hash -1869810607, now seen corresponding path program 1 times [2018-06-25 08:51:16,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:16,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:16,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:16,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:16,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:16,905 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:17,376 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:17,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:17,376 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:17,377 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:17,377 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:17,377 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:17,377 INFO ]: Start difference. First operand 56 states and 68 transitions. Second operand 15 states. [2018-06-25 08:51:17,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:17,800 INFO ]: Finished difference Result 104 states and 127 transitions. [2018-06-25 08:51:17,801 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 08:51:17,801 INFO ]: Start accepts. Automaton has 15 states. Word has length 24 [2018-06-25 08:51:17,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:17,802 INFO ]: With dead ends: 104 [2018-06-25 08:51:17,802 INFO ]: Without dead ends: 101 [2018-06-25 08:51:17,803 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:51:17,803 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-25 08:51:17,807 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 54. [2018-06-25 08:51:17,808 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 08:51:17,808 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-06-25 08:51:17,809 INFO ]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 24 [2018-06-25 08:51:17,809 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:17,809 INFO ]: Abstraction has 54 states and 65 transitions. [2018-06-25 08:51:17,809 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:17,809 INFO ]: Start isEmpty. Operand 54 states and 65 transitions. [2018-06-25 08:51:17,809 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 08:51:17,809 INFO ]: Found error trace [2018-06-25 08:51:17,809 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:17,810 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:17,810 INFO ]: Analyzing trace with hash 200968176, now seen corresponding path program 1 times [2018-06-25 08:51:17,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:17,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:17,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:17,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:17,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:17,831 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:17,990 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:17,990 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:17,990 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-25 08:51:17,990 INFO ]: Interpolant automaton has 14 states [2018-06-25 08:51:17,990 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 08:51:17,990 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:51:17,991 INFO ]: Start difference. First operand 54 states and 65 transitions. Second operand 14 states. [2018-06-25 08:51:18,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:18,955 INFO ]: Finished difference Result 126 states and 152 transitions. [2018-06-25 08:51:18,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:51:18,955 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-25 08:51:18,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:18,957 INFO ]: With dead ends: 126 [2018-06-25 08:51:18,957 INFO ]: Without dead ends: 125 [2018-06-25 08:51:18,957 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:51:18,958 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-25 08:51:18,964 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 65. [2018-06-25 08:51:18,964 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 08:51:18,965 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2018-06-25 08:51:18,965 INFO ]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 25 [2018-06-25 08:51:18,965 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:18,965 INFO ]: Abstraction has 65 states and 79 transitions. [2018-06-25 08:51:18,965 INFO ]: Interpolant automaton has 14 states. [2018-06-25 08:51:18,965 INFO ]: Start isEmpty. Operand 65 states and 79 transitions. [2018-06-25 08:51:18,966 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 08:51:18,966 INFO ]: Found error trace [2018-06-25 08:51:18,966 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:18,966 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:18,967 INFO ]: Analyzing trace with hash 1309180021, now seen corresponding path program 1 times [2018-06-25 08:51:18,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:18,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:18,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:18,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:18,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:18,994 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:19,220 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:19,220 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:19,220 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-25 08:51:19,220 INFO ]: Interpolant automaton has 16 states [2018-06-25 08:51:19,220 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 08:51:19,221 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:51:19,221 INFO ]: Start difference. First operand 65 states and 79 transitions. Second operand 16 states. [2018-06-25 08:51:20,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:20,041 INFO ]: Finished difference Result 149 states and 182 transitions. [2018-06-25 08:51:20,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 08:51:20,041 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-25 08:51:20,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:20,042 INFO ]: With dead ends: 149 [2018-06-25 08:51:20,042 INFO ]: Without dead ends: 148 [2018-06-25 08:51:20,043 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2018-06-25 08:51:20,043 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-25 08:51:20,049 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 64. [2018-06-25 08:51:20,049 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 08:51:20,050 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-06-25 08:51:20,050 INFO ]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 25 [2018-06-25 08:51:20,050 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:20,050 INFO ]: Abstraction has 64 states and 77 transitions. [2018-06-25 08:51:20,050 INFO ]: Interpolant automaton has 16 states. [2018-06-25 08:51:20,050 INFO ]: Start isEmpty. Operand 64 states and 77 transitions. [2018-06-25 08:51:20,051 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 08:51:20,051 INFO ]: Found error trace [2018-06-25 08:51:20,051 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:20,051 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:20,051 INFO ]: Analyzing trace with hash -1059636976, now seen corresponding path program 1 times [2018-06-25 08:51:20,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:20,052 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:20,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:20,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:20,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:20,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:20,309 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:20,309 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:20,309 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-25 08:51:20,309 INFO ]: Interpolant automaton has 14 states [2018-06-25 08:51:20,309 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 08:51:20,309 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:51:20,310 INFO ]: Start difference. First operand 64 states and 77 transitions. Second operand 14 states. [2018-06-25 08:51:20,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:20,633 INFO ]: Finished difference Result 127 states and 155 transitions. [2018-06-25 08:51:20,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:51:20,635 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-25 08:51:20,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:20,636 INFO ]: With dead ends: 127 [2018-06-25 08:51:20,636 INFO ]: Without dead ends: 123 [2018-06-25 08:51:20,636 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:51:20,636 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-25 08:51:20,643 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 60. [2018-06-25 08:51:20,644 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-25 08:51:20,650 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-06-25 08:51:20,650 INFO ]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 25 [2018-06-25 08:51:20,650 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:20,650 INFO ]: Abstraction has 60 states and 73 transitions. [2018-06-25 08:51:20,650 INFO ]: Interpolant automaton has 14 states. [2018-06-25 08:51:20,650 INFO ]: Start isEmpty. Operand 60 states and 73 transitions. [2018-06-25 08:51:20,651 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 08:51:20,651 INFO ]: Found error trace [2018-06-25 08:51:20,651 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:20,651 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:20,651 INFO ]: Analyzing trace with hash -926073137, now seen corresponding path program 1 times [2018-06-25 08:51:20,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:20,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:20,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:20,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:20,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:20,671 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:20,942 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:20,943 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:20,943 INFO ]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-06-25 08:51:20,943 INFO ]: Interpolant automaton has 16 states [2018-06-25 08:51:20,943 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 08:51:20,943 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:51:20,943 INFO ]: Start difference. First operand 60 states and 73 transitions. Second operand 16 states. [2018-06-25 08:51:21,313 WARN ]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-25 08:51:22,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:22,387 INFO ]: Finished difference Result 146 states and 179 transitions. [2018-06-25 08:51:22,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 08:51:22,389 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-25 08:51:22,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:22,390 INFO ]: With dead ends: 146 [2018-06-25 08:51:22,390 INFO ]: Without dead ends: 143 [2018-06-25 08:51:22,390 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2018-06-25 08:51:22,390 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-25 08:51:22,397 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 50. [2018-06-25 08:51:22,397 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-25 08:51:22,398 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-06-25 08:51:22,398 INFO ]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 25 [2018-06-25 08:51:22,398 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:22,398 INFO ]: Abstraction has 50 states and 61 transitions. [2018-06-25 08:51:22,398 INFO ]: Interpolant automaton has 16 states. [2018-06-25 08:51:22,398 INFO ]: Start isEmpty. Operand 50 states and 61 transitions. [2018-06-25 08:51:22,399 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:22,399 INFO ]: Found error trace [2018-06-25 08:51:22,399 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:22,399 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:22,399 INFO ]: Analyzing trace with hash 921234371, now seen corresponding path program 1 times [2018-06-25 08:51:22,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:22,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:22,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:22,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:22,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:22,419 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:22,568 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:22,568 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:22,568 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:22,568 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:22,568 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:22,569 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:22,569 INFO ]: Start difference. First operand 50 states and 61 transitions. Second operand 15 states. [2018-06-25 08:51:23,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:23,301 INFO ]: Finished difference Result 241 states and 300 transitions. [2018-06-25 08:51:23,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 08:51:23,301 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 08:51:23,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:23,304 INFO ]: With dead ends: 241 [2018-06-25 08:51:23,304 INFO ]: Without dead ends: 240 [2018-06-25 08:51:23,305 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=1544, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 08:51:23,305 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-25 08:51:23,310 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 62. [2018-06-25 08:51:23,310 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-25 08:51:23,311 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-06-25 08:51:23,311 INFO ]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 35 [2018-06-25 08:51:23,311 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:23,311 INFO ]: Abstraction has 62 states and 75 transitions. [2018-06-25 08:51:23,311 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:23,311 INFO ]: Start isEmpty. Operand 62 states and 75 transitions. [2018-06-25 08:51:23,312 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:23,312 INFO ]: Found error trace [2018-06-25 08:51:23,312 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:23,313 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:23,313 INFO ]: Analyzing trace with hash -2013063155, now seen corresponding path program 1 times [2018-06-25 08:51:23,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:23,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:23,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:23,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:23,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:23,329 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:24,056 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:24,056 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:24,056 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:24,056 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:24,057 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:24,057 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:24,057 INFO ]: Start difference. First operand 62 states and 75 transitions. Second operand 15 states. [2018-06-25 08:51:24,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:24,482 INFO ]: Finished difference Result 163 states and 201 transitions. [2018-06-25 08:51:24,482 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 08:51:24,483 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 08:51:24,483 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:24,483 INFO ]: With dead ends: 163 [2018-06-25 08:51:24,483 INFO ]: Without dead ends: 161 [2018-06-25 08:51:24,484 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=414, Invalid=992, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:51:24,484 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-25 08:51:24,489 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 61. [2018-06-25 08:51:24,489 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-25 08:51:24,490 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-06-25 08:51:24,490 INFO ]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 35 [2018-06-25 08:51:24,490 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:24,490 INFO ]: Abstraction has 61 states and 73 transitions. [2018-06-25 08:51:24,490 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:24,490 INFO ]: Start isEmpty. Operand 61 states and 73 transitions. [2018-06-25 08:51:24,491 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:24,491 INFO ]: Found error trace [2018-06-25 08:51:24,491 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:24,491 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:24,491 INFO ]: Analyzing trace with hash -1357023869, now seen corresponding path program 1 times [2018-06-25 08:51:24,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:24,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:24,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:24,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:24,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:24,510 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:24,690 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:24,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:24,691 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:24,691 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:24,691 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:24,691 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:24,691 INFO ]: Start difference. First operand 61 states and 73 transitions. Second operand 13 states. [2018-06-25 08:51:25,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:25,118 INFO ]: Finished difference Result 230 states and 287 transitions. [2018-06-25 08:51:25,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-25 08:51:25,118 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-25 08:51:25,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:25,119 INFO ]: With dead ends: 230 [2018-06-25 08:51:25,119 INFO ]: Without dead ends: 229 [2018-06-25 08:51:25,120 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=495, Invalid=1575, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 08:51:25,120 INFO ]: Start minimizeSevpa. Operand 229 states. [2018-06-25 08:51:25,124 INFO ]: Finished minimizeSevpa. Reduced states from 229 to 67. [2018-06-25 08:51:25,124 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 08:51:25,125 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-06-25 08:51:25,125 INFO ]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 35 [2018-06-25 08:51:25,125 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:25,125 INFO ]: Abstraction has 67 states and 80 transitions. [2018-06-25 08:51:25,125 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:25,125 INFO ]: Start isEmpty. Operand 67 states and 80 transitions. [2018-06-25 08:51:25,126 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:25,126 INFO ]: Found error trace [2018-06-25 08:51:25,126 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:25,126 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:25,127 INFO ]: Analyzing trace with hash 637011395, now seen corresponding path program 1 times [2018-06-25 08:51:25,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:25,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:25,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:25,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:25,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:25,148 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:25,283 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:25,284 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:25,284 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:25,284 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:25,284 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:25,284 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:25,284 INFO ]: Start difference. First operand 67 states and 80 transitions. Second operand 13 states. [2018-06-25 08:51:25,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:25,621 INFO ]: Finished difference Result 139 states and 170 transitions. [2018-06-25 08:51:25,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:51:25,621 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-25 08:51:25,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:25,622 INFO ]: With dead ends: 139 [2018-06-25 08:51:25,622 INFO ]: Without dead ends: 132 [2018-06-25 08:51:25,622 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:51:25,622 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-25 08:51:25,626 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 61. [2018-06-25 08:51:25,626 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-25 08:51:25,627 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-06-25 08:51:25,627 INFO ]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 35 [2018-06-25 08:51:25,627 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:25,627 INFO ]: Abstraction has 61 states and 72 transitions. [2018-06-25 08:51:25,627 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:25,627 INFO ]: Start isEmpty. Operand 61 states and 72 transitions. [2018-06-25 08:51:25,628 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:25,628 INFO ]: Found error trace [2018-06-25 08:51:25,628 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:25,628 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:25,628 INFO ]: Analyzing trace with hash 2022190717, now seen corresponding path program 1 times [2018-06-25 08:51:25,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:25,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:25,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:25,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:25,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:25,644 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:25,783 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:25,783 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:25,783 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:25,783 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:25,783 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:25,784 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:25,784 INFO ]: Start difference. First operand 61 states and 72 transitions. Second operand 15 states. [2018-06-25 08:51:26,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:26,564 INFO ]: Finished difference Result 320 states and 398 transitions. [2018-06-25 08:51:26,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 08:51:26,565 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 08:51:26,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:26,567 INFO ]: With dead ends: 320 [2018-06-25 08:51:26,567 INFO ]: Without dead ends: 319 [2018-06-25 08:51:26,568 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=646, Invalid=1610, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 08:51:26,568 INFO ]: Start minimizeSevpa. Operand 319 states. [2018-06-25 08:51:26,576 INFO ]: Finished minimizeSevpa. Reduced states from 319 to 65. [2018-06-25 08:51:26,576 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 08:51:26,577 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-06-25 08:51:26,577 INFO ]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 35 [2018-06-25 08:51:26,577 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:26,577 INFO ]: Abstraction has 65 states and 78 transitions. [2018-06-25 08:51:26,577 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:26,577 INFO ]: Start isEmpty. Operand 65 states and 78 transitions. [2018-06-25 08:51:26,578 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:26,578 INFO ]: Found error trace [2018-06-25 08:51:26,578 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:26,578 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:26,578 INFO ]: Analyzing trace with hash -912106809, now seen corresponding path program 1 times [2018-06-25 08:51:26,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:26,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:26,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:26,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:26,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:26,605 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:26,772 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:26,772 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:26,772 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:26,772 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:26,772 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:26,772 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:26,772 INFO ]: Start difference. First operand 65 states and 78 transitions. Second operand 15 states. [2018-06-25 08:51:27,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:27,635 INFO ]: Finished difference Result 218 states and 269 transitions. [2018-06-25 08:51:27,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:51:27,635 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 08:51:27,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:27,636 INFO ]: With dead ends: 218 [2018-06-25 08:51:27,636 INFO ]: Without dead ends: 216 [2018-06-25 08:51:27,637 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 08:51:27,637 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-25 08:51:27,640 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 64. [2018-06-25 08:51:27,640 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 08:51:27,640 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-06-25 08:51:27,640 INFO ]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 35 [2018-06-25 08:51:27,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:27,640 INFO ]: Abstraction has 64 states and 76 transitions. [2018-06-25 08:51:27,640 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:27,641 INFO ]: Start isEmpty. Operand 64 states and 76 transitions. [2018-06-25 08:51:27,642 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:27,642 INFO ]: Found error trace [2018-06-25 08:51:27,642 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:27,642 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:27,642 INFO ]: Analyzing trace with hash -256067523, now seen corresponding path program 1 times [2018-06-25 08:51:27,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:27,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:27,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:27,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:27,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:27,655 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:27,955 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:27,955 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:27,955 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:27,956 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:27,956 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:27,956 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:27,956 INFO ]: Start difference. First operand 64 states and 76 transitions. Second operand 13 states. [2018-06-25 08:51:28,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:28,486 INFO ]: Finished difference Result 326 states and 408 transitions. [2018-06-25 08:51:28,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-25 08:51:28,486 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-25 08:51:28,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:28,488 INFO ]: With dead ends: 326 [2018-06-25 08:51:28,488 INFO ]: Without dead ends: 325 [2018-06-25 08:51:28,489 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=2138, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:51:28,489 INFO ]: Start minimizeSevpa. Operand 325 states. [2018-06-25 08:51:28,495 INFO ]: Finished minimizeSevpa. Reduced states from 325 to 70. [2018-06-25 08:51:28,496 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-25 08:51:28,496 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-06-25 08:51:28,496 INFO ]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 35 [2018-06-25 08:51:28,496 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:28,496 INFO ]: Abstraction has 70 states and 84 transitions. [2018-06-25 08:51:28,496 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:28,496 INFO ]: Start isEmpty. Operand 70 states and 84 transitions. [2018-06-25 08:51:28,497 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:28,497 INFO ]: Found error trace [2018-06-25 08:51:28,497 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:28,497 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:28,497 INFO ]: Analyzing trace with hash 1737967741, now seen corresponding path program 1 times [2018-06-25 08:51:28,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:28,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:28,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:28,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:28,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:28,511 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:28,693 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:28,693 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:28,693 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:28,693 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:28,693 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:28,693 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:28,693 INFO ]: Start difference. First operand 70 states and 84 transitions. Second operand 13 states. [2018-06-25 08:51:29,333 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 08:51:29,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:29,434 INFO ]: Finished difference Result 203 states and 250 transitions. [2018-06-25 08:51:29,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 08:51:29,434 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-25 08:51:29,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:29,435 INFO ]: With dead ends: 203 [2018-06-25 08:51:29,435 INFO ]: Without dead ends: 197 [2018-06-25 08:51:29,436 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:51:29,436 INFO ]: Start minimizeSevpa. Operand 197 states. [2018-06-25 08:51:29,439 INFO ]: Finished minimizeSevpa. Reduced states from 197 to 64. [2018-06-25 08:51:29,439 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-25 08:51:29,440 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-06-25 08:51:29,440 INFO ]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 35 [2018-06-25 08:51:29,440 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:29,440 INFO ]: Abstraction has 64 states and 76 transitions. [2018-06-25 08:51:29,440 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:29,440 INFO ]: Start isEmpty. Operand 64 states and 76 transitions. [2018-06-25 08:51:29,440 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:29,440 INFO ]: Found error trace [2018-06-25 08:51:29,440 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:29,440 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:29,440 INFO ]: Analyzing trace with hash 1627244093, now seen corresponding path program 1 times [2018-06-25 08:51:29,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:29,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:29,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:29,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:29,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:29,456 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:29,571 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:29,571 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:29,571 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:29,572 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:29,572 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:29,572 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:29,572 INFO ]: Start difference. First operand 64 states and 76 transitions. Second operand 15 states. [2018-06-25 08:51:30,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:30,300 INFO ]: Finished difference Result 282 states and 350 transitions. [2018-06-25 08:51:30,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 08:51:30,301 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 08:51:30,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:30,302 INFO ]: With dead ends: 282 [2018-06-25 08:51:30,302 INFO ]: Without dead ends: 281 [2018-06-25 08:51:30,302 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=552, Invalid=1340, Unknown=0, NotChecked=0, Total=1892 [2018-06-25 08:51:30,303 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-25 08:51:30,306 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 67. [2018-06-25 08:51:30,306 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 08:51:30,307 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-06-25 08:51:30,307 INFO ]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 35 [2018-06-25 08:51:30,309 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:30,309 INFO ]: Abstraction has 67 states and 80 transitions. [2018-06-25 08:51:30,309 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:30,309 INFO ]: Start isEmpty. Operand 67 states and 80 transitions. [2018-06-25 08:51:30,309 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:30,309 INFO ]: Found error trace [2018-06-25 08:51:30,309 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:30,309 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:30,309 INFO ]: Analyzing trace with hash -1307053433, now seen corresponding path program 1 times [2018-06-25 08:51:30,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:30,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:30,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:30,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:30,310 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:30,322 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:30,463 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:30,463 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:30,463 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:30,463 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:30,464 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:30,464 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:30,464 INFO ]: Start difference. First operand 67 states and 80 transitions. Second operand 15 states. [2018-06-25 08:51:31,031 WARN ]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 08:51:31,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:31,215 INFO ]: Finished difference Result 180 states and 221 transitions. [2018-06-25 08:51:31,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 08:51:31,215 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 08:51:31,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:31,216 INFO ]: With dead ends: 180 [2018-06-25 08:51:31,216 INFO ]: Without dead ends: 178 [2018-06-25 08:51:31,216 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 08:51:31,217 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-25 08:51:31,220 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 66. [2018-06-25 08:51:31,220 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 08:51:31,220 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-06-25 08:51:31,220 INFO ]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 35 [2018-06-25 08:51:31,220 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:31,220 INFO ]: Abstraction has 66 states and 78 transitions. [2018-06-25 08:51:31,220 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:31,220 INFO ]: Start isEmpty. Operand 66 states and 78 transitions. [2018-06-25 08:51:31,222 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:31,222 INFO ]: Found error trace [2018-06-25 08:51:31,222 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:31,222 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:31,222 INFO ]: Analyzing trace with hash -651014147, now seen corresponding path program 1 times [2018-06-25 08:51:31,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:31,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:31,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:31,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:31,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:31,233 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:31,355 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:31,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:31,355 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:31,355 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:31,355 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:31,355 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:31,356 INFO ]: Start difference. First operand 66 states and 78 transitions. Second operand 13 states. [2018-06-25 08:51:32,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:32,862 INFO ]: Finished difference Result 324 states and 404 transitions. [2018-06-25 08:51:32,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-25 08:51:32,862 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-25 08:51:32,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:32,863 INFO ]: With dead ends: 324 [2018-06-25 08:51:32,863 INFO ]: Without dead ends: 323 [2018-06-25 08:51:32,864 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=618, Invalid=2138, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:51:32,864 INFO ]: Start minimizeSevpa. Operand 323 states. [2018-06-25 08:51:32,867 INFO ]: Finished minimizeSevpa. Reduced states from 323 to 71. [2018-06-25 08:51:32,867 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-25 08:51:32,868 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2018-06-25 08:51:32,868 INFO ]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 35 [2018-06-25 08:51:32,868 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:32,868 INFO ]: Abstraction has 71 states and 84 transitions. [2018-06-25 08:51:32,868 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:32,868 INFO ]: Start isEmpty. Operand 71 states and 84 transitions. [2018-06-25 08:51:32,868 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:51:32,868 INFO ]: Found error trace [2018-06-25 08:51:32,868 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:32,869 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:32,871 INFO ]: Analyzing trace with hash 1343021117, now seen corresponding path program 1 times [2018-06-25 08:51:32,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:32,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:32,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:32,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:32,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:32,882 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:33,090 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:33,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:33,090 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:33,090 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:33,090 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:33,090 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:33,090 INFO ]: Start difference. First operand 71 states and 84 transitions. Second operand 13 states. [2018-06-25 08:51:33,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:33,715 INFO ]: Finished difference Result 201 states and 246 transitions. [2018-06-25 08:51:33,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 08:51:33,715 INFO ]: Start accepts. Automaton has 13 states. Word has length 35 [2018-06-25 08:51:33,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:33,716 INFO ]: With dead ends: 201 [2018-06-25 08:51:33,716 INFO ]: Without dead ends: 185 [2018-06-25 08:51:33,716 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:51:33,716 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-25 08:51:33,718 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 55. [2018-06-25 08:51:33,718 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 08:51:33,718 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-06-25 08:51:33,718 INFO ]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 35 [2018-06-25 08:51:33,718 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:33,718 INFO ]: Abstraction has 55 states and 66 transitions. [2018-06-25 08:51:33,718 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:33,718 INFO ]: Start isEmpty. Operand 55 states and 66 transitions. [2018-06-25 08:51:33,718 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:33,718 INFO ]: Found error trace [2018-06-25 08:51:33,719 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:33,719 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:33,719 INFO ]: Analyzing trace with hash -1042904668, now seen corresponding path program 1 times [2018-06-25 08:51:33,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:33,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:33,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:33,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:33,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:33,729 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:34,071 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:34,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:34,071 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:34,071 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:34,072 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:34,072 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:34,072 INFO ]: Start difference. First operand 55 states and 66 transitions. Second operand 15 states. [2018-06-25 08:51:34,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:34,591 INFO ]: Finished difference Result 218 states and 269 transitions. [2018-06-25 08:51:34,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 08:51:34,591 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-25 08:51:34,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:34,592 INFO ]: With dead ends: 218 [2018-06-25 08:51:34,592 INFO ]: Without dead ends: 217 [2018-06-25 08:51:34,592 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=474, Invalid=1166, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 08:51:34,593 INFO ]: Start minimizeSevpa. Operand 217 states. [2018-06-25 08:51:34,595 INFO ]: Finished minimizeSevpa. Reduced states from 217 to 67. [2018-06-25 08:51:34,595 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-25 08:51:34,595 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-06-25 08:51:34,595 INFO ]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 36 [2018-06-25 08:51:34,595 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:34,595 INFO ]: Abstraction has 67 states and 79 transitions. [2018-06-25 08:51:34,595 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:34,595 INFO ]: Start isEmpty. Operand 67 states and 79 transitions. [2018-06-25 08:51:34,596 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:34,596 INFO ]: Found error trace [2018-06-25 08:51:34,596 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:34,596 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:34,596 INFO ]: Analyzing trace with hash 317765102, now seen corresponding path program 1 times [2018-06-25 08:51:34,596 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:34,596 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:34,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:34,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:34,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:34,607 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:34,938 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:34,938 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:34,939 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:34,939 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:34,939 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:34,939 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:34,939 INFO ]: Start difference. First operand 67 states and 79 transitions. Second operand 13 states. [2018-06-25 08:51:35,325 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 08:51:35,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:35,797 INFO ]: Finished difference Result 332 states and 414 transitions. [2018-06-25 08:51:35,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-25 08:51:35,797 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:35,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:35,799 INFO ]: With dead ends: 332 [2018-06-25 08:51:35,799 INFO ]: Without dead ends: 331 [2018-06-25 08:51:35,800 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=573, Invalid=1877, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 08:51:35,800 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-25 08:51:35,804 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 71. [2018-06-25 08:51:35,805 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-25 08:51:35,805 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2018-06-25 08:51:35,805 INFO ]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 36 [2018-06-25 08:51:35,805 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:35,805 INFO ]: Abstraction has 71 states and 84 transitions. [2018-06-25 08:51:35,805 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:35,805 INFO ]: Start isEmpty. Operand 71 states and 84 transitions. [2018-06-25 08:51:35,806 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:35,806 INFO ]: Found error trace [2018-06-25 08:51:35,806 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:35,806 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:35,806 INFO ]: Analyzing trace with hash -1983166930, now seen corresponding path program 1 times [2018-06-25 08:51:35,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:35,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:35,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:35,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:35,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:35,819 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:36,359 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:36,359 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:36,359 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:36,359 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:36,359 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:36,359 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:36,359 INFO ]: Start difference. First operand 71 states and 84 transitions. Second operand 13 states. [2018-06-25 08:51:36,685 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:36,685 INFO ]: Finished difference Result 188 states and 230 transitions. [2018-06-25 08:51:36,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:51:36,686 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:36,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:36,686 INFO ]: With dead ends: 188 [2018-06-25 08:51:36,686 INFO ]: Without dead ends: 181 [2018-06-25 08:51:36,686 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2018-06-25 08:51:36,686 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-25 08:51:36,688 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 65. [2018-06-25 08:51:36,688 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-25 08:51:36,688 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-06-25 08:51:36,688 INFO ]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 36 [2018-06-25 08:51:36,688 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:36,688 INFO ]: Abstraction has 65 states and 76 transitions. [2018-06-25 08:51:36,688 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:36,688 INFO ]: Start isEmpty. Operand 65 states and 76 transitions. [2018-06-25 08:51:36,688 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:36,688 INFO ]: Found error trace [2018-06-25 08:51:36,688 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:36,688 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:36,689 INFO ]: Analyzing trace with hash 58051678, now seen corresponding path program 1 times [2018-06-25 08:51:36,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:36,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:36,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:36,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:36,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:36,703 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:36,848 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:36,849 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:36,862 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:36,862 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:36,862 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:36,863 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:36,863 INFO ]: Start difference. First operand 65 states and 76 transitions. Second operand 15 states. [2018-06-25 08:51:37,240 WARN ]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-25 08:51:37,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:37,914 INFO ]: Finished difference Result 296 states and 366 transitions. [2018-06-25 08:51:37,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:51:37,915 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-25 08:51:37,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:37,916 INFO ]: With dead ends: 296 [2018-06-25 08:51:37,916 INFO ]: Without dead ends: 295 [2018-06-25 08:51:37,917 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=498, Invalid=1224, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:51:37,917 INFO ]: Start minimizeSevpa. Operand 295 states. [2018-06-25 08:51:37,920 INFO ]: Finished minimizeSevpa. Reduced states from 295 to 69. [2018-06-25 08:51:37,920 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 08:51:37,925 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2018-06-25 08:51:37,925 INFO ]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 36 [2018-06-25 08:51:37,925 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:37,925 INFO ]: Abstraction has 69 states and 81 transitions. [2018-06-25 08:51:37,925 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:37,925 INFO ]: Start isEmpty. Operand 69 states and 81 transitions. [2018-06-25 08:51:37,925 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:37,925 INFO ]: Found error trace [2018-06-25 08:51:37,925 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:37,925 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:37,925 INFO ]: Analyzing trace with hash 1418721448, now seen corresponding path program 1 times [2018-06-25 08:51:37,926 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:37,926 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:37,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:37,926 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:37,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:37,941 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:38,177 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:38,177 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:38,177 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:38,178 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:38,178 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:38,178 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:38,178 INFO ]: Start difference. First operand 69 states and 81 transitions. Second operand 13 states. [2018-06-25 08:51:38,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:38,754 INFO ]: Finished difference Result 475 states and 593 transitions. [2018-06-25 08:51:38,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 08:51:38,756 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:38,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:38,758 INFO ]: With dead ends: 475 [2018-06-25 08:51:38,758 INFO ]: Without dead ends: 474 [2018-06-25 08:51:38,759 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=680, Invalid=2400, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:51:38,759 INFO ]: Start minimizeSevpa. Operand 474 states. [2018-06-25 08:51:38,765 INFO ]: Finished minimizeSevpa. Reduced states from 474 to 73. [2018-06-25 08:51:38,765 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-25 08:51:38,765 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-06-25 08:51:38,765 INFO ]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 36 [2018-06-25 08:51:38,766 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:38,766 INFO ]: Abstraction has 73 states and 86 transitions. [2018-06-25 08:51:38,766 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:38,766 INFO ]: Start isEmpty. Operand 73 states and 86 transitions. [2018-06-25 08:51:38,766 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:38,766 INFO ]: Found error trace [2018-06-25 08:51:38,766 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:38,766 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:38,766 INFO ]: Analyzing trace with hash -882210584, now seen corresponding path program 1 times [2018-06-25 08:51:38,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:38,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:38,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:38,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:38,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:38,775 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:39,167 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:39,168 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:39,168 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:39,168 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:39,168 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:39,168 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:39,168 INFO ]: Start difference. First operand 73 states and 86 transitions. Second operand 13 states. [2018-06-25 08:51:39,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:39,470 INFO ]: Finished difference Result 275 states and 338 transitions. [2018-06-25 08:51:39,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 08:51:39,474 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:39,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:39,475 INFO ]: With dead ends: 275 [2018-06-25 08:51:39,475 INFO ]: Without dead ends: 269 [2018-06-25 08:51:39,475 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=982, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 08:51:39,476 INFO ]: Start minimizeSevpa. Operand 269 states. [2018-06-25 08:51:39,480 INFO ]: Finished minimizeSevpa. Reduced states from 269 to 66. [2018-06-25 08:51:39,481 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-25 08:51:39,481 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-06-25 08:51:39,481 INFO ]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 36 [2018-06-25 08:51:39,481 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:39,481 INFO ]: Abstraction has 66 states and 77 transitions. [2018-06-25 08:51:39,481 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:39,481 INFO ]: Start isEmpty. Operand 66 states and 77 transitions. [2018-06-25 08:51:39,481 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:39,481 INFO ]: Found error trace [2018-06-25 08:51:39,482 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:39,482 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:39,482 INFO ]: Analyzing trace with hash -336894946, now seen corresponding path program 1 times [2018-06-25 08:51:39,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:39,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:39,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:39,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:39,482 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:39,493 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:39,996 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:39,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:39,996 INFO ]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-06-25 08:51:39,996 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:51:39,996 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:51:39,996 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:51:39,996 INFO ]: Start difference. First operand 66 states and 77 transitions. Second operand 15 states. [2018-06-25 08:51:40,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:40,421 INFO ]: Finished difference Result 258 states and 318 transitions. [2018-06-25 08:51:40,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 08:51:40,421 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-25 08:51:40,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:40,422 INFO ]: With dead ends: 258 [2018-06-25 08:51:40,422 INFO ]: Without dead ends: 257 [2018-06-25 08:51:40,423 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=992, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:51:40,423 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-25 08:51:40,425 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 69. [2018-06-25 08:51:40,425 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-25 08:51:40,425 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-06-25 08:51:40,425 INFO ]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 36 [2018-06-25 08:51:40,426 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:40,426 INFO ]: Abstraction has 69 states and 80 transitions. [2018-06-25 08:51:40,426 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:51:40,426 INFO ]: Start isEmpty. Operand 69 states and 80 transitions. [2018-06-25 08:51:40,426 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:40,426 INFO ]: Found error trace [2018-06-25 08:51:40,426 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:40,426 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:40,426 INFO ]: Analyzing trace with hash 1023774824, now seen corresponding path program 1 times [2018-06-25 08:51:40,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:40,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:40,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:40,427 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:40,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:40,435 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:40,573 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:40,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:40,573 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:40,574 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:40,574 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:40,574 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:40,574 INFO ]: Start difference. First operand 69 states and 80 transitions. Second operand 13 states. [2018-06-25 08:51:41,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:41,200 INFO ]: Finished difference Result 474 states and 590 transitions. [2018-06-25 08:51:41,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-25 08:51:41,201 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:41,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:41,202 INFO ]: With dead ends: 474 [2018-06-25 08:51:41,202 INFO ]: Without dead ends: 473 [2018-06-25 08:51:41,203 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=680, Invalid=2400, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:51:41,204 INFO ]: Start minimizeSevpa. Operand 473 states. [2018-06-25 08:51:41,207 INFO ]: Finished minimizeSevpa. Reduced states from 473 to 72. [2018-06-25 08:51:41,207 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 08:51:41,208 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-06-25 08:51:41,208 INFO ]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 36 [2018-06-25 08:51:41,208 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:41,208 INFO ]: Abstraction has 72 states and 84 transitions. [2018-06-25 08:51:41,208 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:41,208 INFO ]: Start isEmpty. Operand 72 states and 84 transitions. [2018-06-25 08:51:41,208 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:41,208 INFO ]: Found error trace [2018-06-25 08:51:41,208 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:41,208 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:41,208 INFO ]: Analyzing trace with hash -1277157208, now seen corresponding path program 1 times [2018-06-25 08:51:41,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:41,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:41,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:41,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:41,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:41,216 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:41,723 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:41,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:41,723 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:41,723 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:41,724 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:41,724 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:41,724 INFO ]: Start difference. First operand 72 states and 84 transitions. Second operand 13 states. [2018-06-25 08:51:42,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:42,073 INFO ]: Finished difference Result 274 states and 335 transitions. [2018-06-25 08:51:42,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 08:51:42,073 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:42,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:42,074 INFO ]: With dead ends: 274 [2018-06-25 08:51:42,074 INFO ]: Without dead ends: 258 [2018-06-25 08:51:42,075 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=982, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 08:51:42,075 INFO ]: Start minimizeSevpa. Operand 258 states. [2018-06-25 08:51:42,079 INFO ]: Finished minimizeSevpa. Reduced states from 258 to 55. [2018-06-25 08:51:42,079 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-25 08:51:42,079 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-06-25 08:51:42,079 INFO ]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 36 [2018-06-25 08:51:42,079 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:42,079 INFO ]: Abstraction has 55 states and 65 transitions. [2018-06-25 08:51:42,079 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:42,079 INFO ]: Start isEmpty. Operand 55 states and 65 transitions. [2018-06-25 08:51:42,080 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:42,080 INFO ]: Found error trace [2018-06-25 08:51:42,080 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:42,080 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:42,080 INFO ]: Analyzing trace with hash 756359525, now seen corresponding path program 1 times [2018-06-25 08:51:42,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:42,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:42,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:42,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:42,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:42,088 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:42,179 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:42,179 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:42,179 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:42,179 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:42,179 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:42,179 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:42,179 INFO ]: Start difference. First operand 55 states and 65 transitions. Second operand 13 states. [2018-06-25 08:51:42,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:42,567 INFO ]: Finished difference Result 240 states and 298 transitions. [2018-06-25 08:51:42,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 08:51:42,567 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:42,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:42,568 INFO ]: With dead ends: 240 [2018-06-25 08:51:42,568 INFO ]: Without dead ends: 239 [2018-06-25 08:51:42,568 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=425, Invalid=1297, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:51:42,568 INFO ]: Start minimizeSevpa. Operand 239 states. [2018-06-25 08:51:42,570 INFO ]: Finished minimizeSevpa. Reduced states from 239 to 59. [2018-06-25 08:51:42,570 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-25 08:51:42,571 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-06-25 08:51:42,571 INFO ]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 36 [2018-06-25 08:51:42,571 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:42,571 INFO ]: Abstraction has 59 states and 69 transitions. [2018-06-25 08:51:42,571 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:42,571 INFO ]: Start isEmpty. Operand 59 states and 69 transitions. [2018-06-25 08:51:42,571 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:42,571 INFO ]: Found error trace [2018-06-25 08:51:42,571 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:42,571 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:42,571 INFO ]: Analyzing trace with hash -1544572507, now seen corresponding path program 1 times [2018-06-25 08:51:42,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:42,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:42,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:42,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:42,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:42,578 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:43,747 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:43,747 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:43,747 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:43,747 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:43,748 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:43,748 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:43,748 INFO ]: Start difference. First operand 59 states and 69 transitions. Second operand 13 states. [2018-06-25 08:51:43,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:43,915 INFO ]: Finished difference Result 67 states and 77 transitions. [2018-06-25 08:51:43,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 08:51:43,915 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:43,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:43,916 INFO ]: With dead ends: 67 [2018-06-25 08:51:43,916 INFO ]: Without dead ends: 60 [2018-06-25 08:51:43,916 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:51:43,916 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-25 08:51:43,918 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-06-25 08:51:43,918 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-25 08:51:43,918 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-06-25 08:51:43,918 INFO ]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 36 [2018-06-25 08:51:43,918 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:43,918 INFO ]: Abstraction has 53 states and 62 transitions. [2018-06-25 08:51:43,918 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:43,918 INFO ]: Start isEmpty. Operand 53 states and 62 transitions. [2018-06-25 08:51:43,918 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:43,918 INFO ]: Found error trace [2018-06-25 08:51:43,918 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:43,918 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:43,919 INFO ]: Analyzing trace with hash 1857315871, now seen corresponding path program 1 times [2018-06-25 08:51:43,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:43,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:43,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:43,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:43,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:43,928 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:45,191 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:45,191 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:45,191 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:45,192 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:45,192 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:45,192 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:45,192 INFO ]: Start difference. First operand 53 states and 62 transitions. Second operand 13 states. [2018-06-25 08:51:45,654 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:45,654 INFO ]: Finished difference Result 348 states and 434 transitions. [2018-06-25 08:51:45,654 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-25 08:51:45,654 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:45,654 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:45,655 INFO ]: With dead ends: 348 [2018-06-25 08:51:45,655 INFO ]: Without dead ends: 347 [2018-06-25 08:51:45,655 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=493, Invalid=1577, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 08:51:45,656 INFO ]: Start minimizeSevpa. Operand 347 states. [2018-06-25 08:51:45,659 INFO ]: Finished minimizeSevpa. Reduced states from 347 to 57. [2018-06-25 08:51:45,659 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 08:51:45,659 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-06-25 08:51:45,659 INFO ]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 36 [2018-06-25 08:51:45,659 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:45,659 INFO ]: Abstraction has 57 states and 66 transitions. [2018-06-25 08:51:45,659 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:45,659 INFO ]: Start isEmpty. Operand 57 states and 66 transitions. [2018-06-25 08:51:45,659 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:45,659 INFO ]: Found error trace [2018-06-25 08:51:45,660 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:45,660 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:45,660 INFO ]: Analyzing trace with hash -443616161, now seen corresponding path program 1 times [2018-06-25 08:51:45,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:45,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:45,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:45,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:45,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:45,669 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:45,766 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:45,766 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:45,766 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:45,766 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:45,766 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:45,766 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:45,766 INFO ]: Start difference. First operand 57 states and 66 transitions. Second operand 13 states. [2018-06-25 08:51:45,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:45,942 INFO ]: Finished difference Result 92 states and 108 transitions. [2018-06-25 08:51:45,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:51:45,943 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:45,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:45,943 INFO ]: With dead ends: 92 [2018-06-25 08:51:45,943 INFO ]: Without dead ends: 86 [2018-06-25 08:51:45,943 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-06-25 08:51:45,943 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-25 08:51:45,944 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 52. [2018-06-25 08:51:45,944 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-25 08:51:45,945 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-06-25 08:51:45,945 INFO ]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 36 [2018-06-25 08:51:45,945 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:45,945 INFO ]: Abstraction has 52 states and 60 transitions. [2018-06-25 08:51:45,945 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:45,945 INFO ]: Start isEmpty. Operand 52 states and 60 transitions. [2018-06-25 08:51:45,945 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:45,945 INFO ]: Found error trace [2018-06-25 08:51:45,945 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:45,945 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:45,945 INFO ]: Analyzing trace with hash 1462369247, now seen corresponding path program 1 times [2018-06-25 08:51:45,945 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:45,945 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:45,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:45,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:45,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:45,951 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:46,016 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:46,016 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:46,016 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:46,017 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:46,017 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:46,017 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:46,017 INFO ]: Start difference. First operand 52 states and 60 transitions. Second operand 13 states. [2018-06-25 08:51:46,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:46,411 INFO ]: Finished difference Result 311 states and 388 transitions. [2018-06-25 08:51:46,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 08:51:46,411 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:46,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:46,412 INFO ]: With dead ends: 311 [2018-06-25 08:51:46,412 INFO ]: Without dead ends: 310 [2018-06-25 08:51:46,412 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 08:51:46,413 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-25 08:51:46,415 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 54. [2018-06-25 08:51:46,415 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-25 08:51:46,415 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-06-25 08:51:46,415 INFO ]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 36 [2018-06-25 08:51:46,415 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:46,415 INFO ]: Abstraction has 54 states and 62 transitions. [2018-06-25 08:51:46,415 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:46,415 INFO ]: Start isEmpty. Operand 54 states and 62 transitions. [2018-06-25 08:51:46,416 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:51:46,416 INFO ]: Found error trace [2018-06-25 08:51:46,416 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:51:46,416 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:51:46,416 INFO ]: Analyzing trace with hash -838562785, now seen corresponding path program 1 times [2018-06-25 08:51:46,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:51:46,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:51:46,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:46,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:51:46,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:51:46,423 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:51:46,517 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:51:46,518 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:51:46,518 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-25 08:51:46,518 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:51:46,518 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:51:46,518 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:51:46,518 INFO ]: Start difference. First operand 54 states and 62 transitions. Second operand 13 states. [2018-06-25 08:51:46,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:51:46,648 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-25 08:51:46,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 08:51:46,648 INFO ]: Start accepts. Automaton has 13 states. Word has length 36 [2018-06-25 08:51:46,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:51:46,648 INFO ]: With dead ends: 23 [2018-06-25 08:51:46,648 INFO ]: Without dead ends: 0 [2018-06-25 08:51:46,648 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-25 08:51:46,648 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 08:51:46,649 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 08:51:46,649 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 08:51:46,649 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 08:51:46,649 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-06-25 08:51:46,649 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:51:46,649 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 08:51:46,649 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:51:46,649 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 08:51:46,649 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 08:51:46,654 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:51:46 BoogieIcfgContainer [2018-06-25 08:51:46,654 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:51:46,654 INFO ]: Toolchain (without parser) took 33726.57 ms. Allocated memory was 307.8 MB in the beginning and 605.0 MB in the end (delta: 297.3 MB). Free memory was 239.1 MB in the beginning and 221.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 314.9 MB. Max. memory is 3.6 GB. [2018-06-25 08:51:46,655 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:51:46,655 INFO ]: ChcToBoogie took 88.45 ms. Allocated memory is still 307.8 MB. Free memory was 239.1 MB in the beginning and 236.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:51:46,656 INFO ]: Boogie Preprocessor took 69.88 ms. Allocated memory is still 307.8 MB. Free memory was 236.1 MB in the beginning and 234.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:51:46,656 INFO ]: RCFGBuilder took 952.57 ms. Allocated memory was 307.8 MB in the beginning and 324.0 MB in the end (delta: 16.3 MB). Free memory was 234.1 MB in the beginning and 293.0 MB in the end (delta: -58.9 MB). Peak memory consumption was 53.2 MB. Max. memory is 3.6 GB. [2018-06-25 08:51:46,656 INFO ]: TraceAbstraction took 32605.48 ms. Allocated memory was 324.0 MB in the beginning and 605.0 MB in the end (delta: 281.0 MB). Free memory was 293.0 MB in the beginning and 221.5 MB in the end (delta: 71.5 MB). Peak memory consumption was 352.5 MB. Max. memory is 3.6 GB. [2018-06-25 08:51:46,658 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 88.45 ms. Allocated memory is still 307.8 MB. Free memory was 239.1 MB in the beginning and 236.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 69.88 ms. Allocated memory is still 307.8 MB. Free memory was 236.1 MB in the beginning and 234.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 952.57 ms. Allocated memory was 307.8 MB in the beginning and 324.0 MB in the end (delta: 16.3 MB). Free memory was 234.1 MB in the beginning and 293.0 MB in the end (delta: -58.9 MB). Peak memory consumption was 53.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 32605.48 ms. Allocated memory was 324.0 MB in the beginning and 605.0 MB in the end (delta: 281.0 MB). Free memory was 293.0 MB in the beginning and 221.5 MB in the end (delta: 71.5 MB). Peak memory consumption was 352.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. SAFE Result, 32.5s OverallTime, 34 OverallIterations, 2 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2238 SDtfs, 20783 SDslu, 30769 SDs, 0 SdLazy, 4655 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1306 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 1236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10124 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=24, 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, 34 MinimizatonAttempts, 5389 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1098 ConstructedInterpolants, 0 QuantifiedInterpolants, 69831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 108/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-51-46-667.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/42.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-51-46-667.csv Received shutdown request...