java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:55:27,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:55:27,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:55:27,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:55:27,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:55:27,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:55:27,407 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:55:27,414 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:55:27,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:55:27,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:55:27,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:55:27,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:55:27,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:55:27,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:55:27,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:55:27,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:55:27,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:55:27,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:55:27,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:55:27,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:55:27,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:55:27,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:55:27,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:55:27,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:55:27,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:55:27,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:55:27,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:55:27,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:55:27,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:55:27,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:55:27,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:55:27,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:55:27,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:55:27,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:55:27,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:55:27,455 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:55:27,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:55:27,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:55:27,472 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:55:27,472 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:55:27,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:55:27,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:55:27,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:55:27,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:55:27,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:27,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:55:27,475 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:55:27,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:55:27,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:55:27,475 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:55:27,475 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:55:27,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:55:27,476 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:55:27,477 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:55:27,477 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:55:27,516 INFO ]: Repository-Root is: /tmp [2018-06-22 00:55:27,531 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:55:27,539 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:55:27,540 INFO ]: Initializing SmtParser... [2018-06-22 00:55:27,541 INFO ]: SmtParser initialized [2018-06-22 00:55:27,541 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 [2018-06-22 00:55:27,542 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 00:55:27,631 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 unknown [2018-06-22 00:55:28,164 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/06.c.smt2 [2018-06-22 00:55:28,177 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:55:28,182 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:55:28,183 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:55:28,183 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:55:28,184 INFO ]: ChcToBoogie initialized [2018-06-22 00:55:28,187 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,263 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28 Unit [2018-06-22 00:55:28,263 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:55:28,263 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:55:28,263 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:55:28,263 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:55:28,284 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,284 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,297 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,298 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,316 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,322 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,329 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... [2018-06-22 00:55:28,340 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:55:28,340 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:55:28,340 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:55:28,340 INFO ]: RCFGBuilder initialized [2018-06-22 00:55:28,341 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 00:55:28,359 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:55:28,359 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:55:28,359 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:55:28,359 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:55:28,359 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:55:28,359 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:55:29,452 INFO ]: Using library mode [2018-06-22 00:55:29,453 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:29 BoogieIcfgContainer [2018-06-22 00:55:29,453 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:55:29,454 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:55:29,454 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:55:29,457 INFO ]: TraceAbstraction initialized [2018-06-22 00:55:29,457 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:55:28" (1/3) ... [2018-06-22 00:55:29,458 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523a8d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:55:29, skipping insertion in model container [2018-06-22 00:55:29,458 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:55:28" (2/3) ... [2018-06-22 00:55:29,458 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523a8d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:55:29, skipping insertion in model container [2018-06-22 00:55:29,458 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:55:29" (3/3) ... [2018-06-22 00:55:29,460 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:55:29,471 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:55:29,479 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:55:29,533 INFO ]: Using default assertion order modulation [2018-06-22 00:55:29,533 INFO ]: Interprodecural is true [2018-06-22 00:55:29,533 INFO ]: Hoare is false [2018-06-22 00:55:29,533 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:55:29,533 INFO ]: Backedges is TWOTRACK [2018-06-22 00:55:29,533 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:55:29,533 INFO ]: Difference is false [2018-06-22 00:55:29,533 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:55:29,533 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:55:29,547 INFO ]: Start isEmpty. Operand 47 states. [2018-06-22 00:55:29,557 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 00:55:29,557 INFO ]: Found error trace [2018-06-22 00:55:29,557 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:55:29,557 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:29,561 INFO ]: Analyzing trace with hash -1943477486, now seen corresponding path program 1 times [2018-06-22 00:55:29,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:29,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:29,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:29,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:29,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:29,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:30,340 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:30,342 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:30,342 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:55:30,344 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:55:30,354 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:55:30,354 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:55:30,356 INFO ]: Start difference. First operand 47 states. Second operand 13 states. [2018-06-22 00:55:30,841 WARN ]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 00:55:31,033 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-22 00:55:31,493 WARN ]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-06-22 00:55:31,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:31,743 INFO ]: Finished difference Result 79 states and 94 transitions. [2018-06-22 00:55:31,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 00:55:31,745 INFO ]: Start accepts. Automaton has 13 states. Word has length 19 [2018-06-22 00:55:31,745 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:31,755 INFO ]: With dead ends: 79 [2018-06-22 00:55:31,756 INFO ]: Without dead ends: 76 [2018-06-22 00:55:31,758 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 00:55:31,774 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 00:55:31,794 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 49. [2018-06-22 00:55:31,795 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 00:55:31,797 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-06-22 00:55:31,798 INFO ]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 19 [2018-06-22 00:55:31,798 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:31,798 INFO ]: Abstraction has 49 states and 57 transitions. [2018-06-22 00:55:31,798 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:55:31,798 INFO ]: Start isEmpty. Operand 49 states and 57 transitions. [2018-06-22 00:55:31,799 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 00:55:31,799 INFO ]: Found error trace [2018-06-22 00:55:31,799 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] [2018-06-22 00:55:31,800 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:31,800 INFO ]: Analyzing trace with hash 1206918988, now seen corresponding path program 1 times [2018-06-22 00:55:31,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:31,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:31,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:31,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:31,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:31,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:32,052 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:32,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:32,052 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 00:55:32,054 INFO ]: Interpolant automaton has 17 states [2018-06-22 00:55:32,054 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 00:55:32,054 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:55:32,054 INFO ]: Start difference. First operand 49 states and 57 transitions. Second operand 17 states. [2018-06-22 00:55:33,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:33,195 INFO ]: Finished difference Result 143 states and 172 transitions. [2018-06-22 00:55:33,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 00:55:33,196 INFO ]: Start accepts. Automaton has 17 states. Word has length 34 [2018-06-22 00:55:33,196 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:33,200 INFO ]: With dead ends: 143 [2018-06-22 00:55:33,200 INFO ]: Without dead ends: 142 [2018-06-22 00:55:33,202 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=686, Invalid=1966, Unknown=0, NotChecked=0, Total=2652 [2018-06-22 00:55:33,202 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-22 00:55:33,210 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 59. [2018-06-22 00:55:33,210 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 00:55:33,211 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-06-22 00:55:33,211 INFO ]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 34 [2018-06-22 00:55:33,212 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:33,212 INFO ]: Abstraction has 59 states and 70 transitions. [2018-06-22 00:55:33,212 INFO ]: Interpolant automaton has 17 states. [2018-06-22 00:55:33,212 INFO ]: Start isEmpty. Operand 59 states and 70 transitions. [2018-06-22 00:55:33,213 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 00:55:33,213 INFO ]: Found error trace [2018-06-22 00:55:33,213 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] [2018-06-22 00:55:33,213 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:33,214 INFO ]: Analyzing trace with hash 878278412, now seen corresponding path program 1 times [2018-06-22 00:55:33,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:33,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:33,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:33,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:33,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:33,234 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:33,718 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:33,718 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:33,718 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 00:55:33,719 INFO ]: Interpolant automaton has 17 states [2018-06-22 00:55:33,719 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 00:55:33,719 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:55:33,719 INFO ]: Start difference. First operand 59 states and 70 transitions. Second operand 17 states. [2018-06-22 00:55:34,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:34,594 INFO ]: Finished difference Result 108 states and 129 transitions. [2018-06-22 00:55:34,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 00:55:34,596 INFO ]: Start accepts. Automaton has 17 states. Word has length 34 [2018-06-22 00:55:34,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:34,598 INFO ]: With dead ends: 108 [2018-06-22 00:55:34,598 INFO ]: Without dead ends: 105 [2018-06-22 00:55:34,599 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=461, Invalid=1099, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 00:55:34,599 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 00:55:34,606 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 57. [2018-06-22 00:55:34,606 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 00:55:34,607 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-06-22 00:55:34,607 INFO ]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 34 [2018-06-22 00:55:34,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:34,607 INFO ]: Abstraction has 57 states and 67 transitions. [2018-06-22 00:55:34,608 INFO ]: Interpolant automaton has 17 states. [2018-06-22 00:55:34,608 INFO ]: Start isEmpty. Operand 57 states and 67 transitions. [2018-06-22 00:55:34,609 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:34,609 INFO ]: Found error trace [2018-06-22 00:55:34,609 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:34,609 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:34,609 INFO ]: Analyzing trace with hash 500971164, now seen corresponding path program 1 times [2018-06-22 00:55:34,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:34,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:34,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:34,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:34,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:34,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:34,793 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:34,793 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:34,793 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:34,794 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:34,794 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:34,794 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:34,794 INFO ]: Start difference. First operand 57 states and 67 transitions. Second operand 11 states. [2018-06-22 00:55:35,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:35,965 INFO ]: Finished difference Result 514 states and 624 transitions. [2018-06-22 00:55:35,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 00:55:35,966 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:35,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:35,973 INFO ]: With dead ends: 514 [2018-06-22 00:55:35,973 INFO ]: Without dead ends: 513 [2018-06-22 00:55:35,975 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 00:55:35,976 INFO ]: Start minimizeSevpa. Operand 513 states. [2018-06-22 00:55:35,991 INFO ]: Finished minimizeSevpa. Reduced states from 513 to 65. [2018-06-22 00:55:35,991 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 00:55:35,995 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-06-22 00:55:35,995 INFO ]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 43 [2018-06-22 00:55:35,995 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:35,995 INFO ]: Abstraction has 65 states and 80 transitions. [2018-06-22 00:55:35,995 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:35,995 INFO ]: Start isEmpty. Operand 65 states and 80 transitions. [2018-06-22 00:55:35,996 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:35,996 INFO ]: Found error trace [2018-06-22 00:55:35,996 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:35,996 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:35,996 INFO ]: Analyzing trace with hash -1287403940, now seen corresponding path program 1 times [2018-06-22 00:55:35,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:35,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:35,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:35,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:35,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:36,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:36,156 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:36,156 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:36,181 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:36,182 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:36,182 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:36,182 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:36,182 INFO ]: Start difference. First operand 65 states and 80 transitions. Second operand 11 states. [2018-06-22 00:55:36,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:36,517 INFO ]: Finished difference Result 234 states and 280 transitions. [2018-06-22 00:55:36,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 00:55:36,517 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:36,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:36,518 INFO ]: With dead ends: 234 [2018-06-22 00:55:36,518 INFO ]: Without dead ends: 231 [2018-06-22 00:55:36,519 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 00:55:36,519 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-22 00:55:36,525 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 63. [2018-06-22 00:55:36,525 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 00:55:36,526 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-06-22 00:55:36,526 INFO ]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 43 [2018-06-22 00:55:36,526 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:36,526 INFO ]: Abstraction has 63 states and 77 transitions. [2018-06-22 00:55:36,526 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:36,526 INFO ]: Start isEmpty. Operand 63 states and 77 transitions. [2018-06-22 00:55:36,527 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:36,527 INFO ]: Found error trace [2018-06-22 00:55:36,527 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:36,527 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:36,527 INFO ]: Analyzing trace with hash 1142527708, now seen corresponding path program 1 times [2018-06-22 00:55:36,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:36,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:36,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:36,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:36,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:36,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:36,713 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:36,714 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:36,714 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:36,714 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:36,714 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:36,714 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:36,714 INFO ]: Start difference. First operand 63 states and 77 transitions. Second operand 11 states. [2018-06-22 00:55:37,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:37,617 INFO ]: Finished difference Result 511 states and 618 transitions. [2018-06-22 00:55:37,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 00:55:37,620 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:37,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:37,623 INFO ]: With dead ends: 511 [2018-06-22 00:55:37,623 INFO ]: Without dead ends: 510 [2018-06-22 00:55:37,624 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 00:55:37,624 INFO ]: Start minimizeSevpa. Operand 510 states. [2018-06-22 00:55:37,633 INFO ]: Finished minimizeSevpa. Reduced states from 510 to 65. [2018-06-22 00:55:37,633 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 00:55:37,634 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2018-06-22 00:55:37,634 INFO ]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 43 [2018-06-22 00:55:37,634 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:37,634 INFO ]: Abstraction has 65 states and 79 transitions. [2018-06-22 00:55:37,634 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:37,634 INFO ]: Start isEmpty. Operand 65 states and 79 transitions. [2018-06-22 00:55:37,635 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:37,635 INFO ]: Found error trace [2018-06-22 00:55:37,635 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:37,635 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:37,635 INFO ]: Analyzing trace with hash -645847396, now seen corresponding path program 1 times [2018-06-22 00:55:37,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:37,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:37,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:37,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:37,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:37,659 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:37,766 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:37,766 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:37,766 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:37,767 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:37,767 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:37,767 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:37,767 INFO ]: Start difference. First operand 65 states and 79 transitions. Second operand 11 states. [2018-06-22 00:55:38,168 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:38,168 INFO ]: Finished difference Result 233 states and 278 transitions. [2018-06-22 00:55:38,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 00:55:38,170 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:38,170 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:38,171 INFO ]: With dead ends: 233 [2018-06-22 00:55:38,172 INFO ]: Without dead ends: 230 [2018-06-22 00:55:38,172 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 00:55:38,172 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-22 00:55:38,178 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 63. [2018-06-22 00:55:38,178 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 00:55:38,182 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2018-06-22 00:55:38,182 INFO ]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 43 [2018-06-22 00:55:38,182 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:38,182 INFO ]: Abstraction has 63 states and 76 transitions. [2018-06-22 00:55:38,182 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:38,182 INFO ]: Start isEmpty. Operand 63 states and 76 transitions. [2018-06-22 00:55:38,183 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:38,183 INFO ]: Found error trace [2018-06-22 00:55:38,183 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:38,183 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:38,183 INFO ]: Analyzing trace with hash -1572494182, now seen corresponding path program 1 times [2018-06-22 00:55:38,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:38,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:38,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:38,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:38,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:38,225 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:38,361 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:38,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:38,361 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:38,362 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:38,362 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:38,362 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:38,362 INFO ]: Start difference. First operand 63 states and 76 transitions. Second operand 11 states. [2018-06-22 00:55:39,307 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 00:55:39,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:39,648 INFO ]: Finished difference Result 519 states and 629 transitions. [2018-06-22 00:55:39,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 00:55:39,649 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:39,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:39,652 INFO ]: With dead ends: 519 [2018-06-22 00:55:39,652 INFO ]: Without dead ends: 518 [2018-06-22 00:55:39,655 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 00:55:39,655 INFO ]: Start minimizeSevpa. Operand 518 states. [2018-06-22 00:55:39,664 INFO ]: Finished minimizeSevpa. Reduced states from 518 to 67. [2018-06-22 00:55:39,664 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 00:55:39,665 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-06-22 00:55:39,665 INFO ]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 43 [2018-06-22 00:55:39,665 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:39,665 INFO ]: Abstraction has 67 states and 82 transitions. [2018-06-22 00:55:39,665 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:39,665 INFO ]: Start isEmpty. Operand 67 states and 82 transitions. [2018-06-22 00:55:39,669 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:39,669 INFO ]: Found error trace [2018-06-22 00:55:39,669 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:39,670 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:39,670 INFO ]: Analyzing trace with hash 934098010, now seen corresponding path program 1 times [2018-06-22 00:55:39,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:39,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:39,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:39,670 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:39,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:39,687 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:39,931 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:39,931 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:39,931 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:39,931 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:39,931 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:39,931 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:39,931 INFO ]: Start difference. First operand 67 states and 82 transitions. Second operand 11 states. [2018-06-22 00:55:40,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:40,257 INFO ]: Finished difference Result 236 states and 282 transitions. [2018-06-22 00:55:40,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 00:55:40,257 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:40,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:40,258 INFO ]: With dead ends: 236 [2018-06-22 00:55:40,258 INFO ]: Without dead ends: 233 [2018-06-22 00:55:40,259 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 00:55:40,259 INFO ]: Start minimizeSevpa. Operand 233 states. [2018-06-22 00:55:40,269 INFO ]: Finished minimizeSevpa. Reduced states from 233 to 65. [2018-06-22 00:55:40,269 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 00:55:40,269 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2018-06-22 00:55:40,269 INFO ]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 43 [2018-06-22 00:55:40,270 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:40,270 INFO ]: Abstraction has 65 states and 79 transitions. [2018-06-22 00:55:40,270 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:40,270 INFO ]: Start isEmpty. Operand 65 states and 79 transitions. [2018-06-22 00:55:40,270 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:40,270 INFO ]: Found error trace [2018-06-22 00:55:40,271 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:40,271 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:40,271 INFO ]: Analyzing trace with hash -930937638, now seen corresponding path program 1 times [2018-06-22 00:55:40,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:40,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:40,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:40,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:40,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:40,287 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:41,122 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:41,123 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:41,123 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:41,123 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:41,123 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:41,123 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:41,123 INFO ]: Start difference. First operand 65 states and 79 transitions. Second operand 11 states. [2018-06-22 00:55:42,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:42,041 INFO ]: Finished difference Result 516 states and 623 transitions. [2018-06-22 00:55:42,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 00:55:42,042 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:42,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:42,044 INFO ]: With dead ends: 516 [2018-06-22 00:55:42,044 INFO ]: Without dead ends: 515 [2018-06-22 00:55:42,045 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 00:55:42,045 INFO ]: Start minimizeSevpa. Operand 515 states. [2018-06-22 00:55:42,052 INFO ]: Finished minimizeSevpa. Reduced states from 515 to 67. [2018-06-22 00:55:42,052 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 00:55:42,053 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2018-06-22 00:55:42,053 INFO ]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 43 [2018-06-22 00:55:42,053 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:42,053 INFO ]: Abstraction has 67 states and 81 transitions. [2018-06-22 00:55:42,053 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:42,053 INFO ]: Start isEmpty. Operand 67 states and 81 transitions. [2018-06-22 00:55:42,054 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-22 00:55:42,054 INFO ]: Found error trace [2018-06-22 00:55:42,054 INFO ]: trace histogram [2, 2, 2, 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, 1] [2018-06-22 00:55:42,054 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:42,054 INFO ]: Analyzing trace with hash 1575654554, now seen corresponding path program 1 times [2018-06-22 00:55:42,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:42,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:42,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:42,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:42,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:42,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:42,227 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:42,227 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:42,227 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 00:55:42,227 INFO ]: Interpolant automaton has 11 states [2018-06-22 00:55:42,227 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 00:55:42,227 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 00:55:42,228 INFO ]: Start difference. First operand 67 states and 81 transitions. Second operand 11 states. [2018-06-22 00:55:42,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:42,670 INFO ]: Finished difference Result 235 states and 280 transitions. [2018-06-22 00:55:42,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 00:55:42,670 INFO ]: Start accepts. Automaton has 11 states. Word has length 43 [2018-06-22 00:55:42,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:42,671 INFO ]: With dead ends: 235 [2018-06-22 00:55:42,671 INFO ]: Without dead ends: 232 [2018-06-22 00:55:42,672 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 00:55:42,672 INFO ]: Start minimizeSevpa. Operand 232 states. [2018-06-22 00:55:42,675 INFO ]: Finished minimizeSevpa. Reduced states from 232 to 64. [2018-06-22 00:55:42,675 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 00:55:42,675 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-06-22 00:55:42,675 INFO ]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 43 [2018-06-22 00:55:42,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:42,676 INFO ]: Abstraction has 64 states and 77 transitions. [2018-06-22 00:55:42,676 INFO ]: Interpolant automaton has 11 states. [2018-06-22 00:55:42,676 INFO ]: Start isEmpty. Operand 64 states and 77 transitions. [2018-06-22 00:55:42,676 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:42,676 INFO ]: Found error trace [2018-06-22 00:55:42,676 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:42,676 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:42,677 INFO ]: Analyzing trace with hash -235815742, now seen corresponding path program 1 times [2018-06-22 00:55:42,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:42,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:42,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:42,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:42,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:42,693 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:42,837 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:42,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:42,837 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:42,837 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:42,837 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:42,837 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:42,837 INFO ]: Start difference. First operand 64 states and 77 transitions. Second operand 12 states. [2018-06-22 00:55:43,976 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 00:55:44,299 WARN ]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 00:55:44,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:44,870 INFO ]: Finished difference Result 397 states and 479 transitions. [2018-06-22 00:55:44,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 00:55:44,871 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:44,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:44,872 INFO ]: With dead ends: 397 [2018-06-22 00:55:44,872 INFO ]: Without dead ends: 396 [2018-06-22 00:55:44,873 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=899, Invalid=3133, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 00:55:44,873 INFO ]: Start minimizeSevpa. Operand 396 states. [2018-06-22 00:55:44,877 INFO ]: Finished minimizeSevpa. Reduced states from 396 to 68. [2018-06-22 00:55:44,877 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 00:55:44,878 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-06-22 00:55:44,878 INFO ]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 44 [2018-06-22 00:55:44,878 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:44,878 INFO ]: Abstraction has 68 states and 81 transitions. [2018-06-22 00:55:44,878 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:44,878 INFO ]: Start isEmpty. Operand 68 states and 81 transitions. [2018-06-22 00:55:44,878 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:44,878 INFO ]: Found error trace [2018-06-22 00:55:44,878 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:44,878 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:44,879 INFO ]: Analyzing trace with hash -2024190846, now seen corresponding path program 1 times [2018-06-22 00:55:44,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:44,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:44,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:44,879 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:44,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:44,897 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:45,072 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:45,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:45,072 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:45,072 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:45,072 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:45,072 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:45,073 INFO ]: Start difference. First operand 68 states and 81 transitions. Second operand 12 states. [2018-06-22 00:55:45,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:45,248 INFO ]: Finished difference Result 103 states and 120 transitions. [2018-06-22 00:55:45,248 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:55:45,248 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:45,248 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:45,249 INFO ]: With dead ends: 103 [2018-06-22 00:55:45,249 INFO ]: Without dead ends: 97 [2018-06-22 00:55:45,249 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:55:45,249 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 00:55:45,251 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 63. [2018-06-22 00:55:45,251 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-22 00:55:45,251 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-06-22 00:55:45,251 INFO ]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 44 [2018-06-22 00:55:45,251 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:45,251 INFO ]: Abstraction has 63 states and 74 transitions. [2018-06-22 00:55:45,251 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:45,251 INFO ]: Start isEmpty. Operand 63 states and 74 transitions. [2018-06-22 00:55:45,252 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:45,252 INFO ]: Found error trace [2018-06-22 00:55:45,252 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:45,252 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:45,252 INFO ]: Analyzing trace with hash -88732028, now seen corresponding path program 1 times [2018-06-22 00:55:45,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:45,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:45,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:45,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:45,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:45,267 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:45,510 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:45,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:45,510 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:45,510 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:45,510 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:45,511 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:45,511 INFO ]: Start difference. First operand 63 states and 74 transitions. Second operand 12 states. [2018-06-22 00:55:46,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:46,347 INFO ]: Finished difference Result 387 states and 463 transitions. [2018-06-22 00:55:46,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 00:55:46,377 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:46,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:46,378 INFO ]: With dead ends: 387 [2018-06-22 00:55:46,378 INFO ]: Without dead ends: 386 [2018-06-22 00:55:46,379 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=899, Invalid=3133, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 00:55:46,380 INFO ]: Start minimizeSevpa. Operand 386 states. [2018-06-22 00:55:46,383 INFO ]: Finished minimizeSevpa. Reduced states from 386 to 66. [2018-06-22 00:55:46,383 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 00:55:46,383 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-06-22 00:55:46,384 INFO ]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 44 [2018-06-22 00:55:46,384 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:46,384 INFO ]: Abstraction has 66 states and 77 transitions. [2018-06-22 00:55:46,384 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:46,384 INFO ]: Start isEmpty. Operand 66 states and 77 transitions. [2018-06-22 00:55:46,384 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:46,384 INFO ]: Found error trace [2018-06-22 00:55:46,384 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:46,384 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:46,384 INFO ]: Analyzing trace with hash -1877107132, now seen corresponding path program 1 times [2018-06-22 00:55:46,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:46,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:46,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:46,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:46,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:46,399 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:46,637 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:46,637 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:46,637 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:46,637 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:46,637 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:46,637 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:46,637 INFO ]: Start difference. First operand 66 states and 77 transitions. Second operand 12 states. [2018-06-22 00:55:46,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:46,978 INFO ]: Finished difference Result 101 states and 116 transitions. [2018-06-22 00:55:46,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 00:55:46,979 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:46,979 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:46,979 INFO ]: With dead ends: 101 [2018-06-22 00:55:46,979 INFO ]: Without dead ends: 95 [2018-06-22 00:55:46,980 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:55:46,980 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 00:55:46,981 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 61. [2018-06-22 00:55:46,981 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-22 00:55:46,982 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-06-22 00:55:46,982 INFO ]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 44 [2018-06-22 00:55:46,982 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:46,982 INFO ]: Abstraction has 61 states and 70 transitions. [2018-06-22 00:55:46,982 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:46,982 INFO ]: Start isEmpty. Operand 61 states and 70 transitions. [2018-06-22 00:55:46,982 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:46,982 INFO ]: Found error trace [2018-06-22 00:55:46,982 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:46,982 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:46,982 INFO ]: Analyzing trace with hash -1253253270, now seen corresponding path program 1 times [2018-06-22 00:55:46,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:46,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:46,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:46,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:46,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:47,002 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:47,178 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:47,178 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:47,178 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:47,178 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:47,178 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:47,178 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:47,178 INFO ]: Start difference. First operand 61 states and 70 transitions. Second operand 12 states. [2018-06-22 00:55:48,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:48,296 INFO ]: Finished difference Result 453 states and 533 transitions. [2018-06-22 00:55:48,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 00:55:48,296 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:48,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:48,298 INFO ]: With dead ends: 453 [2018-06-22 00:55:48,298 INFO ]: Without dead ends: 452 [2018-06-22 00:55:48,299 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=928, Invalid=3232, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 00:55:48,300 INFO ]: Start minimizeSevpa. Operand 452 states. [2018-06-22 00:55:48,305 INFO ]: Finished minimizeSevpa. Reduced states from 452 to 66. [2018-06-22 00:55:48,305 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 00:55:48,305 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-06-22 00:55:48,305 INFO ]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 44 [2018-06-22 00:55:48,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:48,305 INFO ]: Abstraction has 66 states and 77 transitions. [2018-06-22 00:55:48,305 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:48,305 INFO ]: Start isEmpty. Operand 66 states and 77 transitions. [2018-06-22 00:55:48,307 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:48,307 INFO ]: Found error trace [2018-06-22 00:55:48,307 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:48,307 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:48,307 INFO ]: Analyzing trace with hash 1253338922, now seen corresponding path program 1 times [2018-06-22 00:55:48,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:48,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:48,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:48,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:48,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:48,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:48,512 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:48,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:48,512 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:48,513 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:48,513 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:48,513 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:48,513 INFO ]: Start difference. First operand 66 states and 77 transitions. Second operand 12 states. [2018-06-22 00:55:48,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:48,779 INFO ]: Finished difference Result 206 states and 238 transitions. [2018-06-22 00:55:48,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 00:55:48,779 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:48,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:48,780 INFO ]: With dead ends: 206 [2018-06-22 00:55:48,780 INFO ]: Without dead ends: 203 [2018-06-22 00:55:48,781 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 00:55:48,781 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-22 00:55:48,783 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 64. [2018-06-22 00:55:48,783 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 00:55:48,783 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-06-22 00:55:48,783 INFO ]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 44 [2018-06-22 00:55:48,783 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:48,783 INFO ]: Abstraction has 64 states and 74 transitions. [2018-06-22 00:55:48,784 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:48,784 INFO ]: Start isEmpty. Operand 64 states and 74 transitions. [2018-06-22 00:55:48,784 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:48,784 INFO ]: Found error trace [2018-06-22 00:55:48,784 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:48,784 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:48,784 INFO ]: Analyzing trace with hash -611696726, now seen corresponding path program 1 times [2018-06-22 00:55:48,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:48,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:48,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:48,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:48,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:48,796 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:49,804 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:49,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:49,804 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:49,804 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:49,805 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:49,805 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:49,805 INFO ]: Start difference. First operand 64 states and 74 transitions. Second operand 12 states. [2018-06-22 00:55:50,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:50,608 INFO ]: Finished difference Result 450 states and 527 transitions. [2018-06-22 00:55:50,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 00:55:50,609 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:50,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:50,610 INFO ]: With dead ends: 450 [2018-06-22 00:55:50,610 INFO ]: Without dead ends: 449 [2018-06-22 00:55:50,611 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=928, Invalid=3232, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 00:55:50,611 INFO ]: Start minimizeSevpa. Operand 449 states. [2018-06-22 00:55:50,615 INFO ]: Finished minimizeSevpa. Reduced states from 449 to 66. [2018-06-22 00:55:50,615 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 00:55:50,615 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-06-22 00:55:50,615 INFO ]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 44 [2018-06-22 00:55:50,616 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:50,616 INFO ]: Abstraction has 66 states and 76 transitions. [2018-06-22 00:55:50,616 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:50,616 INFO ]: Start isEmpty. Operand 66 states and 76 transitions. [2018-06-22 00:55:50,616 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 00:55:50,616 INFO ]: Found error trace [2018-06-22 00:55:50,616 INFO ]: trace histogram [2, 2, 2, 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, 1, 1] [2018-06-22 00:55:50,616 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:50,616 INFO ]: Analyzing trace with hash 1894895466, now seen corresponding path program 1 times [2018-06-22 00:55:50,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:50,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:50,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:50,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:50,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:50,628 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:51,295 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:51,295 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:51,295 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 00:55:51,295 INFO ]: Interpolant automaton has 12 states [2018-06-22 00:55:51,295 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 00:55:51,295 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 00:55:51,295 INFO ]: Start difference. First operand 66 states and 76 transitions. Second operand 12 states. [2018-06-22 00:55:51,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:51,567 INFO ]: Finished difference Result 205 states and 236 transitions. [2018-06-22 00:55:51,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 00:55:51,567 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 00:55:51,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:51,568 INFO ]: With dead ends: 205 [2018-06-22 00:55:51,568 INFO ]: Without dead ends: 202 [2018-06-22 00:55:51,568 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 00:55:51,568 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-22 00:55:51,571 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 64. [2018-06-22 00:55:51,571 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 00:55:51,571 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-06-22 00:55:51,571 INFO ]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 44 [2018-06-22 00:55:51,571 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:51,571 INFO ]: Abstraction has 64 states and 73 transitions. [2018-06-22 00:55:51,571 INFO ]: Interpolant automaton has 12 states. [2018-06-22 00:55:51,571 INFO ]: Start isEmpty. Operand 64 states and 73 transitions. [2018-06-22 00:55:51,571 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 00:55:51,571 INFO ]: Found error trace [2018-06-22 00:55:51,572 INFO ]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2018-06-22 00:55:51,572 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:51,575 INFO ]: Analyzing trace with hash 1217801652, now seen corresponding path program 1 times [2018-06-22 00:55:51,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:51,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:51,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:51,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:51,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:51,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:52,214 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:52,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:52,214 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:55:52,215 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:55:52,215 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:55:52,215 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:55:52,215 INFO ]: Start difference. First operand 64 states and 73 transitions. Second operand 13 states. [2018-06-22 00:55:52,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:52,767 INFO ]: Finished difference Result 335 states and 391 transitions. [2018-06-22 00:55:52,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 00:55:52,767 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 00:55:52,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:52,768 INFO ]: With dead ends: 335 [2018-06-22 00:55:52,768 INFO ]: Without dead ends: 334 [2018-06-22 00:55:52,768 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=698, Invalid=2164, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 00:55:52,769 INFO ]: Start minimizeSevpa. Operand 334 states. [2018-06-22 00:55:52,771 INFO ]: Finished minimizeSevpa. Reduced states from 334 to 67. [2018-06-22 00:55:52,771 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 00:55:52,771 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-06-22 00:55:52,771 INFO ]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 45 [2018-06-22 00:55:52,771 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:52,771 INFO ]: Abstraction has 67 states and 76 transitions. [2018-06-22 00:55:52,771 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:55:52,771 INFO ]: Start isEmpty. Operand 67 states and 76 transitions. [2018-06-22 00:55:52,772 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 00:55:52,772 INFO ]: Found error trace [2018-06-22 00:55:52,772 INFO ]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2018-06-22 00:55:52,772 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:55:52,772 INFO ]: Analyzing trace with hash -570573452, now seen corresponding path program 1 times [2018-06-22 00:55:52,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:55:52,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:55:52,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:52,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:55:52,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:55:52,785 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:55:53,169 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:55:53,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:55:53,169 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 00:55:53,169 INFO ]: Interpolant automaton has 13 states [2018-06-22 00:55:53,169 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 00:55:53,169 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 00:55:53,170 INFO ]: Start difference. First operand 67 states and 76 transitions. Second operand 13 states. [2018-06-22 00:55:53,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:55:53,302 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-22 00:55:53,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 00:55:53,302 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 00:55:53,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:55:53,303 INFO ]: With dead ends: 28 [2018-06-22 00:55:53,303 INFO ]: Without dead ends: 0 [2018-06-22 00:55:53,303 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 00:55:53,303 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 00:55:53,303 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 00:55:53,303 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 00:55:53,303 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 00:55:53,303 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-06-22 00:55:53,303 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:55:53,303 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 00:55:53,303 INFO ]: Interpolant automaton has 13 states. [2018-06-22 00:55:53,303 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 00:55:53,303 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 00:55:53,308 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:55:53 BoogieIcfgContainer [2018-06-22 00:55:53,309 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 00:55:53,309 INFO ]: Toolchain (without parser) took 25132.04 ms. Allocated memory was 308.8 MB in the beginning and 595.1 MB in the end (delta: 286.3 MB). Free memory was 240.1 MB in the beginning and 514.7 MB in the end (delta: -274.6 MB). Peak memory consumption was 11.7 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:53,310 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 00:55:53,310 INFO ]: ChcToBoogie took 79.54 ms. Allocated memory is still 308.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-22 00:55:53,311 INFO ]: Boogie Preprocessor took 76.42 ms. Allocated memory is still 308.8 MB. Free memory was 236.1 MB in the beginning and 235.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 00:55:53,311 INFO ]: RCFGBuilder took 1112.62 ms. Allocated memory was 308.8 MB in the beginning and 328.7 MB in the end (delta: 19.9 MB). Free memory was 235.1 MB in the beginning and 291.4 MB in the end (delta: -56.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:53,311 INFO ]: TraceAbstraction took 23854.35 ms. Allocated memory was 328.7 MB in the beginning and 595.1 MB in the end (delta: 266.3 MB). Free memory was 291.4 MB in the beginning and 514.7 MB in the end (delta: -223.3 MB). Peak memory consumption was 43.1 MB. Max. memory is 3.6 GB. [2018-06-22 00:55:53,320 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 79.54 ms. Allocated memory is still 308.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 76.42 ms. Allocated memory is still 308.8 MB. Free memory was 236.1 MB in the beginning and 235.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 1112.62 ms. Allocated memory was 308.8 MB in the beginning and 328.7 MB in the end (delta: 19.9 MB). Free memory was 235.1 MB in the beginning and 291.4 MB in the end (delta: -56.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 23854.35 ms. Allocated memory was 328.7 MB in the beginning and 595.1 MB in the end (delta: 266.3 MB). Free memory was 291.4 MB in the beginning and 514.7 MB in the end (delta: -223.3 MB). Peak memory consumption was 43.1 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, 47 locations, 1 error locations. SAFE Result, 23.7s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1740 SDtfs, 11625 SDslu, 16782 SDs, 0 SdLazy, 3769 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 939 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15391 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=12, 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, 21 MinimizatonAttempts, 4650 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 852 ConstructedInterpolants, 0 QuantifiedInterpolants, 53706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 152/152 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/06.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_00-55-53-329.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/06.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_00-55-53-329.csv Received shutdown request...