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/45.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:07:29,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:07:29,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:07:29,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:07:29,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:07:29,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:07:29,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:07:29,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:07:29,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:07:29,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:07:29,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:07:29,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:07:29,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:07:29,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:07:29,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:07:29,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:07:29,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:07:29,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:07:29,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:07:29,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:07:29,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:07:29,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:07:29,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:07:29,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:07:29,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:07:29,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:07:29,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:07:29,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:07:29,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:07:29,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:07:29,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:07:29,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:07:29,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:07:29,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:07:29,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:07:29,406 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:07:29,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:07:29,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:07:29,420 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:07:29,420 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:07:29,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:07:29,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:07:29,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:07:29,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:07:29,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:07:29,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:07:29,423 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:07:29,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:07:29,423 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:07:29,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:07:29,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:07:29,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:07:29,424 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:07:29,425 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:07:29,425 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:07:29,473 INFO ]: Repository-Root is: /tmp [2018-06-22 01:07:29,490 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:07:29,496 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:07:29,497 INFO ]: Initializing SmtParser... [2018-06-22 01:07:29,497 INFO ]: SmtParser initialized [2018-06-22 01:07:29,498 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/45.c.smt2 [2018-06-22 01:07:29,499 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 01:07:29,594 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/45.c.smt2 unknown [2018-06-22 01:07:30,532 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/45.c.smt2 [2018-06-22 01:07:30,537 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:07:30,543 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:07:30,543 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:07:30,543 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:07:30,543 INFO ]: ChcToBoogie initialized [2018-06-22 01:07:30,546 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,656 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30 Unit [2018-06-22 01:07:30,656 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:07:30,657 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:07:30,657 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:07:30,657 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:07:30,680 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,680 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,712 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,712 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,735 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,743 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,748 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (1/1) ... [2018-06-22 01:07:30,757 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:07:30,758 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:07:30,758 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:07:30,758 INFO ]: RCFGBuilder initialized [2018-06-22 01:07:30,759 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:07:30,806 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:07:30,806 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:07:30,806 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:07:30,806 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:07:30,806 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:07:30,806 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:07:32,427 INFO ]: Using library mode [2018-06-22 01:07:32,428 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:07:32 BoogieIcfgContainer [2018-06-22 01:07:32,428 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:07:32,436 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:07:32,436 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:07:32,439 INFO ]: TraceAbstraction initialized [2018-06-22 01:07:32,440 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:07:30" (1/3) ... [2018-06-22 01:07:32,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb9ac8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:07:32, skipping insertion in model container [2018-06-22 01:07:32,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:07:30" (2/3) ... [2018-06-22 01:07:32,441 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb9ac8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:07:32, skipping insertion in model container [2018-06-22 01:07:32,441 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:07:32" (3/3) ... [2018-06-22 01:07:32,448 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:07:32,458 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:07:32,467 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:07:32,536 INFO ]: Using default assertion order modulation [2018-06-22 01:07:32,537 INFO ]: Interprodecural is true [2018-06-22 01:07:32,537 INFO ]: Hoare is false [2018-06-22 01:07:32,537 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:07:32,537 INFO ]: Backedges is TWOTRACK [2018-06-22 01:07:32,537 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:07:32,537 INFO ]: Difference is false [2018-06-22 01:07:32,537 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:07:32,537 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:07:32,555 INFO ]: Start isEmpty. Operand 70 states. [2018-06-22 01:07:32,568 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:07:32,568 INFO ]: Found error trace [2018-06-22 01:07:32,569 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:32,569 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:32,574 INFO ]: Analyzing trace with hash 1878278694, now seen corresponding path program 1 times [2018-06-22 01:07:32,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:32,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:32,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:32,611 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:32,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:32,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:33,622 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:33,624 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:33,624 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:07:33,626 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:07:33,642 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:07:33,642 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:07:33,645 INFO ]: Start difference. First operand 70 states. Second operand 13 states. [2018-06-22 01:07:33,892 WARN ]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 01:07:34,341 WARN ]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 01:07:35,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:35,237 INFO ]: Finished difference Result 108 states and 128 transitions. [2018-06-22 01:07:35,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 01:07:35,258 INFO ]: Start accepts. Automaton has 13 states. Word has length 32 [2018-06-22 01:07:35,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:35,287 INFO ]: With dead ends: 108 [2018-06-22 01:07:35,287 INFO ]: Without dead ends: 105 [2018-06-22 01:07:35,289 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2018-06-22 01:07:35,315 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-22 01:07:35,355 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-06-22 01:07:35,357 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:07:35,359 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2018-06-22 01:07:35,360 INFO ]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 32 [2018-06-22 01:07:35,360 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:35,360 INFO ]: Abstraction has 76 states and 90 transitions. [2018-06-22 01:07:35,360 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:07:35,360 INFO ]: Start isEmpty. Operand 76 states and 90 transitions. [2018-06-22 01:07:35,362 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 01:07:35,362 INFO ]: Found error trace [2018-06-22 01:07:35,363 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:35,364 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:35,364 INFO ]: Analyzing trace with hash -1931717884, now seen corresponding path program 1 times [2018-06-22 01:07:35,364 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:35,364 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:35,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:35,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:35,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:35,422 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:35,658 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:35,658 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:35,658 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-22 01:07:35,660 INFO ]: Interpolant automaton has 14 states [2018-06-22 01:07:35,660 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 01:07:35,660 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 01:07:35,661 INFO ]: Start difference. First operand 76 states and 90 transitions. Second operand 14 states. [2018-06-22 01:07:36,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:36,150 INFO ]: Finished difference Result 139 states and 166 transitions. [2018-06-22 01:07:36,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 01:07:36,151 INFO ]: Start accepts. Automaton has 14 states. Word has length 32 [2018-06-22 01:07:36,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:36,153 INFO ]: With dead ends: 139 [2018-06-22 01:07:36,153 INFO ]: Without dead ends: 138 [2018-06-22 01:07:36,154 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:07:36,154 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-22 01:07:36,161 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 83. [2018-06-22 01:07:36,161 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-22 01:07:36,163 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2018-06-22 01:07:36,163 INFO ]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 32 [2018-06-22 01:07:36,163 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:36,163 INFO ]: Abstraction has 83 states and 98 transitions. [2018-06-22 01:07:36,163 INFO ]: Interpolant automaton has 14 states. [2018-06-22 01:07:36,163 INFO ]: Start isEmpty. Operand 83 states and 98 transitions. [2018-06-22 01:07:36,164 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:07:36,164 INFO ]: Found error trace [2018-06-22 01:07:36,164 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:36,165 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:36,165 INFO ]: Analyzing trace with hash 1801782874, now seen corresponding path program 1 times [2018-06-22 01:07:36,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:36,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:36,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:36,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:36,165 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:36,196 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:36,346 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:36,346 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:36,346 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:07:36,346 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:07:36,346 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:07:36,347 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:07:36,347 INFO ]: Start difference. First operand 83 states and 98 transitions. Second operand 10 states. [2018-06-22 01:07:36,801 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:36,801 INFO ]: Finished difference Result 141 states and 167 transitions. [2018-06-22 01:07:36,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 01:07:36,804 INFO ]: Start accepts. Automaton has 10 states. Word has length 40 [2018-06-22 01:07:36,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:36,808 INFO ]: With dead ends: 141 [2018-06-22 01:07:36,808 INFO ]: Without dead ends: 140 [2018-06-22 01:07:36,809 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-06-22 01:07:36,809 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-22 01:07:36,821 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 90. [2018-06-22 01:07:36,821 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 01:07:36,822 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-06-22 01:07:36,822 INFO ]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 40 [2018-06-22 01:07:36,822 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:36,822 INFO ]: Abstraction has 90 states and 107 transitions. [2018-06-22 01:07:36,822 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:07:36,822 INFO ]: Start isEmpty. Operand 90 states and 107 transitions. [2018-06-22 01:07:36,824 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:07:36,824 INFO ]: Found error trace [2018-06-22 01:07:36,824 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:36,824 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:36,824 INFO ]: Analyzing trace with hash 1473142298, now seen corresponding path program 1 times [2018-06-22 01:07:36,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:36,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:36,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:36,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:36,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:36,856 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:37,014 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:37,014 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:37,014 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 01:07:37,015 INFO ]: Interpolant automaton has 10 states [2018-06-22 01:07:37,015 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 01:07:37,015 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 01:07:37,015 INFO ]: Start difference. First operand 90 states and 107 transitions. Second operand 10 states. [2018-06-22 01:07:37,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:37,286 INFO ]: Finished difference Result 107 states and 125 transitions. [2018-06-22 01:07:37,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:07:37,287 INFO ]: Start accepts. Automaton has 10 states. Word has length 40 [2018-06-22 01:07:37,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:37,288 INFO ]: With dead ends: 107 [2018-06-22 01:07:37,288 INFO ]: Without dead ends: 103 [2018-06-22 01:07:37,289 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:07:37,289 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-22 01:07:37,300 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-06-22 01:07:37,300 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 01:07:37,305 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2018-06-22 01:07:37,305 INFO ]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 40 [2018-06-22 01:07:37,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:37,305 INFO ]: Abstraction has 87 states and 102 transitions. [2018-06-22 01:07:37,305 INFO ]: Interpolant automaton has 10 states. [2018-06-22 01:07:37,305 INFO ]: Start isEmpty. Operand 87 states and 102 transitions. [2018-06-22 01:07:37,307 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:07:37,307 INFO ]: Found error trace [2018-06-22 01:07:37,307 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:37,307 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:37,307 INFO ]: Analyzing trace with hash 110609818, now seen corresponding path program 1 times [2018-06-22 01:07:37,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:37,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:37,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:37,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:37,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:37,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:38,054 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:38,055 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:38,055 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:38,055 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:38,055 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:38,055 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:38,055 INFO ]: Start difference. First operand 87 states and 102 transitions. Second operand 11 states. [2018-06-22 01:07:38,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:38,462 INFO ]: Finished difference Result 171 states and 201 transitions. [2018-06-22 01:07:38,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:07:38,463 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 01:07:38,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:38,465 INFO ]: With dead ends: 171 [2018-06-22 01:07:38,465 INFO ]: Without dead ends: 170 [2018-06-22 01:07:38,466 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:07:38,466 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 01:07:38,473 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 91. [2018-06-22 01:07:38,473 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 01:07:38,474 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-06-22 01:07:38,474 INFO ]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 41 [2018-06-22 01:07:38,474 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:38,474 INFO ]: Abstraction has 91 states and 107 transitions. [2018-06-22 01:07:38,474 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:38,475 INFO ]: Start isEmpty. Operand 91 states and 107 transitions. [2018-06-22 01:07:38,476 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:07:38,476 INFO ]: Found error trace [2018-06-22 01:07:38,476 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:38,476 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:38,476 INFO ]: Analyzing trace with hash -218030758, now seen corresponding path program 1 times [2018-06-22 01:07:38,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:38,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:38,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:38,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:38,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:38,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:38,634 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:38,634 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:38,634 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:38,634 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:38,634 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:38,634 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:38,635 INFO ]: Start difference. First operand 91 states and 107 transitions. Second operand 11 states. [2018-06-22 01:07:38,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:38,837 INFO ]: Finished difference Result 121 states and 140 transitions. [2018-06-22 01:07:38,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:07:38,837 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 01:07:38,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:38,838 INFO ]: With dead ends: 121 [2018-06-22 01:07:38,838 INFO ]: Without dead ends: 117 [2018-06-22 01:07:38,839 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-06-22 01:07:38,839 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 01:07:38,850 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 88. [2018-06-22 01:07:38,850 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-22 01:07:38,851 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2018-06-22 01:07:38,851 INFO ]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 41 [2018-06-22 01:07:38,852 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:38,852 INFO ]: Abstraction has 88 states and 103 transitions. [2018-06-22 01:07:38,852 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:38,852 INFO ]: Start isEmpty. Operand 88 states and 103 transitions. [2018-06-22 01:07:38,859 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:07:38,859 INFO ]: Found error trace [2018-06-22 01:07:38,859 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:38,859 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:38,859 INFO ]: Analyzing trace with hash 2104645082, now seen corresponding path program 1 times [2018-06-22 01:07:38,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:38,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:38,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:38,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:38,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:38,908 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:39,106 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:39,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:39,106 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:39,106 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:39,106 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:39,106 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:39,107 INFO ]: Start difference. First operand 88 states and 103 transitions. Second operand 11 states. [2018-06-22 01:07:39,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:39,487 INFO ]: Finished difference Result 148 states and 173 transitions. [2018-06-22 01:07:39,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 01:07:39,488 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 01:07:39,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:39,489 INFO ]: With dead ends: 148 [2018-06-22 01:07:39,489 INFO ]: Without dead ends: 147 [2018-06-22 01:07:39,489 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-06-22 01:07:39,489 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-22 01:07:39,494 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 91. [2018-06-22 01:07:39,494 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 01:07:39,495 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2018-06-22 01:07:39,495 INFO ]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 41 [2018-06-22 01:07:39,495 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:39,495 INFO ]: Abstraction has 91 states and 106 transitions. [2018-06-22 01:07:39,495 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:39,495 INFO ]: Start isEmpty. Operand 91 states and 106 transitions. [2018-06-22 01:07:39,496 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 01:07:39,496 INFO ]: Found error trace [2018-06-22 01:07:39,496 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:39,497 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:39,497 INFO ]: Analyzing trace with hash 1776004506, now seen corresponding path program 1 times [2018-06-22 01:07:39,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:39,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:39,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:39,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:39,497 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:39,544 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:40,384 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:40,385 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:40,385 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:40,385 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:40,385 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:40,385 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:40,385 INFO ]: Start difference. First operand 91 states and 106 transitions. Second operand 11 states. [2018-06-22 01:07:40,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:40,486 INFO ]: Finished difference Result 80 states and 90 transitions. [2018-06-22 01:07:40,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:07:40,486 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 01:07:40,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:40,487 INFO ]: With dead ends: 80 [2018-06-22 01:07:40,487 INFO ]: Without dead ends: 62 [2018-06-22 01:07:40,487 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-06-22 01:07:40,487 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 01:07:40,491 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 01:07:40,491 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 01:07:40,491 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-06-22 01:07:40,491 INFO ]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-06-22 01:07:40,492 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:40,492 INFO ]: Abstraction has 62 states and 70 transitions. [2018-06-22 01:07:40,492 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:40,492 INFO ]: Start isEmpty. Operand 62 states and 70 transitions. [2018-06-22 01:07:40,493 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:07:40,493 INFO ]: Found error trace [2018-06-22 01:07:40,493 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:40,493 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:40,493 INFO ]: Analyzing trace with hash 2083242292, now seen corresponding path program 1 times [2018-06-22 01:07:40,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:40,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:40,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:40,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:40,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:40,520 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:40,887 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:40,887 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:40,887 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 01:07:40,887 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:07:40,887 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:07:40,888 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:07:40,888 INFO ]: Start difference. First operand 62 states and 70 transitions. Second operand 17 states. [2018-06-22 01:07:41,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:41,730 INFO ]: Finished difference Result 182 states and 211 transitions. [2018-06-22 01:07:41,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-22 01:07:41,733 INFO ]: Start accepts. Automaton has 17 states. Word has length 47 [2018-06-22 01:07:41,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:41,734 INFO ]: With dead ends: 182 [2018-06-22 01:07:41,734 INFO ]: Without dead ends: 181 [2018-06-22 01:07:41,735 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 01:07:41,735 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-22 01:07:41,739 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 72. [2018-06-22 01:07:41,739 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 01:07:41,740 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-06-22 01:07:41,740 INFO ]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 47 [2018-06-22 01:07:41,741 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:41,741 INFO ]: Abstraction has 72 states and 83 transitions. [2018-06-22 01:07:41,741 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:07:41,741 INFO ]: Start isEmpty. Operand 72 states and 83 transitions. [2018-06-22 01:07:41,743 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-22 01:07:41,743 INFO ]: Found error trace [2018-06-22 01:07:41,743 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:41,743 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:41,744 INFO ]: Analyzing trace with hash 1880654068, now seen corresponding path program 1 times [2018-06-22 01:07:41,744 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:41,744 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:41,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:41,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:41,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:41,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:42,281 INFO ]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:42,281 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:42,281 INFO ]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-06-22 01:07:42,281 INFO ]: Interpolant automaton has 17 states [2018-06-22 01:07:42,282 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 01:07:42,282 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 01:07:42,282 INFO ]: Start difference. First operand 72 states and 83 transitions. Second operand 17 states. [2018-06-22 01:07:42,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:42,840 INFO ]: Finished difference Result 134 states and 155 transitions. [2018-06-22 01:07:42,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 01:07:42,840 INFO ]: Start accepts. Automaton has 17 states. Word has length 47 [2018-06-22 01:07:42,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:42,841 INFO ]: With dead ends: 134 [2018-06-22 01:07:42,841 INFO ]: Without dead ends: 131 [2018-06-22 01:07:42,841 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=461, Invalid=1099, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 01:07:42,842 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-22 01:07:42,844 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 70. [2018-06-22 01:07:42,844 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:07:42,846 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-06-22 01:07:42,846 INFO ]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 47 [2018-06-22 01:07:42,846 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:42,846 INFO ]: Abstraction has 70 states and 80 transitions. [2018-06-22 01:07:42,846 INFO ]: Interpolant automaton has 17 states. [2018-06-22 01:07:42,846 INFO ]: Start isEmpty. Operand 70 states and 80 transitions. [2018-06-22 01:07:42,847 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:42,847 INFO ]: Found error trace [2018-06-22 01:07:42,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:42,848 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:42,848 INFO ]: Analyzing trace with hash -1299940738, now seen corresponding path program 1 times [2018-06-22 01:07:42,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:42,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:42,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:42,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:42,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:42,876 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:43,215 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:43,215 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:43,215 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:43,216 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:43,216 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:43,216 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:43,216 INFO ]: Start difference. First operand 70 states and 80 transitions. Second operand 11 states. [2018-06-22 01:07:44,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:44,164 INFO ]: Finished difference Result 696 states and 806 transitions. [2018-06-22 01:07:44,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 01:07:44,164 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:44,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:44,169 INFO ]: With dead ends: 696 [2018-06-22 01:07:44,169 INFO ]: Without dead ends: 695 [2018-06-22 01:07:44,170 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 01:07:44,171 INFO ]: Start minimizeSevpa. Operand 695 states. [2018-06-22 01:07:44,183 INFO ]: Finished minimizeSevpa. Reduced states from 695 to 78. [2018-06-22 01:07:44,183 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 01:07:44,184 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-06-22 01:07:44,184 INFO ]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 56 [2018-06-22 01:07:44,184 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:44,184 INFO ]: Abstraction has 78 states and 93 transitions. [2018-06-22 01:07:44,184 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:44,184 INFO ]: Start isEmpty. Operand 78 states and 93 transitions. [2018-06-22 01:07:44,184 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:44,184 INFO ]: Found error trace [2018-06-22 01:07:44,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:44,185 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:44,185 INFO ]: Analyzing trace with hash -1097567682, now seen corresponding path program 1 times [2018-06-22 01:07:44,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:44,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:44,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:44,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:44,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:44,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:44,954 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:44,954 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:44,954 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:44,954 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:44,954 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:44,954 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:44,954 INFO ]: Start difference. First operand 78 states and 93 transitions. Second operand 11 states. [2018-06-22 01:07:45,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:45,790 INFO ]: Finished difference Result 312 states and 358 transitions. [2018-06-22 01:07:45,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:07:45,791 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:45,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:45,792 INFO ]: With dead ends: 312 [2018-06-22 01:07:45,792 INFO ]: Without dead ends: 309 [2018-06-22 01:07:45,792 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:45,793 INFO ]: Start minimizeSevpa. Operand 309 states. [2018-06-22 01:07:45,797 INFO ]: Finished minimizeSevpa. Reduced states from 309 to 76. [2018-06-22 01:07:45,797 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:07:45,797 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2018-06-22 01:07:45,798 INFO ]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 56 [2018-06-22 01:07:45,798 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:45,798 INFO ]: Abstraction has 76 states and 90 transitions. [2018-06-22 01:07:45,798 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:45,798 INFO ]: Start isEmpty. Operand 76 states and 90 transitions. [2018-06-22 01:07:45,798 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:45,798 INFO ]: Found error trace [2018-06-22 01:07:45,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:45,798 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:45,799 INFO ]: Analyzing trace with hash 728017654, now seen corresponding path program 1 times [2018-06-22 01:07:45,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:45,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:45,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:45,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:45,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:45,825 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:45,906 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:45,906 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:45,906 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:45,907 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:45,907 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:45,907 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:45,907 INFO ]: Start difference. First operand 76 states and 90 transitions. Second operand 11 states. [2018-06-22 01:07:46,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:46,783 INFO ]: Finished difference Result 693 states and 800 transitions. [2018-06-22 01:07:46,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 01:07:46,783 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:46,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:46,787 INFO ]: With dead ends: 693 [2018-06-22 01:07:46,787 INFO ]: Without dead ends: 692 [2018-06-22 01:07:46,788 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:07:46,789 INFO ]: Start minimizeSevpa. Operand 692 states. [2018-06-22 01:07:46,798 INFO ]: Finished minimizeSevpa. Reduced states from 692 to 78. [2018-06-22 01:07:46,798 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 01:07:46,799 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-06-22 01:07:46,799 INFO ]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 56 [2018-06-22 01:07:46,799 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:46,799 INFO ]: Abstraction has 78 states and 92 transitions. [2018-06-22 01:07:46,799 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:46,799 INFO ]: Start isEmpty. Operand 78 states and 92 transitions. [2018-06-22 01:07:46,799 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:46,799 INFO ]: Found error trace [2018-06-22 01:07:46,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:46,799 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:46,799 INFO ]: Analyzing trace with hash 930390710, now seen corresponding path program 1 times [2018-06-22 01:07:46,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:46,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:46,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:46,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:46,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:46,821 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:46,967 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:46,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:46,968 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:46,968 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:46,968 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:46,968 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:46,968 INFO ]: Start difference. First operand 78 states and 92 transitions. Second operand 11 states. [2018-06-22 01:07:47,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:47,437 INFO ]: Finished difference Result 311 states and 356 transitions. [2018-06-22 01:07:47,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:07:47,437 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:47,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:47,438 INFO ]: With dead ends: 311 [2018-06-22 01:07:47,438 INFO ]: Without dead ends: 308 [2018-06-22 01:07:47,439 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 01:07:47,439 INFO ]: Start minimizeSevpa. Operand 308 states. [2018-06-22 01:07:47,442 INFO ]: Finished minimizeSevpa. Reduced states from 308 to 76. [2018-06-22 01:07:47,442 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:07:47,443 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-06-22 01:07:47,443 INFO ]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 56 [2018-06-22 01:07:47,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:47,443 INFO ]: Abstraction has 76 states and 89 transitions. [2018-06-22 01:07:47,443 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:47,443 INFO ]: Start isEmpty. Operand 76 states and 89 transitions. [2018-06-22 01:07:47,444 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:47,444 INFO ]: Found error trace [2018-06-22 01:07:47,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:47,444 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:47,444 INFO ]: Analyzing trace with hash -1601412188, now seen corresponding path program 1 times [2018-06-22 01:07:47,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:47,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:47,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:47,444 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:47,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:47,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:47,611 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:47,612 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:47,612 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:47,612 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:47,612 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:47,612 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:47,612 INFO ]: Start difference. First operand 76 states and 89 transitions. Second operand 11 states. [2018-06-22 01:07:48,122 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:07:48,660 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 01:07:49,319 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 01:07:49,651 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:07:49,980 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 01:07:50,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:50,446 INFO ]: Finished difference Result 701 states and 811 transitions. [2018-06-22 01:07:50,493 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 01:07:50,493 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:50,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:50,495 INFO ]: With dead ends: 701 [2018-06-22 01:07:50,495 INFO ]: Without dead ends: 700 [2018-06-22 01:07:50,497 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:07:50,497 INFO ]: Start minimizeSevpa. Operand 700 states. [2018-06-22 01:07:50,504 INFO ]: Finished minimizeSevpa. Reduced states from 700 to 80. [2018-06-22 01:07:50,504 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 01:07:50,504 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2018-06-22 01:07:50,504 INFO ]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 56 [2018-06-22 01:07:50,504 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:50,504 INFO ]: Abstraction has 80 states and 95 transitions. [2018-06-22 01:07:50,504 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:50,505 INFO ]: Start isEmpty. Operand 80 states and 95 transitions. [2018-06-22 01:07:50,505 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:50,505 INFO ]: Found error trace [2018-06-22 01:07:50,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:50,505 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:50,505 INFO ]: Analyzing trace with hash -1399039132, now seen corresponding path program 1 times [2018-06-22 01:07:50,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:50,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:50,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:50,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:50,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:50,534 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:50,832 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:50,832 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:50,832 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:50,833 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:50,833 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:50,833 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:50,833 INFO ]: Start difference. First operand 80 states and 95 transitions. Second operand 11 states. [2018-06-22 01:07:51,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:51,447 INFO ]: Finished difference Result 314 states and 360 transitions. [2018-06-22 01:07:51,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:07:51,447 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:51,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:51,448 INFO ]: With dead ends: 314 [2018-06-22 01:07:51,448 INFO ]: Without dead ends: 311 [2018-06-22 01:07:51,448 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:51,449 INFO ]: Start minimizeSevpa. Operand 311 states. [2018-06-22 01:07:51,452 INFO ]: Finished minimizeSevpa. Reduced states from 311 to 78. [2018-06-22 01:07:51,452 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 01:07:51,453 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-06-22 01:07:51,453 INFO ]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 56 [2018-06-22 01:07:51,453 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:51,453 INFO ]: Abstraction has 78 states and 92 transitions. [2018-06-22 01:07:51,453 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:51,453 INFO ]: Start isEmpty. Operand 78 states and 92 transitions. [2018-06-22 01:07:51,454 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:51,454 INFO ]: Found error trace [2018-06-22 01:07:51,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:51,454 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:51,454 INFO ]: Analyzing trace with hash 426546204, now seen corresponding path program 1 times [2018-06-22 01:07:51,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:51,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:51,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:51,455 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:51,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:51,474 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:51,578 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:51,578 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:51,578 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:51,578 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:51,579 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:51,579 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:51,579 INFO ]: Start difference. First operand 78 states and 92 transitions. Second operand 11 states. [2018-06-22 01:07:52,230 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-22 01:07:52,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:52,590 INFO ]: Finished difference Result 698 states and 805 transitions. [2018-06-22 01:07:52,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-22 01:07:52,590 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:52,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:52,593 INFO ]: With dead ends: 698 [2018-06-22 01:07:52,593 INFO ]: Without dead ends: 697 [2018-06-22 01:07:52,595 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=980, Invalid=3850, Unknown=0, NotChecked=0, Total=4830 [2018-06-22 01:07:52,595 INFO ]: Start minimizeSevpa. Operand 697 states. [2018-06-22 01:07:52,601 INFO ]: Finished minimizeSevpa. Reduced states from 697 to 80. [2018-06-22 01:07:52,601 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 01:07:52,601 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2018-06-22 01:07:52,601 INFO ]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 56 [2018-06-22 01:07:52,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:52,601 INFO ]: Abstraction has 80 states and 94 transitions. [2018-06-22 01:07:52,601 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:52,601 INFO ]: Start isEmpty. Operand 80 states and 94 transitions. [2018-06-22 01:07:52,602 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-22 01:07:52,602 INFO ]: Found error trace [2018-06-22 01:07:52,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:52,602 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:52,602 INFO ]: Analyzing trace with hash 628919260, now seen corresponding path program 1 times [2018-06-22 01:07:52,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:52,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:52,603 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:52,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:52,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:52,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:52,743 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:52,743 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:52,743 INFO ]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-06-22 01:07:52,743 INFO ]: Interpolant automaton has 11 states [2018-06-22 01:07:52,743 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 01:07:52,743 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:07:52,743 INFO ]: Start difference. First operand 80 states and 94 transitions. Second operand 11 states. [2018-06-22 01:07:53,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:53,299 INFO ]: Finished difference Result 313 states and 358 transitions. [2018-06-22 01:07:53,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 01:07:53,299 INFO ]: Start accepts. Automaton has 11 states. Word has length 56 [2018-06-22 01:07:53,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:53,300 INFO ]: With dead ends: 313 [2018-06-22 01:07:53,300 INFO ]: Without dead ends: 310 [2018-06-22 01:07:53,301 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 01:07:53,301 INFO ]: Start minimizeSevpa. Operand 310 states. [2018-06-22 01:07:53,305 INFO ]: Finished minimizeSevpa. Reduced states from 310 to 77. [2018-06-22 01:07:53,305 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 01:07:53,306 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-06-22 01:07:53,306 INFO ]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 56 [2018-06-22 01:07:53,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:53,306 INFO ]: Abstraction has 77 states and 90 transitions. [2018-06-22 01:07:53,306 INFO ]: Interpolant automaton has 11 states. [2018-06-22 01:07:53,306 INFO ]: Start isEmpty. Operand 77 states and 90 transitions. [2018-06-22 01:07:53,307 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:53,307 INFO ]: Found error trace [2018-06-22 01:07:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:53,307 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:53,307 INFO ]: Analyzing trace with hash -1582568166, now seen corresponding path program 1 times [2018-06-22 01:07:53,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:53,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:53,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:53,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:53,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:53,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:53,520 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:53,521 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:53,521 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:53,521 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:53,521 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:53,521 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:53,521 INFO ]: Start difference. First operand 77 states and 90 transitions. Second operand 12 states. [2018-06-22 01:07:54,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:54,558 INFO ]: Finished difference Result 527 states and 609 transitions. [2018-06-22 01:07:54,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:07:54,559 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:54,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:54,560 INFO ]: With dead ends: 527 [2018-06-22 01:07:54,561 INFO ]: Without dead ends: 526 [2018-06-22 01:07:54,562 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=899, Invalid=3133, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:07:54,562 INFO ]: Start minimizeSevpa. Operand 526 states. [2018-06-22 01:07:54,568 INFO ]: Finished minimizeSevpa. Reduced states from 526 to 81. [2018-06-22 01:07:54,568 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 01:07:54,569 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-06-22 01:07:54,569 INFO ]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 57 [2018-06-22 01:07:54,569 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:54,569 INFO ]: Abstraction has 81 states and 94 transitions. [2018-06-22 01:07:54,569 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:54,569 INFO ]: Start isEmpty. Operand 81 states and 94 transitions. [2018-06-22 01:07:54,569 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:54,569 INFO ]: Found error trace [2018-06-22 01:07:54,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:54,569 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:54,570 INFO ]: Analyzing trace with hash -1380195110, now seen corresponding path program 1 times [2018-06-22 01:07:54,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:54,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:54,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:54,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:54,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:54,592 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:55,306 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:55,306 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:55,306 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:55,307 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:55,307 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:55,307 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:55,307 INFO ]: Start difference. First operand 81 states and 94 transitions. Second operand 12 states. [2018-06-22 01:07:55,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:55,661 INFO ]: Finished difference Result 129 states and 146 transitions. [2018-06-22 01:07:55,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:07:55,662 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:55,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:55,662 INFO ]: With dead ends: 129 [2018-06-22 01:07:55,662 INFO ]: Without dead ends: 123 [2018-06-22 01:07:55,662 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:07:55,663 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-22 01:07:55,664 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 76. [2018-06-22 01:07:55,664 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 01:07:55,665 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-06-22 01:07:55,665 INFO ]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 57 [2018-06-22 01:07:55,665 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:55,665 INFO ]: Abstraction has 76 states and 87 transitions. [2018-06-22 01:07:55,665 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:55,665 INFO ]: Start isEmpty. Operand 76 states and 87 transitions. [2018-06-22 01:07:55,665 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:55,665 INFO ]: Found error trace [2018-06-22 01:07:55,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:55,665 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:55,665 INFO ]: Analyzing trace with hash 1956718772, now seen corresponding path program 1 times [2018-06-22 01:07:55,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:55,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:55,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:55,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:55,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:55,683 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:55,802 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:55,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:55,803 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:55,803 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:55,803 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:55,803 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:55,803 INFO ]: Start difference. First operand 76 states and 87 transitions. Second operand 12 states. [2018-06-22 01:07:56,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:56,551 INFO ]: Finished difference Result 517 states and 593 transitions. [2018-06-22 01:07:56,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-22 01:07:56,551 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:56,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:56,553 INFO ]: With dead ends: 517 [2018-06-22 01:07:56,553 INFO ]: Without dead ends: 516 [2018-06-22 01:07:56,554 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=899, Invalid=3133, Unknown=0, NotChecked=0, Total=4032 [2018-06-22 01:07:56,554 INFO ]: Start minimizeSevpa. Operand 516 states. [2018-06-22 01:07:56,558 INFO ]: Finished minimizeSevpa. Reduced states from 516 to 79. [2018-06-22 01:07:56,558 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:07:56,558 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-06-22 01:07:56,558 INFO ]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 57 [2018-06-22 01:07:56,558 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:56,558 INFO ]: Abstraction has 79 states and 90 transitions. [2018-06-22 01:07:56,558 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:56,558 INFO ]: Start isEmpty. Operand 79 states and 90 transitions. [2018-06-22 01:07:56,560 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:56,560 INFO ]: Found error trace [2018-06-22 01:07:56,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:56,560 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:56,560 INFO ]: Analyzing trace with hash -2135875468, now seen corresponding path program 1 times [2018-06-22 01:07:56,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:56,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:56,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:56,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:56,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:56,578 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:56,688 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:56,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:56,688 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:56,688 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:56,688 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:56,688 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:56,688 INFO ]: Start difference. First operand 79 states and 90 transitions. Second operand 12 states. [2018-06-22 01:07:56,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:56,881 INFO ]: Finished difference Result 127 states and 142 transitions. [2018-06-22 01:07:56,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 01:07:56,882 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:56,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:56,883 INFO ]: With dead ends: 127 [2018-06-22 01:07:56,883 INFO ]: Without dead ends: 121 [2018-06-22 01:07:56,883 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 01:07:56,883 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 01:07:56,885 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 74. [2018-06-22 01:07:56,885 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 01:07:56,885 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-06-22 01:07:56,885 INFO ]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 57 [2018-06-22 01:07:56,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:56,885 INFO ]: Abstraction has 74 states and 83 transitions. [2018-06-22 01:07:56,885 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:56,885 INFO ]: Start isEmpty. Operand 74 states and 83 transitions. [2018-06-22 01:07:56,885 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:56,885 INFO ]: Found error trace [2018-06-22 01:07:56,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:56,886 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:56,886 INFO ]: Analyzing trace with hash -1679387306, now seen corresponding path program 1 times [2018-06-22 01:07:56,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:56,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:56,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:56,886 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:56,886 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:56,904 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:56,999 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:56,999 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:56,999 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:57,000 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:57,000 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:57,000 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:57,000 INFO ]: Start difference. First operand 74 states and 83 transitions. Second operand 12 states. [2018-06-22 01:07:57,683 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:57,683 INFO ]: Finished difference Result 635 states and 715 transitions. [2018-06-22 01:07:57,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 01:07:57,683 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:57,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:57,684 INFO ]: With dead ends: 635 [2018-06-22 01:07:57,684 INFO ]: Without dead ends: 634 [2018-06-22 01:07:57,685 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=928, Invalid=3232, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:07:57,685 INFO ]: Start minimizeSevpa. Operand 634 states. [2018-06-22 01:07:57,690 INFO ]: Finished minimizeSevpa. Reduced states from 634 to 79. [2018-06-22 01:07:57,690 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:07:57,690 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-06-22 01:07:57,690 INFO ]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 57 [2018-06-22 01:07:57,690 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:57,690 INFO ]: Abstraction has 79 states and 90 transitions. [2018-06-22 01:07:57,690 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:57,690 INFO ]: Start isEmpty. Operand 79 states and 90 transitions. [2018-06-22 01:07:57,691 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:57,691 INFO ]: Found error trace [2018-06-22 01:07:57,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:57,691 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:57,691 INFO ]: Analyzing trace with hash -1477014250, now seen corresponding path program 1 times [2018-06-22 01:07:57,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:57,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:57,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:57,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:57,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:57,708 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:57,836 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:57,836 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:57,836 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:57,836 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:57,836 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:57,836 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:57,836 INFO ]: Start difference. First operand 79 states and 90 transitions. Second operand 12 states. [2018-06-22 01:07:58,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:58,161 INFO ]: Finished difference Result 284 states and 316 transitions. [2018-06-22 01:07:58,161 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:07:58,161 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:58,161 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:58,162 INFO ]: With dead ends: 284 [2018-06-22 01:07:58,162 INFO ]: Without dead ends: 281 [2018-06-22 01:07:58,162 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 01:07:58,162 INFO ]: Start minimizeSevpa. Operand 281 states. [2018-06-22 01:07:58,165 INFO ]: Finished minimizeSevpa. Reduced states from 281 to 77. [2018-06-22 01:07:58,165 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 01:07:58,165 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-06-22 01:07:58,165 INFO ]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 57 [2018-06-22 01:07:58,166 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:58,166 INFO ]: Abstraction has 77 states and 87 transitions. [2018-06-22 01:07:58,166 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:58,166 INFO ]: Start isEmpty. Operand 77 states and 87 transitions. [2018-06-22 01:07:58,166 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:58,166 INFO ]: Found error trace [2018-06-22 01:07:58,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:58,166 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:58,166 INFO ]: Analyzing trace with hash 348571086, now seen corresponding path program 1 times [2018-06-22 01:07:58,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:58,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:58,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:58,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:58,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:58,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:58,319 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:58,319 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:58,319 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:58,320 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:58,320 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:58,320 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:58,320 INFO ]: Start difference. First operand 77 states and 87 transitions. Second operand 12 states. [2018-06-22 01:07:59,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:59,090 INFO ]: Finished difference Result 632 states and 709 transitions. [2018-06-22 01:07:59,090 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-06-22 01:07:59,090 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:59,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:59,091 INFO ]: With dead ends: 632 [2018-06-22 01:07:59,091 INFO ]: Without dead ends: 631 [2018-06-22 01:07:59,092 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=928, Invalid=3232, Unknown=0, NotChecked=0, Total=4160 [2018-06-22 01:07:59,092 INFO ]: Start minimizeSevpa. Operand 631 states. [2018-06-22 01:07:59,095 INFO ]: Finished minimizeSevpa. Reduced states from 631 to 79. [2018-06-22 01:07:59,095 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:07:59,096 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-06-22 01:07:59,096 INFO ]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 57 [2018-06-22 01:07:59,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:59,096 INFO ]: Abstraction has 79 states and 89 transitions. [2018-06-22 01:07:59,096 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:59,096 INFO ]: Start isEmpty. Operand 79 states and 89 transitions. [2018-06-22 01:07:59,096 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 01:07:59,096 INFO ]: Found error trace [2018-06-22 01:07:59,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:59,096 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:59,097 INFO ]: Analyzing trace with hash 550944142, now seen corresponding path program 1 times [2018-06-22 01:07:59,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:59,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:59,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:59,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:59,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:59,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:59,363 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:59,363 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:59,363 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:07:59,363 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:07:59,363 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:07:59,363 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:07:59,363 INFO ]: Start difference. First operand 79 states and 89 transitions. Second operand 12 states. [2018-06-22 01:07:59,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:07:59,877 INFO ]: Finished difference Result 283 states and 314 transitions. [2018-06-22 01:07:59,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:07:59,877 INFO ]: Start accepts. Automaton has 12 states. Word has length 57 [2018-06-22 01:07:59,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:07:59,878 INFO ]: With dead ends: 283 [2018-06-22 01:07:59,878 INFO ]: Without dead ends: 280 [2018-06-22 01:07:59,879 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 01:07:59,879 INFO ]: Start minimizeSevpa. Operand 280 states. [2018-06-22 01:07:59,881 INFO ]: Finished minimizeSevpa. Reduced states from 280 to 77. [2018-06-22 01:07:59,881 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 01:07:59,881 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-06-22 01:07:59,881 INFO ]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 57 [2018-06-22 01:07:59,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:07:59,881 INFO ]: Abstraction has 77 states and 86 transitions. [2018-06-22 01:07:59,881 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:07:59,881 INFO ]: Start isEmpty. Operand 77 states and 86 transitions. [2018-06-22 01:07:59,881 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-22 01:07:59,881 INFO ]: Found error trace [2018-06-22 01:07:59,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:07:59,881 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:07:59,881 INFO ]: Analyzing trace with hash -460509886, now seen corresponding path program 1 times [2018-06-22 01:07:59,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:07:59,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:07:59,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:59,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:07:59,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:07:59,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:07:59,985 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:07:59,985 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:07:59,985 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:07:59,985 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:07:59,985 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:07:59,985 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:07:59,985 INFO ]: Start difference. First operand 77 states and 86 transitions. Second operand 13 states. [2018-06-22 01:08:00,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:00,628 INFO ]: Finished difference Result 465 states and 521 transitions. [2018-06-22 01:08:00,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:08:00,629 INFO ]: Start accepts. Automaton has 13 states. Word has length 58 [2018-06-22 01:08:00,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:00,630 INFO ]: With dead ends: 465 [2018-06-22 01:08:00,630 INFO ]: Without dead ends: 464 [2018-06-22 01:08:00,630 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=698, Invalid=2164, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 01:08:00,630 INFO ]: Start minimizeSevpa. Operand 464 states. [2018-06-22 01:08:00,632 INFO ]: Finished minimizeSevpa. Reduced states from 464 to 80. [2018-06-22 01:08:00,632 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-22 01:08:00,632 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-06-22 01:08:00,632 INFO ]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 58 [2018-06-22 01:08:00,632 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:00,632 INFO ]: Abstraction has 80 states and 89 transitions. [2018-06-22 01:08:00,632 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:08:00,632 INFO ]: Start isEmpty. Operand 80 states and 89 transitions. [2018-06-22 01:08:00,632 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-22 01:08:00,632 INFO ]: Found error trace [2018-06-22 01:08:00,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:08:00,633 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:08:00,633 INFO ]: Analyzing trace with hash -258136830, now seen corresponding path program 1 times [2018-06-22 01:08:00,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:08:00,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:08:00,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:00,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:08:00,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:08:00,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:08:00,795 INFO ]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:08:00,796 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:08:00,796 INFO ]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-06-22 01:08:00,796 INFO ]: Interpolant automaton has 13 states [2018-06-22 01:08:00,796 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 01:08:00,796 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 01:08:00,796 INFO ]: Start difference. First operand 80 states and 89 transitions. Second operand 13 states. [2018-06-22 01:08:00,939 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:08:00,939 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-22 01:08:00,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:08:00,939 INFO ]: Start accepts. Automaton has 13 states. Word has length 58 [2018-06-22 01:08:00,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:08:00,939 INFO ]: With dead ends: 28 [2018-06-22 01:08:00,939 INFO ]: Without dead ends: 0 [2018-06-22 01:08:00,939 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-06-22 01:08:00,939 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:08:00,939 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:08:00,939 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:08:00,939 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:08:00,939 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-06-22 01:08:00,939 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:08:00,939 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:08:00,939 INFO ]: Interpolant automaton has 13 states. [2018-06-22 01:08:00,939 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:08:00,939 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:08:00,943 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:08:00 BoogieIcfgContainer [2018-06-22 01:08:00,943 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:08:00,944 INFO ]: Toolchain (without parser) took 30406.91 ms. Allocated memory was 305.1 MB in the beginning and 684.7 MB in the end (delta: 379.6 MB). Free memory was 195.9 MB in the beginning and 528.2 MB in the end (delta: -332.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 3.6 GB. [2018-06-22 01:08:00,945 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:08:00,945 INFO ]: ChcToBoogie took 113.16 ms. Allocated memory is still 305.1 MB. Free memory was 195.9 MB in the beginning and 191.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:08:00,945 INFO ]: Boogie Preprocessor took 100.52 ms. Allocated memory is still 305.1 MB. Free memory was 191.0 MB in the beginning and 189.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:08:00,946 INFO ]: RCFGBuilder took 1670.24 ms. Allocated memory was 305.1 MB in the beginning and 324.0 MB in the end (delta: 18.9 MB). Free memory was 189.0 MB in the beginning and 172.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 35.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:08:00,946 INFO ]: TraceAbstraction took 28507.16 ms. Allocated memory was 324.0 MB in the beginning and 684.7 MB in the end (delta: 360.7 MB). Free memory was 172.4 MB in the beginning and 528.2 MB in the end (delta: -355.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:08:00,948 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 113.16 ms. Allocated memory is still 305.1 MB. Free memory was 195.9 MB in the beginning and 191.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 100.52 ms. Allocated memory is still 305.1 MB. Free memory was 191.0 MB in the beginning and 189.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1670.24 ms. Allocated memory was 305.1 MB in the beginning and 324.0 MB in the end (delta: 18.9 MB). Free memory was 189.0 MB in the beginning and 172.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 35.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28507.16 ms. Allocated memory was 324.0 MB in the beginning and 684.7 MB in the end (delta: 360.7 MB). Free memory was 172.4 MB in the beginning and 528.2 MB in the end (delta: -355.8 MB). Peak memory consumption was 4.9 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, 70 locations, 1 error locations. SAFE Result, 28.4s OverallTime, 28 OverallIterations, 2 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2854 SDtfs, 17168 SDslu, 27361 SDs, 0 SdLazy, 4288 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1276 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 1097 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15894 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=5, 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.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 6757 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1422 NumberOfCodeBlocks, 1422 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1394 ConstructedInterpolants, 0 QuantifiedInterpolants, 101502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 176/176 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/45.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-08-00-960.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/45.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-08-00-960.csv Received shutdown request...