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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:16:39,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:16:39,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:16:39,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:16:39,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:16:39,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:16:39,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:16:39,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:16:39,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:16:39,545 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:16:39,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:16:39,546 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:16:39,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:16:39,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:16:39,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:16:39,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:16:39,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:16:39,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:16:39,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:16:39,567 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:16:39,568 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:16:39,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:16:39,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:16:39,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:16:39,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:16:39,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:16:39,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:16:39,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:16:39,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:16:39,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:16:39,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:16:39,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:16:39,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:16:39,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:16:39,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:16:39,583 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:16:39,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:16:39,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:16:39,602 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:16:39,603 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:16:39,603 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:16:39,604 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:16:39,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:16:39,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:16:39,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:16:39,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:16:39,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:16:39,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:16:39,606 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:16:39,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:16:39,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:16:39,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:16:39,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:16:39,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:16:39,607 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:16:39,610 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:16:39,611 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:16:39,653 INFO ]: Repository-Root is: /tmp [2018-06-22 11:16:39,674 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:16:39,679 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:16:39,680 INFO ]: Initializing SmtParser... [2018-06-22 11:16:39,680 INFO ]: SmtParser initialized [2018-06-22 11:16:39,681 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-22 11:16:39,682 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 11:16:39,773 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 unknown [2018-06-22 11:16:40,014 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014d-horn.smt2 [2018-06-22 11:16:40,024 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:16:40,033 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:16:40,034 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:16:40,034 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:16:40,034 INFO ]: ChcToBoogie initialized [2018-06-22 11:16:40,037 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,083 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40 Unit [2018-06-22 11:16:40,083 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:16:40,084 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:16:40,084 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:16:40,084 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:16:40,107 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,108 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,115 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,116 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,120 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,122 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,129 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (1/1) ... [2018-06-22 11:16:40,131 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:16:40,131 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:16:40,131 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:16:40,132 INFO ]: RCFGBuilder initialized [2018-06-22 11:16:40,137 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (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 11:16:40,147 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:16:40,147 INFO ]: Found specification of procedure False [2018-06-22 11:16:40,148 INFO ]: Found implementation of procedure False [2018-06-22 11:16:40,148 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:16:40,148 INFO ]: Found specification of procedure REC__f [2018-06-22 11:16:40,148 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:16:40,148 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:16:40,148 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:16:40,148 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:16:40,148 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:16:40,148 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:16:40,148 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:16:40,148 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:16:40,148 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:16:40,148 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 11:16:40,520 INFO ]: Using library mode [2018-06-22 11:16:40,521 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:40 BoogieIcfgContainer [2018-06-22 11:16:40,521 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:16:40,524 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:16:40,524 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:16:40,527 INFO ]: TraceAbstraction initialized [2018-06-22 11:16:40,527 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:16:40" (1/3) ... [2018-06-22 11:16:40,528 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d34a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:16:40, skipping insertion in model container [2018-06-22 11:16:40,529 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:16:40" (2/3) ... [2018-06-22 11:16:40,529 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d34a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:16:40, skipping insertion in model container [2018-06-22 11:16:40,529 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:16:40" (3/3) ... [2018-06-22 11:16:40,532 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:16:40,542 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:16:40,552 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:16:40,594 INFO ]: Using default assertion order modulation [2018-06-22 11:16:40,594 INFO ]: Interprodecural is true [2018-06-22 11:16:40,594 INFO ]: Hoare is false [2018-06-22 11:16:40,595 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:16:40,595 INFO ]: Backedges is TWOTRACK [2018-06-22 11:16:40,595 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:16:40,595 INFO ]: Difference is false [2018-06-22 11:16:40,595 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:16:40,595 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:16:40,624 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 11:16:40,636 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:16:40,636 INFO ]: Found error trace [2018-06-22 11:16:40,636 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:16:40,636 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:40,640 INFO ]: Analyzing trace with hash 115984119, now seen corresponding path program 1 times [2018-06-22 11:16:40,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:40,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:40,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:40,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:40,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:40,688 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:40,716 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:40,719 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:40,719 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:16:40,721 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:16:40,736 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:16:40,736 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:16:40,739 INFO ]: Start difference. First operand 30 states. Second operand 2 states. [2018-06-22 11:16:40,760 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:40,760 INFO ]: Finished difference Result 26 states and 43 transitions. [2018-06-22 11:16:40,760 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:16:40,761 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:16:40,761 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:40,774 INFO ]: With dead ends: 26 [2018-06-22 11:16:40,775 INFO ]: Without dead ends: 26 [2018-06-22 11:16:40,776 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:16:40,795 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:16:40,815 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:16:40,816 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:16:40,818 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2018-06-22 11:16:40,819 INFO ]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 5 [2018-06-22 11:16:40,819 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:40,819 INFO ]: Abstraction has 26 states and 43 transitions. [2018-06-22 11:16:40,819 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:16:40,819 INFO ]: Start isEmpty. Operand 26 states and 43 transitions. [2018-06-22 11:16:40,822 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:16:40,822 INFO ]: Found error trace [2018-06-22 11:16:40,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:40,822 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:40,822 INFO ]: Analyzing trace with hash 1283474471, now seen corresponding path program 1 times [2018-06-22 11:16:40,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:40,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:40,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:40,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:40,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:40,850 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:40,925 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:40,925 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:40,926 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:40,927 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:40,927 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:40,927 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:40,928 INFO ]: Start difference. First operand 26 states and 43 transitions. Second operand 4 states. [2018-06-22 11:16:41,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:41,033 INFO ]: Finished difference Result 30 states and 49 transitions. [2018-06-22 11:16:41,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:41,034 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:16:41,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:41,035 INFO ]: With dead ends: 30 [2018-06-22 11:16:41,035 INFO ]: Without dead ends: 30 [2018-06-22 11:16:41,036 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,036 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:16:41,051 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:16:41,051 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:16:41,052 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2018-06-22 11:16:41,052 INFO ]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 9 [2018-06-22 11:16:41,053 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:41,053 INFO ]: Abstraction has 28 states and 47 transitions. [2018-06-22 11:16:41,053 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:41,053 INFO ]: Start isEmpty. Operand 28 states and 47 transitions. [2018-06-22 11:16:41,055 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:16:41,055 INFO ]: Found error trace [2018-06-22 11:16:41,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:41,055 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:41,055 INFO ]: Analyzing trace with hash -928456940, now seen corresponding path program 1 times [2018-06-22 11:16:41,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:41,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:41,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:41,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,062 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:41,111 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:41,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:41,111 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:41,111 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:41,111 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:41,111 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,111 INFO ]: Start difference. First operand 28 states and 47 transitions. Second operand 4 states. [2018-06-22 11:16:41,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:41,230 INFO ]: Finished difference Result 34 states and 56 transitions. [2018-06-22 11:16:41,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:41,231 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:16:41,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:41,232 INFO ]: With dead ends: 34 [2018-06-22 11:16:41,232 INFO ]: Without dead ends: 34 [2018-06-22 11:16:41,233 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,233 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:16:41,244 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 11:16:41,244 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:16:41,247 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 54 transitions. [2018-06-22 11:16:41,247 INFO ]: Start accepts. Automaton has 32 states and 54 transitions. Word has length 9 [2018-06-22 11:16:41,247 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:41,248 INFO ]: Abstraction has 32 states and 54 transitions. [2018-06-22 11:16:41,248 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:41,248 INFO ]: Start isEmpty. Operand 32 states and 54 transitions. [2018-06-22 11:16:41,249 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:16:41,249 INFO ]: Found error trace [2018-06-22 11:16:41,249 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:41,249 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:41,249 INFO ]: Analyzing trace with hash 2042436298, now seen corresponding path program 1 times [2018-06-22 11:16:41,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:41,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:41,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:41,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:41,462 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:41,462 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:41,463 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:41,463 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:41,463 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:41,463 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,463 INFO ]: Start difference. First operand 32 states and 54 transitions. Second operand 4 states. [2018-06-22 11:16:41,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:41,534 INFO ]: Finished difference Result 36 states and 59 transitions. [2018-06-22 11:16:41,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:41,534 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:16:41,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:41,536 INFO ]: With dead ends: 36 [2018-06-22 11:16:41,536 INFO ]: Without dead ends: 36 [2018-06-22 11:16:41,536 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,536 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:16:41,543 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 11:16:41,543 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:16:41,544 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-06-22 11:16:41,544 INFO ]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 9 [2018-06-22 11:16:41,544 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:41,544 INFO ]: Abstraction has 34 states and 57 transitions. [2018-06-22 11:16:41,544 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:41,545 INFO ]: Start isEmpty. Operand 34 states and 57 transitions. [2018-06-22 11:16:41,546 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:41,546 INFO ]: Found error trace [2018-06-22 11:16:41,546 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:41,546 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:41,546 INFO ]: Analyzing trace with hash 2068540746, now seen corresponding path program 1 times [2018-06-22 11:16:41,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:41,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:41,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:41,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,555 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:41,601 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:41,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:41,601 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:41,601 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:41,601 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:41,601 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,602 INFO ]: Start difference. First operand 34 states and 57 transitions. Second operand 4 states. [2018-06-22 11:16:41,652 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:41,652 INFO ]: Finished difference Result 36 states and 58 transitions. [2018-06-22 11:16:41,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:41,652 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:41,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:41,653 INFO ]: With dead ends: 36 [2018-06-22 11:16:41,653 INFO ]: Without dead ends: 36 [2018-06-22 11:16:41,653 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:41,654 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:16:41,659 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-22 11:16:41,660 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:16:41,660 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2018-06-22 11:16:41,660 INFO ]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 13 [2018-06-22 11:16:41,661 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:41,661 INFO ]: Abstraction has 32 states and 53 transitions. [2018-06-22 11:16:41,661 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:41,661 INFO ]: Start isEmpty. Operand 32 states and 53 transitions. [2018-06-22 11:16:41,662 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:41,662 INFO ]: Found error trace [2018-06-22 11:16:41,662 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:41,662 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:41,662 INFO ]: Analyzing trace with hash -667010928, now seen corresponding path program 1 times [2018-06-22 11:16:41,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:41,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:41,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,663 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:41,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:41,675 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:41,807 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:16:41,807 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:41,807 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:41,807 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:41,807 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:41,807 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:41,808 INFO ]: Start difference. First operand 32 states and 53 transitions. Second operand 6 states. [2018-06-22 11:16:42,170 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:16:42,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:42,347 INFO ]: Finished difference Result 36 states and 58 transitions. [2018-06-22 11:16:42,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:42,347 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:16:42,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:42,349 INFO ]: With dead ends: 36 [2018-06-22 11:16:42,349 INFO ]: Without dead ends: 36 [2018-06-22 11:16:42,349 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:42,349 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:16:42,354 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-06-22 11:16:42,355 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:16:42,356 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2018-06-22 11:16:42,356 INFO ]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 13 [2018-06-22 11:16:42,356 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:42,356 INFO ]: Abstraction has 32 states and 53 transitions. [2018-06-22 11:16:42,356 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:42,356 INFO ]: Start isEmpty. Operand 32 states and 53 transitions. [2018-06-22 11:16:42,359 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:42,359 INFO ]: Found error trace [2018-06-22 11:16:42,359 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:42,359 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:42,360 INFO ]: Analyzing trace with hash 235606104, now seen corresponding path program 1 times [2018-06-22 11:16:42,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:42,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:42,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:42,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,420 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:42,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:42,420 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:42,420 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:42,420 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:42,420 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:42,420 INFO ]: Start difference. First operand 32 states and 53 transitions. Second operand 4 states. [2018-06-22 11:16:42,530 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:42,530 INFO ]: Finished difference Result 38 states and 62 transitions. [2018-06-22 11:16:42,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:42,533 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:42,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:42,534 INFO ]: With dead ends: 38 [2018-06-22 11:16:42,534 INFO ]: Without dead ends: 38 [2018-06-22 11:16:42,534 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:42,534 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:16:42,541 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-06-22 11:16:42,541 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:16:42,545 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2018-06-22 11:16:42,546 INFO ]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 13 [2018-06-22 11:16:42,546 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:42,546 INFO ]: Abstraction has 32 states and 53 transitions. [2018-06-22 11:16:42,546 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:42,546 INFO ]: Start isEmpty. Operand 32 states and 53 transitions. [2018-06-22 11:16:42,547 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:42,547 INFO ]: Found error trace [2018-06-22 11:16:42,547 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:42,547 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:42,547 INFO ]: Analyzing trace with hash -277913365, now seen corresponding path program 1 times [2018-06-22 11:16:42,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:42,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:42,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:42,548 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,562 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,625 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:42,625 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:42,625 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:42,625 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:42,625 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:42,625 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:42,626 INFO ]: Start difference. First operand 32 states and 53 transitions. Second operand 4 states. [2018-06-22 11:16:42,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:42,651 INFO ]: Finished difference Result 38 states and 61 transitions. [2018-06-22 11:16:42,652 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:42,652 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:42,653 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:42,653 INFO ]: With dead ends: 38 [2018-06-22 11:16:42,653 INFO ]: Without dead ends: 38 [2018-06-22 11:16:42,654 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:42,654 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:16:42,660 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:16:42,660 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:16:42,661 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-06-22 11:16:42,661 INFO ]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 13 [2018-06-22 11:16:42,661 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:42,661 INFO ]: Abstraction has 36 states and 58 transitions. [2018-06-22 11:16:42,661 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:42,661 INFO ]: Start isEmpty. Operand 36 states and 58 transitions. [2018-06-22 11:16:42,662 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:42,662 INFO ]: Found error trace [2018-06-22 11:16:42,662 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:42,662 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:42,662 INFO ]: Analyzing trace with hash 457839194, now seen corresponding path program 1 times [2018-06-22 11:16:42,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:42,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:42,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,663 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:42,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:42,678 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:42,954 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:42,954 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:42,954 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:42,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,004 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,015 INFO ]: Computing forward predicates... [2018-06-22 11:16:43,141 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:43,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:43,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:16:43,164 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:16:43,164 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:16:43,164 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:16:43,165 INFO ]: Start difference. First operand 36 states and 58 transitions. Second operand 8 states. [2018-06-22 11:16:43,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:43,545 INFO ]: Finished difference Result 44 states and 69 transitions. [2018-06-22 11:16:43,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:16:43,545 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:16:43,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:43,546 INFO ]: With dead ends: 44 [2018-06-22 11:16:43,546 INFO ]: Without dead ends: 44 [2018-06-22 11:16:43,546 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:43,546 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:16:43,559 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-22 11:16:43,559 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:16:43,560 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2018-06-22 11:16:43,560 INFO ]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 13 [2018-06-22 11:16:43,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:43,561 INFO ]: Abstraction has 40 states and 64 transitions. [2018-06-22 11:16:43,561 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:16:43,561 INFO ]: Start isEmpty. Operand 40 states and 64 transitions. [2018-06-22 11:16:43,561 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:43,562 INFO ]: Found error trace [2018-06-22 11:16:43,562 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:43,564 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:43,564 INFO ]: Analyzing trace with hash 971358663, now seen corresponding path program 1 times [2018-06-22 11:16:43,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:43,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:43,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,618 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:43,618 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:43,618 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:43,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,647 INFO ]: Computing forward predicates... [2018-06-22 11:16:43,661 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:43,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:43,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:16:43,680 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:43,681 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:43,681 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:43,681 INFO ]: Start difference. First operand 40 states and 64 transitions. Second operand 6 states. [2018-06-22 11:16:43,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:43,772 INFO ]: Finished difference Result 46 states and 73 transitions. [2018-06-22 11:16:43,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:43,772 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:16:43,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:43,773 INFO ]: With dead ends: 46 [2018-06-22 11:16:43,773 INFO ]: Without dead ends: 46 [2018-06-22 11:16:43,773 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:43,773 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:16:43,784 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-06-22 11:16:43,784 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:16:43,785 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2018-06-22 11:16:43,785 INFO ]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 13 [2018-06-22 11:16:43,785 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:43,785 INFO ]: Abstraction has 42 states and 67 transitions. [2018-06-22 11:16:43,785 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:43,785 INFO ]: Start isEmpty. Operand 42 states and 67 transitions. [2018-06-22 11:16:43,786 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:16:43,786 INFO ]: Found error trace [2018-06-22 11:16:43,786 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:43,786 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:43,786 INFO ]: Analyzing trace with hash -210697906, now seen corresponding path program 1 times [2018-06-22 11:16:43,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:43,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:43,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,834 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:43,835 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:43,835 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:43,835 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:43,835 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:43,835 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:43,835 INFO ]: Start difference. First operand 42 states and 67 transitions. Second operand 4 states. [2018-06-22 11:16:43,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:43,853 INFO ]: Finished difference Result 42 states and 66 transitions. [2018-06-22 11:16:43,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:43,853 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:16:43,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:43,854 INFO ]: With dead ends: 42 [2018-06-22 11:16:43,854 INFO ]: Without dead ends: 41 [2018-06-22 11:16:43,854 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:43,854 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:16:43,860 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-22 11:16:43,861 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:16:43,861 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2018-06-22 11:16:43,861 INFO ]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 13 [2018-06-22 11:16:43,861 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:43,861 INFO ]: Abstraction has 41 states and 64 transitions. [2018-06-22 11:16:43,862 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:43,862 INFO ]: Start isEmpty. Operand 41 states and 64 transitions. [2018-06-22 11:16:43,862 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:43,862 INFO ]: Found error trace [2018-06-22 11:16:43,862 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:43,863 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:43,863 INFO ]: Analyzing trace with hash -1012539743, now seen corresponding path program 1 times [2018-06-22 11:16:43,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:43,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:43,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,863 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:43,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:43,874 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:43,984 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:43,984 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:43,984 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:43,985 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:43,985 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:43,985 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:43,985 INFO ]: Start difference. First operand 41 states and 64 transitions. Second operand 6 states. [2018-06-22 11:16:44,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:44,236 INFO ]: Finished difference Result 49 states and 77 transitions. [2018-06-22 11:16:44,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:16:44,237 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:16:44,237 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:44,238 INFO ]: With dead ends: 49 [2018-06-22 11:16:44,238 INFO ]: Without dead ends: 49 [2018-06-22 11:16:44,238 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:44,238 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:16:44,249 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-22 11:16:44,249 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:16:44,250 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 70 transitions. [2018-06-22 11:16:44,250 INFO ]: Start accepts. Automaton has 45 states and 70 transitions. Word has length 17 [2018-06-22 11:16:44,250 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:44,250 INFO ]: Abstraction has 45 states and 70 transitions. [2018-06-22 11:16:44,250 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:44,250 INFO ]: Start isEmpty. Operand 45 states and 70 transitions. [2018-06-22 11:16:44,251 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:44,251 INFO ]: Found error trace [2018-06-22 11:16:44,251 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:44,251 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:44,251 INFO ]: Analyzing trace with hash 1455970173, now seen corresponding path program 1 times [2018-06-22 11:16:44,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:44,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:44,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:44,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,307 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:44,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:44,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:44,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:44,340 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,341 INFO ]: Computing forward predicates... [2018-06-22 11:16:44,356 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:44,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:44,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:16:44,375 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:44,375 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:44,375 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:44,375 INFO ]: Start difference. First operand 45 states and 70 transitions. Second operand 6 states. [2018-06-22 11:16:44,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:44,456 INFO ]: Finished difference Result 51 states and 78 transitions. [2018-06-22 11:16:44,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:16:44,457 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:16:44,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:44,458 INFO ]: With dead ends: 51 [2018-06-22 11:16:44,458 INFO ]: Without dead ends: 51 [2018-06-22 11:16:44,458 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:16:44,458 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:16:44,463 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-22 11:16:44,463 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 11:16:44,464 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2018-06-22 11:16:44,464 INFO ]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 17 [2018-06-22 11:16:44,464 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:44,464 INFO ]: Abstraction has 41 states and 64 transitions. [2018-06-22 11:16:44,464 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:44,464 INFO ]: Start isEmpty. Operand 41 states and 64 transitions. [2018-06-22 11:16:44,465 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:44,465 INFO ]: Found error trace [2018-06-22 11:16:44,465 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:44,465 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:44,465 INFO ]: Analyzing trace with hash -1204654717, now seen corresponding path program 1 times [2018-06-22 11:16:44,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:44,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:44,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:44,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:44,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,664 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:44,664 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:44,664 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:44,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:44,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:44,701 INFO ]: Computing forward predicates... [2018-06-22 11:16:44,934 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:44,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:44,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:16:44,954 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:16:44,955 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:16:44,955 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:44,955 INFO ]: Start difference. First operand 41 states and 64 transitions. Second operand 14 states. [2018-06-22 11:16:45,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:45,298 INFO ]: Finished difference Result 47 states and 73 transitions. [2018-06-22 11:16:45,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:16:45,298 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:16:45,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:45,299 INFO ]: With dead ends: 47 [2018-06-22 11:16:45,299 INFO ]: Without dead ends: 47 [2018-06-22 11:16:45,299 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:45,299 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:16:45,305 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-22 11:16:45,305 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:16:45,305 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 62 transitions. [2018-06-22 11:16:45,305 INFO ]: Start accepts. Automaton has 39 states and 62 transitions. Word has length 17 [2018-06-22 11:16:45,305 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:45,305 INFO ]: Abstraction has 39 states and 62 transitions. [2018-06-22 11:16:45,306 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:16:45,306 INFO ]: Start isEmpty. Operand 39 states and 62 transitions. [2018-06-22 11:16:45,306 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:45,306 INFO ]: Found error trace [2018-06-22 11:16:45,306 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:45,306 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:45,307 INFO ]: Analyzing trace with hash 1157433310, now seen corresponding path program 1 times [2018-06-22 11:16:45,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:45,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:45,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:45,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,354 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:45,354 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:45,354 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:45,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:45,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,373 INFO ]: Computing forward predicates... [2018-06-22 11:16:45,377 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:45,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:45,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:16:45,398 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:45,399 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:45,399 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:45,399 INFO ]: Start difference. First operand 39 states and 62 transitions. Second operand 6 states. [2018-06-22 11:16:45,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:45,469 INFO ]: Finished difference Result 47 states and 72 transitions. [2018-06-22 11:16:45,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:45,470 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:16:45,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:45,470 INFO ]: With dead ends: 47 [2018-06-22 11:16:45,470 INFO ]: Without dead ends: 47 [2018-06-22 11:16:45,470 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:45,470 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:16:45,475 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-22 11:16:45,475 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:16:45,476 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2018-06-22 11:16:45,476 INFO ]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 17 [2018-06-22 11:16:45,476 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:45,476 INFO ]: Abstraction has 45 states and 69 transitions. [2018-06-22 11:16:45,476 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:45,476 INFO ]: Start isEmpty. Operand 45 states and 69 transitions. [2018-06-22 11:16:45,477 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:45,477 INFO ]: Found error trace [2018-06-22 11:16:45,477 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:45,477 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:45,477 INFO ]: Analyzing trace with hash -669024070, now seen corresponding path program 2 times [2018-06-22 11:16:45,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:45,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:45,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:45,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,484 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,523 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:45,523 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:45,524 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:45,532 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:45,546 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:45,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,548 INFO ]: Computing forward predicates... [2018-06-22 11:16:45,561 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:45,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:45,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:16:45,581 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:16:45,581 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:16:45,581 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:45,581 INFO ]: Start difference. First operand 45 states and 69 transitions. Second operand 7 states. [2018-06-22 11:16:45,661 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:45,661 INFO ]: Finished difference Result 49 states and 75 transitions. [2018-06-22 11:16:45,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:16:45,662 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:16:45,662 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:45,662 INFO ]: With dead ends: 49 [2018-06-22 11:16:45,662 INFO ]: Without dead ends: 49 [2018-06-22 11:16:45,662 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:45,663 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:16:45,667 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-06-22 11:16:45,667 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-22 11:16:45,668 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2018-06-22 11:16:45,668 INFO ]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 17 [2018-06-22 11:16:45,668 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:45,668 INFO ]: Abstraction has 45 states and 69 transitions. [2018-06-22 11:16:45,668 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:16:45,668 INFO ]: Start isEmpty. Operand 45 states and 69 transitions. [2018-06-22 11:16:45,669 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:45,669 INFO ]: Found error trace [2018-06-22 11:16:45,669 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:45,669 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:45,670 INFO ]: Analyzing trace with hash 1739521229, now seen corresponding path program 2 times [2018-06-22 11:16:45,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:45,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:45,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:45,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:45,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,811 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:16:45,811 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:45,811 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:45,820 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:45,839 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:45,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:45,840 INFO ]: Computing forward predicates... [2018-06-22 11:16:45,961 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:45,980 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:45,980 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:16:45,980 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:16:45,980 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:16:45,980 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:45,980 INFO ]: Start difference. First operand 45 states and 69 transitions. Second operand 11 states. [2018-06-22 11:16:46,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:46,206 INFO ]: Finished difference Result 61 states and 93 transitions. [2018-06-22 11:16:46,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:16:46,207 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:16:46,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:46,208 INFO ]: With dead ends: 61 [2018-06-22 11:16:46,208 INFO ]: Without dead ends: 61 [2018-06-22 11:16:46,208 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:46,208 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:16:46,214 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-06-22 11:16:46,214 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:16:46,215 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2018-06-22 11:16:46,215 INFO ]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 17 [2018-06-22 11:16:46,215 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:46,215 INFO ]: Abstraction has 49 states and 75 transitions. [2018-06-22 11:16:46,215 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:16:46,215 INFO ]: Start isEmpty. Operand 49 states and 75 transitions. [2018-06-22 11:16:46,216 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:16:46,216 INFO ]: Found error trace [2018-06-22 11:16:46,216 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:46,216 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:46,216 INFO ]: Analyzing trace with hash -345475436, now seen corresponding path program 1 times [2018-06-22 11:16:46,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:46,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:46,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:46,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:46,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:46,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:46,285 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:16:46,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:46,286 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:46,286 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:46,286 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:46,286 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:46,286 INFO ]: Start difference. First operand 49 states and 75 transitions. Second operand 6 states. [2018-06-22 11:16:46,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:46,358 INFO ]: Finished difference Result 51 states and 76 transitions. [2018-06-22 11:16:46,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:46,358 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:16:46,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:46,359 INFO ]: With dead ends: 51 [2018-06-22 11:16:46,359 INFO ]: Without dead ends: 51 [2018-06-22 11:16:46,359 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:46,359 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 11:16:46,362 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-06-22 11:16:46,362 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:16:46,362 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2018-06-22 11:16:46,363 INFO ]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 17 [2018-06-22 11:16:46,363 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:46,363 INFO ]: Abstraction has 49 states and 74 transitions. [2018-06-22 11:16:46,363 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:46,363 INFO ]: Start isEmpty. Operand 49 states and 74 transitions. [2018-06-22 11:16:46,363 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:46,363 INFO ]: Found error trace [2018-06-22 11:16:46,363 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:46,363 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:46,363 INFO ]: Analyzing trace with hash -642437868, now seen corresponding path program 1 times [2018-06-22 11:16:46,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:46,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:46,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:46,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:46,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:46,370 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:46,449 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:46,450 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:46,450 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:46,455 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:46,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:46,479 INFO ]: Computing forward predicates... [2018-06-22 11:16:46,646 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:46,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:46,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:16:46,665 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:16:46,666 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:16:46,666 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:46,666 INFO ]: Start difference. First operand 49 states and 74 transitions. Second operand 14 states. [2018-06-22 11:16:47,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:47,140 INFO ]: Finished difference Result 65 states and 96 transitions. [2018-06-22 11:16:47,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:16:47,141 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:16:47,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:47,141 INFO ]: With dead ends: 65 [2018-06-22 11:16:47,141 INFO ]: Without dead ends: 65 [2018-06-22 11:16:47,142 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:16:47,142 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:16:47,148 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-06-22 11:16:47,148 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:16:47,149 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2018-06-22 11:16:47,149 INFO ]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 21 [2018-06-22 11:16:47,149 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:47,149 INFO ]: Abstraction has 59 states and 87 transitions. [2018-06-22 11:16:47,149 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:16:47,149 INFO ]: Start isEmpty. Operand 59 states and 87 transitions. [2018-06-22 11:16:47,150 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:47,150 INFO ]: Found error trace [2018-06-22 11:16:47,150 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:47,150 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:47,150 INFO ]: Analyzing trace with hash -776487440, now seen corresponding path program 2 times [2018-06-22 11:16:47,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:47,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:47,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:47,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,157 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:47,265 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:47,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:47,265 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:47,296 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:47,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:47,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:47,340 INFO ]: Computing forward predicates... [2018-06-22 11:16:47,361 INFO ]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:47,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:47,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:16:47,382 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:16:47,382 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:16:47,382 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:47,382 INFO ]: Start difference. First operand 59 states and 87 transitions. Second operand 9 states. [2018-06-22 11:16:47,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:47,492 INFO ]: Finished difference Result 67 states and 99 transitions. [2018-06-22 11:16:47,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:16:47,492 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:16:47,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:47,493 INFO ]: With dead ends: 67 [2018-06-22 11:16:47,493 INFO ]: Without dead ends: 67 [2018-06-22 11:16:47,493 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:16:47,494 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:16:47,499 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-06-22 11:16:47,499 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:16:47,499 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2018-06-22 11:16:47,500 INFO ]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 21 [2018-06-22 11:16:47,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:47,500 INFO ]: Abstraction has 55 states and 83 transitions. [2018-06-22 11:16:47,500 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:16:47,500 INFO ]: Start isEmpty. Operand 55 states and 83 transitions. [2018-06-22 11:16:47,501 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:47,501 INFO ]: Found error trace [2018-06-22 11:16:47,501 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:47,501 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:47,501 INFO ]: Analyzing trace with hash 747409078, now seen corresponding path program 2 times [2018-06-22 11:16:47,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:47,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:47,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,502 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:47,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:47,510 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:48,533 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:48,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:48,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:48,539 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:48,552 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:48,552 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:48,554 INFO ]: Computing forward predicates... [2018-06-22 11:16:48,720 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:16:48,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:48,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:16:48,740 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:16:48,740 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:16:48,740 INFO ]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:48,740 INFO ]: Start difference. First operand 55 states and 83 transitions. Second operand 18 states. [2018-06-22 11:16:49,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:49,420 INFO ]: Finished difference Result 63 states and 96 transitions. [2018-06-22 11:16:49,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:16:49,420 INFO ]: Start accepts. Automaton has 18 states. Word has length 21 [2018-06-22 11:16:49,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:49,421 INFO ]: With dead ends: 63 [2018-06-22 11:16:49,421 INFO ]: Without dead ends: 63 [2018-06-22 11:16:49,422 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:16:49,422 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:16:49,427 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 51. [2018-06-22 11:16:49,427 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:16:49,428 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2018-06-22 11:16:49,428 INFO ]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 21 [2018-06-22 11:16:49,430 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:49,430 INFO ]: Abstraction has 51 states and 79 transitions. [2018-06-22 11:16:49,430 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:16:49,430 INFO ]: Start isEmpty. Operand 51 states and 79 transitions. [2018-06-22 11:16:49,431 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:49,431 INFO ]: Found error trace [2018-06-22 11:16:49,431 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:49,431 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:49,431 INFO ]: Analyzing trace with hash 1642527505, now seen corresponding path program 2 times [2018-06-22 11:16:49,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:49,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:49,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:49,433 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:49,433 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:49,449 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:49,682 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:49,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:49,683 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:49,688 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:49,699 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:49,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:49,700 INFO ]: Computing forward predicates... [2018-06-22 11:16:49,722 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:49,740 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:49,740 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:16:49,740 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:16:49,741 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:16:49,741 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:49,741 INFO ]: Start difference. First operand 51 states and 79 transitions. Second operand 7 states. [2018-06-22 11:16:49,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:49,815 INFO ]: Finished difference Result 61 states and 91 transitions. [2018-06-22 11:16:49,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:16:49,817 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:16:49,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:49,817 INFO ]: With dead ends: 61 [2018-06-22 11:16:49,817 INFO ]: Without dead ends: 61 [2018-06-22 11:16:49,817 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:49,818 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:16:49,822 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-06-22 11:16:49,822 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 11:16:49,823 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2018-06-22 11:16:49,823 INFO ]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 21 [2018-06-22 11:16:49,823 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:49,823 INFO ]: Abstraction has 59 states and 88 transitions. [2018-06-22 11:16:49,823 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:16:49,823 INFO ]: Start isEmpty. Operand 59 states and 88 transitions. [2018-06-22 11:16:49,824 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:49,824 INFO ]: Found error trace [2018-06-22 11:16:49,824 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:49,824 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:49,824 INFO ]: Analyzing trace with hash 1508477933, now seen corresponding path program 3 times [2018-06-22 11:16:49,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:49,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:49,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:49,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:49,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:49,830 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:49,938 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:49,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:49,938 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:49,945 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:49,956 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:16:49,956 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:49,958 INFO ]: Computing forward predicates... [2018-06-22 11:16:49,971 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:49,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:49,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:16:49,990 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:16:49,990 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:16:49,990 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:16:49,990 INFO ]: Start difference. First operand 59 states and 88 transitions. Second operand 8 states. [2018-06-22 11:16:50,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:50,067 INFO ]: Finished difference Result 65 states and 97 transitions. [2018-06-22 11:16:50,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:16:50,068 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:16:50,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:50,068 INFO ]: With dead ends: 65 [2018-06-22 11:16:50,068 INFO ]: Without dead ends: 65 [2018-06-22 11:16:50,068 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:50,068 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:16:50,073 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-06-22 11:16:50,073 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:16:50,073 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2018-06-22 11:16:50,074 INFO ]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 21 [2018-06-22 11:16:50,074 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:50,074 INFO ]: Abstraction has 55 states and 84 transitions. [2018-06-22 11:16:50,074 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:16:50,074 INFO ]: Start isEmpty. Operand 55 states and 84 transitions. [2018-06-22 11:16:50,075 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:16:50,075 INFO ]: Found error trace [2018-06-22 11:16:50,075 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:50,075 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:50,075 INFO ]: Analyzing trace with hash 1784977287, now seen corresponding path program 1 times [2018-06-22 11:16:50,075 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:50,075 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:50,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:50,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,079 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,130 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:16:50,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:50,130 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:16:50,130 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:16:50,130 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:16:50,130 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:50,130 INFO ]: Start difference. First operand 55 states and 84 transitions. Second operand 7 states. [2018-06-22 11:16:50,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:50,204 INFO ]: Finished difference Result 65 states and 95 transitions. [2018-06-22 11:16:50,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:16:50,204 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:16:50,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:50,205 INFO ]: With dead ends: 65 [2018-06-22 11:16:50,205 INFO ]: Without dead ends: 65 [2018-06-22 11:16:50,205 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:50,205 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 11:16:50,212 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-06-22 11:16:50,212 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:16:50,213 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-06-22 11:16:50,213 INFO ]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-06-22 11:16:50,213 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:50,213 INFO ]: Abstraction has 47 states and 73 transitions. [2018-06-22 11:16:50,213 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:16:50,213 INFO ]: Start isEmpty. Operand 47 states and 73 transitions. [2018-06-22 11:16:50,214 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:50,214 INFO ]: Found error trace [2018-06-22 11:16:50,214 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:50,214 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:50,214 INFO ]: Analyzing trace with hash -739350585, now seen corresponding path program 2 times [2018-06-22 11:16:50,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:50,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:50,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:50,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,223 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,589 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:50,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:50,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:50,595 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:50,608 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:50,608 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,610 INFO ]: Computing forward predicates... [2018-06-22 11:16:50,624 INFO ]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:50,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:50,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:16:50,643 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:16:50,643 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:16:50,643 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:50,644 INFO ]: Start difference. First operand 47 states and 73 transitions. Second operand 9 states. [2018-06-22 11:16:50,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:50,857 INFO ]: Finished difference Result 57 states and 84 transitions. [2018-06-22 11:16:50,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:16:50,857 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:16:50,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:50,858 INFO ]: With dead ends: 57 [2018-06-22 11:16:50,858 INFO ]: Without dead ends: 57 [2018-06-22 11:16:50,858 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:16:50,858 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:16:50,861 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:16:50,861 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:16:50,862 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2018-06-22 11:16:50,862 INFO ]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 25 [2018-06-22 11:16:50,862 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:50,862 INFO ]: Abstraction has 53 states and 79 transitions. [2018-06-22 11:16:50,862 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:16:50,862 INFO ]: Start isEmpty. Operand 53 states and 79 transitions. [2018-06-22 11:16:50,863 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:50,863 INFO ]: Found error trace [2018-06-22 11:16:50,863 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:50,863 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:50,863 INFO ]: Analyzing trace with hash 319099043, now seen corresponding path program 3 times [2018-06-22 11:16:50,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:50,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:50,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,864 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:50,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:50,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,945 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:50,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:50,946 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:50,951 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:50,975 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:16:50,975 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:50,977 INFO ]: Computing forward predicates... [2018-06-22 11:16:50,999 INFO ]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:51,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:51,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:16:51,019 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:16:51,019 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:16:51,019 INFO ]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:16:51,019 INFO ]: Start difference. First operand 53 states and 79 transitions. Second operand 10 states. [2018-06-22 11:16:51,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:51,538 INFO ]: Finished difference Result 61 states and 89 transitions. [2018-06-22 11:16:51,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:16:51,539 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:16:51,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:51,539 INFO ]: With dead ends: 61 [2018-06-22 11:16:51,539 INFO ]: Without dead ends: 61 [2018-06-22 11:16:51,539 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:51,539 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 11:16:51,542 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 47. [2018-06-22 11:16:51,542 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-22 11:16:51,543 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-06-22 11:16:51,543 INFO ]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 25 [2018-06-22 11:16:51,543 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:51,543 INFO ]: Abstraction has 47 states and 73 transitions. [2018-06-22 11:16:51,543 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:16:51,543 INFO ]: Start isEmpty. Operand 47 states and 73 transitions. [2018-06-22 11:16:51,544 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:51,544 INFO ]: Found error trace [2018-06-22 11:16:51,544 INFO ]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:51,544 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:51,544 INFO ]: Analyzing trace with hash 384084612, now seen corresponding path program 3 times [2018-06-22 11:16:51,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:51,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:51,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:51,544 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:51,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:51,550 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:51,589 INFO ]: Checked inductivity of 33 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:16:51,589 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:51,589 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:51,596 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:51,633 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:16:51,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:51,635 INFO ]: Computing forward predicates... [2018-06-22 11:16:51,914 INFO ]: Checked inductivity of 33 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:16:51,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:51,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-22 11:16:51,935 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:16:51,936 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:16:51,936 INFO ]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:16:51,936 INFO ]: Start difference. First operand 47 states and 73 transitions. Second operand 16 states. [2018-06-22 11:16:52,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:52,370 INFO ]: Finished difference Result 79 states and 118 transitions. [2018-06-22 11:16:52,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:16:52,371 INFO ]: Start accepts. Automaton has 16 states. Word has length 25 [2018-06-22 11:16:52,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:52,371 INFO ]: With dead ends: 79 [2018-06-22 11:16:52,371 INFO ]: Without dead ends: 79 [2018-06-22 11:16:52,372 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:52,372 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:16:52,376 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-06-22 11:16:52,376 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 11:16:52,377 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2018-06-22 11:16:52,377 INFO ]: Start accepts. Automaton has 67 states and 105 transitions. Word has length 25 [2018-06-22 11:16:52,377 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:52,377 INFO ]: Abstraction has 67 states and 105 transitions. [2018-06-22 11:16:52,377 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:16:52,377 INFO ]: Start isEmpty. Operand 67 states and 105 transitions. [2018-06-22 11:16:52,378 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:52,378 INFO ]: Found error trace [2018-06-22 11:16:52,378 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:52,378 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:52,378 INFO ]: Analyzing trace with hash 1442534240, now seen corresponding path program 4 times [2018-06-22 11:16:52,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:52,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:52,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:52,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:52,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:52,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,219 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:16:53,219 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:53,219 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:16:53,234 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:53,262 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:53,262 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,264 INFO ]: Computing forward predicates... [2018-06-22 11:16:53,288 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:16:53,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:53,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:16:53,318 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:16:53,318 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:16:53,318 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:53,318 INFO ]: Start difference. First operand 67 states and 105 transitions. Second operand 9 states. [2018-06-22 11:16:53,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:53,557 INFO ]: Finished difference Result 71 states and 110 transitions. [2018-06-22 11:16:53,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:16:53,558 INFO ]: Start accepts. Automaton has 9 states. Word has length 25 [2018-06-22 11:16:53,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:53,559 INFO ]: With dead ends: 71 [2018-06-22 11:16:53,559 INFO ]: Without dead ends: 71 [2018-06-22 11:16:53,559 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:16:53,559 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:16:53,563 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 11:16:53,563 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:16:53,564 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2018-06-22 11:16:53,564 INFO ]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 25 [2018-06-22 11:16:53,564 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:53,564 INFO ]: Abstraction has 69 states and 108 transitions. [2018-06-22 11:16:53,564 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:16:53,564 INFO ]: Start isEmpty. Operand 69 states and 108 transitions. [2018-06-22 11:16:53,565 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:53,565 INFO ]: Found error trace [2018-06-22 11:16:53,565 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:53,565 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:53,566 INFO ]: Analyzing trace with hash -462859514, now seen corresponding path program 1 times [2018-06-22 11:16:53,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:53,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:53,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,568 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:53,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,572 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,636 INFO ]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:16:53,636 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:53,636 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:16:53,636 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:16:53,636 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:16:53,636 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:53,636 INFO ]: Start difference. First operand 69 states and 108 transitions. Second operand 4 states. [2018-06-22 11:16:53,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:53,645 INFO ]: Finished difference Result 71 states and 112 transitions. [2018-06-22 11:16:53,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:16:53,645 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:16:53,646 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:53,646 INFO ]: With dead ends: 71 [2018-06-22 11:16:53,646 INFO ]: Without dead ends: 71 [2018-06-22 11:16:53,646 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:16:53,646 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:16:53,649 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-06-22 11:16:53,650 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-22 11:16:53,650 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2018-06-22 11:16:53,650 INFO ]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 25 [2018-06-22 11:16:53,650 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:53,650 INFO ]: Abstraction has 69 states and 107 transitions. [2018-06-22 11:16:53,650 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:16:53,650 INFO ]: Start isEmpty. Operand 69 states and 107 transitions. [2018-06-22 11:16:53,651 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:53,651 INFO ]: Found error trace [2018-06-22 11:16:53,651 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:53,651 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:53,651 INFO ]: Analyzing trace with hash 1278807011, now seen corresponding path program 1 times [2018-06-22 11:16:53,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:53,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:53,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:53,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,791 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:16:53,791 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:16:53,791 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:16:53,791 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:16:53,792 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:16:53,792 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:16:53,792 INFO ]: Start difference. First operand 69 states and 107 transitions. Second operand 6 states. [2018-06-22 11:16:53,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:53,830 INFO ]: Finished difference Result 81 states and 121 transitions. [2018-06-22 11:16:53,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:16:53,831 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:16:53,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:53,832 INFO ]: With dead ends: 81 [2018-06-22 11:16:53,832 INFO ]: Without dead ends: 81 [2018-06-22 11:16:53,832 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:53,832 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 11:16:53,835 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-06-22 11:16:53,835 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:16:53,835 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2018-06-22 11:16:53,835 INFO ]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 25 [2018-06-22 11:16:53,836 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:53,836 INFO ]: Abstraction has 77 states and 115 transitions. [2018-06-22 11:16:53,836 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:16:53,836 INFO ]: Start isEmpty. Operand 77 states and 115 transitions. [2018-06-22 11:16:53,837 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:53,837 INFO ]: Found error trace [2018-06-22 11:16:53,837 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:53,837 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:53,837 INFO ]: Analyzing trace with hash -713449738, now seen corresponding path program 1 times [2018-06-22 11:16:53,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:53,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:53,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:53,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:53,842 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,876 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:16:53,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:53,876 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:53,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:53,896 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:53,898 INFO ]: Computing forward predicates... [2018-06-22 11:16:53,979 INFO ]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:16:54,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:54,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:16:54,006 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:16:54,006 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:16:54,006 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:16:54,006 INFO ]: Start difference. First operand 77 states and 115 transitions. Second operand 14 states. [2018-06-22 11:16:54,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:54,353 INFO ]: Finished difference Result 93 states and 140 transitions. [2018-06-22 11:16:54,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:16:54,354 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:16:54,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:54,355 INFO ]: With dead ends: 93 [2018-06-22 11:16:54,355 INFO ]: Without dead ends: 93 [2018-06-22 11:16:54,355 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:16:54,355 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:16:54,361 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 79. [2018-06-22 11:16:54,361 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:16:54,362 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2018-06-22 11:16:54,362 INFO ]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 25 [2018-06-22 11:16:54,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:54,362 INFO ]: Abstraction has 79 states and 117 transitions. [2018-06-22 11:16:54,362 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:16:54,362 INFO ]: Start isEmpty. Operand 79 states and 117 transitions. [2018-06-22 11:16:54,363 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:16:54,363 INFO ]: Found error trace [2018-06-22 11:16:54,363 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:54,363 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:54,363 INFO ]: Analyzing trace with hash 2021139602, now seen corresponding path program 1 times [2018-06-22 11:16:54,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:54,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:54,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,364 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:54,364 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,368 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,430 INFO ]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:54,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:54,430 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:54,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:54,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,446 INFO ]: Computing forward predicates... [2018-06-22 11:16:54,453 INFO ]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:16:54,472 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:54,472 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:16:54,472 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:16:54,472 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:16:54,472 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:16:54,473 INFO ]: Start difference. First operand 79 states and 117 transitions. Second operand 7 states. [2018-06-22 11:16:54,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:54,538 INFO ]: Finished difference Result 91 states and 131 transitions. [2018-06-22 11:16:54,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:16:54,538 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:16:54,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:54,539 INFO ]: With dead ends: 91 [2018-06-22 11:16:54,539 INFO ]: Without dead ends: 91 [2018-06-22 11:16:54,539 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:16:54,539 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-22 11:16:54,546 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-06-22 11:16:54,546 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:16:54,547 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2018-06-22 11:16:54,547 INFO ]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 25 [2018-06-22 11:16:54,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:54,547 INFO ]: Abstraction has 79 states and 116 transitions. [2018-06-22 11:16:54,547 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:16:54,547 INFO ]: Start isEmpty. Operand 79 states and 116 transitions. [2018-06-22 11:16:54,550 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:54,550 INFO ]: Found error trace [2018-06-22 11:16:54,550 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:54,550 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:54,550 INFO ]: Analyzing trace with hash -876626026, now seen corresponding path program 4 times [2018-06-22 11:16:54,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:54,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:54,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:16:54,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:54,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:54,991 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:16:54,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:54,991 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:55,003 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:16:55,030 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:55,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:55,032 INFO ]: Computing forward predicates... [2018-06-22 11:16:55,167 INFO ]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:16:55,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:55,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-06-22 11:16:55,187 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:16:55,187 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:16:55,187 INFO ]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:55,187 INFO ]: Start difference. First operand 79 states and 116 transitions. Second operand 18 states. [2018-06-22 11:16:55,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:55,823 INFO ]: Finished difference Result 101 states and 144 transitions. [2018-06-22 11:16:55,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:16:55,823 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:16:55,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:55,823 INFO ]: With dead ends: 101 [2018-06-22 11:16:55,823 INFO ]: Without dead ends: 101 [2018-06-22 11:16:55,824 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:16:55,824 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 11:16:55,830 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 77. [2018-06-22 11:16:55,830 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:16:55,831 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2018-06-22 11:16:55,831 INFO ]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 29 [2018-06-22 11:16:55,831 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:55,831 INFO ]: Abstraction has 77 states and 112 transitions. [2018-06-22 11:16:55,831 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:16:55,832 INFO ]: Start isEmpty. Operand 77 states and 112 transitions. [2018-06-22 11:16:55,832 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:55,832 INFO ]: Found error trace [2018-06-22 11:16:55,833 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:55,833 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:55,833 INFO ]: Analyzing trace with hash -70154697, now seen corresponding path program 4 times [2018-06-22 11:16:55,833 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:55,833 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:55,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:55,834 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:55,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:55,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:55,969 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:55,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:55,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:55,975 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:16:56,007 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:16:56,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:56,009 INFO ]: Computing forward predicates... [2018-06-22 11:16:56,030 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:56,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:56,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 11:16:56,052 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:16:56,052 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:16:56,052 INFO ]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:16:56,052 INFO ]: Start difference. First operand 77 states and 112 transitions. Second operand 9 states. [2018-06-22 11:16:56,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:56,141 INFO ]: Finished difference Result 83 states and 121 transitions. [2018-06-22 11:16:56,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:16:56,141 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 11:16:56,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:56,142 INFO ]: With dead ends: 83 [2018-06-22 11:16:56,142 INFO ]: Without dead ends: 83 [2018-06-22 11:16:56,142 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:16:56,142 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 11:16:56,146 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-06-22 11:16:56,146 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:16:56,147 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2018-06-22 11:16:56,147 INFO ]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 29 [2018-06-22 11:16:56,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:56,147 INFO ]: Abstraction has 79 states and 114 transitions. [2018-06-22 11:16:56,147 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:16:56,147 INFO ]: Start isEmpty. Operand 79 states and 114 transitions. [2018-06-22 11:16:56,148 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:56,148 INFO ]: Found error trace [2018-06-22 11:16:56,150 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:56,150 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:56,150 INFO ]: Analyzing trace with hash 707806995, now seen corresponding path program 5 times [2018-06-22 11:16:56,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:56,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:56,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:56,150 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:56,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:56,156 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:56,235 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:16:56,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:56,235 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:56,243 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:16:56,261 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:16:56,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:56,262 INFO ]: Computing forward predicates... [2018-06-22 11:16:56,277 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:16:56,296 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:56,296 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:16:56,297 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:16:56,297 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:16:56,297 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:16:56,297 INFO ]: Start difference. First operand 79 states and 114 transitions. Second operand 10 states. [2018-06-22 11:16:56,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:56,541 INFO ]: Finished difference Result 87 states and 126 transitions. [2018-06-22 11:16:56,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:16:56,542 INFO ]: Start accepts. Automaton has 10 states. Word has length 29 [2018-06-22 11:16:56,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:56,542 INFO ]: With dead ends: 87 [2018-06-22 11:16:56,542 INFO ]: Without dead ends: 87 [2018-06-22 11:16:56,542 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:16:56,542 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-22 11:16:56,547 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-06-22 11:16:56,547 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:16:56,547 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2018-06-22 11:16:56,547 INFO ]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 29 [2018-06-22 11:16:56,548 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:56,548 INFO ]: Abstraction has 79 states and 114 transitions. [2018-06-22 11:16:56,548 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:16:56,548 INFO ]: Start isEmpty. Operand 79 states and 114 transitions. [2018-06-22 11:16:56,549 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:16:56,549 INFO ]: Found error trace [2018-06-22 11:16:56,549 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:56,549 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:56,549 INFO ]: Analyzing trace with hash 600577577, now seen corresponding path program 2 times [2018-06-22 11:16:56,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:56,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:56,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:56,550 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:56,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:56,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:56,642 INFO ]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:56,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:56,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:56,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:16:56,661 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:16:56,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:56,662 INFO ]: Computing forward predicates... [2018-06-22 11:16:56,812 INFO ]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:16:56,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:56,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:16:56,831 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:16:56,831 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:16:56,831 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:16:56,831 INFO ]: Start difference. First operand 79 states and 114 transitions. Second operand 18 states. [2018-06-22 11:16:57,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:57,620 INFO ]: Finished difference Result 93 states and 132 transitions. [2018-06-22 11:16:57,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:16:57,620 INFO ]: Start accepts. Automaton has 18 states. Word has length 29 [2018-06-22 11:16:57,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:57,621 INFO ]: With dead ends: 93 [2018-06-22 11:16:57,621 INFO ]: Without dead ends: 93 [2018-06-22 11:16:57,621 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:16:57,621 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:16:57,625 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 79. [2018-06-22 11:16:57,625 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:16:57,626 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2018-06-22 11:16:57,626 INFO ]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 29 [2018-06-22 11:16:57,626 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:57,626 INFO ]: Abstraction has 79 states and 112 transitions. [2018-06-22 11:16:57,626 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:16:57,626 INFO ]: Start isEmpty. Operand 79 states and 112 transitions. [2018-06-22 11:16:57,627 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:57,627 INFO ]: Found error trace [2018-06-22 11:16:57,627 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:57,627 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:57,627 INFO ]: Analyzing trace with hash -1642382647, now seen corresponding path program 5 times [2018-06-22 11:16:57,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:57,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:57,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:57,628 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:57,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:57,634 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:57,737 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:16:57,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:57,737 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:57,743 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:16:57,760 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:16:57,760 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:57,761 INFO ]: Computing forward predicates... [2018-06-22 11:16:57,886 INFO ]: Checked inductivity of 55 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:16:57,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:57,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-06-22 11:16:57,904 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:16:57,904 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:16:57,904 INFO ]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:16:57,905 INFO ]: Start difference. First operand 79 states and 112 transitions. Second operand 20 states. [2018-06-22 11:16:58,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:58,255 INFO ]: Finished difference Result 113 states and 158 transitions. [2018-06-22 11:16:58,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:16:58,255 INFO ]: Start accepts. Automaton has 20 states. Word has length 33 [2018-06-22 11:16:58,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:58,256 INFO ]: With dead ends: 113 [2018-06-22 11:16:58,256 INFO ]: Without dead ends: 113 [2018-06-22 11:16:58,256 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:16:58,256 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 11:16:58,261 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 81. [2018-06-22 11:16:58,261 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 11:16:58,262 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2018-06-22 11:16:58,262 INFO ]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 33 [2018-06-22 11:16:58,262 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:58,262 INFO ]: Abstraction has 81 states and 115 transitions. [2018-06-22 11:16:58,262 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:16:58,262 INFO ]: Start isEmpty. Operand 81 states and 115 transitions. [2018-06-22 11:16:58,265 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:58,265 INFO ]: Found error trace [2018-06-22 11:16:58,265 INFO ]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:58,265 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:58,265 INFO ]: Analyzing trace with hash 306209261, now seen corresponding path program 3 times [2018-06-22 11:16:58,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:58,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:58,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:58,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:58,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:58,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:58,465 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:58,465 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:58,465 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:58,470 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:16:58,487 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:16:58,487 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:58,488 INFO ]: Computing forward predicates... [2018-06-22 11:16:58,503 INFO ]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:16:58,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:58,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:16:58,522 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:16:58,522 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:16:58,522 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:58,522 INFO ]: Start difference. First operand 81 states and 115 transitions. Second operand 11 states. [2018-06-22 11:16:58,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:58,748 INFO ]: Finished difference Result 93 states and 131 transitions. [2018-06-22 11:16:58,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:16:58,748 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:16:58,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:58,748 INFO ]: With dead ends: 93 [2018-06-22 11:16:58,748 INFO ]: Without dead ends: 93 [2018-06-22 11:16:58,748 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:16:58,749 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:16:58,753 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-06-22 11:16:58,753 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:16:58,753 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2018-06-22 11:16:58,753 INFO ]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 33 [2018-06-22 11:16:58,753 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:58,753 INFO ]: Abstraction has 75 states and 109 transitions. [2018-06-22 11:16:58,753 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:16:58,753 INFO ]: Start isEmpty. Operand 75 states and 109 transitions. [2018-06-22 11:16:58,754 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:58,754 INFO ]: Found error trace [2018-06-22 11:16:58,754 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:58,754 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:58,755 INFO ]: Analyzing trace with hash -1767047638, now seen corresponding path program 5 times [2018-06-22 11:16:58,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:58,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:58,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:58,755 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:58,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:58,762 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:58,904 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:16:58,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:58,904 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:58,911 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:16:58,930 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:16:58,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:58,932 INFO ]: Computing forward predicates... [2018-06-22 11:16:58,946 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:16:58,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:58,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-22 11:16:58,964 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:16:58,964 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:16:58,964 INFO ]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:16:58,965 INFO ]: Start difference. First operand 75 states and 109 transitions. Second operand 10 states. [2018-06-22 11:16:59,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:59,042 INFO ]: Finished difference Result 93 states and 131 transitions. [2018-06-22 11:16:59,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:16:59,042 INFO ]: Start accepts. Automaton has 10 states. Word has length 33 [2018-06-22 11:16:59,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:59,042 INFO ]: With dead ends: 93 [2018-06-22 11:16:59,043 INFO ]: Without dead ends: 93 [2018-06-22 11:16:59,043 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:16:59,043 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:16:59,046 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-06-22 11:16:59,046 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-22 11:16:59,047 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2018-06-22 11:16:59,047 INFO ]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 33 [2018-06-22 11:16:59,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:59,047 INFO ]: Abstraction has 87 states and 121 transitions. [2018-06-22 11:16:59,047 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:16:59,047 INFO ]: Start isEmpty. Operand 87 states and 121 transitions. [2018-06-22 11:16:59,047 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:59,047 INFO ]: Found error trace [2018-06-22 11:16:59,047 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:59,047 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:59,047 INFO ]: Analyzing trace with hash 579327750, now seen corresponding path program 6 times [2018-06-22 11:16:59,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:59,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:59,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:59,048 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:59,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:59,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:59,361 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:59,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:16:59,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:16:59,367 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:16:59,398 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:16:59,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:16:59,399 INFO ]: Computing forward predicates... [2018-06-22 11:16:59,417 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:16:59,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:16:59,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:16:59,435 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:16:59,435 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:16:59,435 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:16:59,436 INFO ]: Start difference. First operand 87 states and 121 transitions. Second operand 11 states. [2018-06-22 11:16:59,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:16:59,539 INFO ]: Finished difference Result 97 states and 136 transitions. [2018-06-22 11:16:59,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:16:59,539 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:16:59,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:16:59,540 INFO ]: With dead ends: 97 [2018-06-22 11:16:59,540 INFO ]: Without dead ends: 97 [2018-06-22 11:16:59,540 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:16:59,540 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-22 11:16:59,543 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-06-22 11:16:59,543 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:16:59,544 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2018-06-22 11:16:59,544 INFO ]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 33 [2018-06-22 11:16:59,544 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:16:59,544 INFO ]: Abstraction has 77 states and 111 transitions. [2018-06-22 11:16:59,544 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:16:59,544 INFO ]: Start isEmpty. Operand 77 states and 111 transitions. [2018-06-22 11:16:59,545 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:16:59,545 INFO ]: Found error trace [2018-06-22 11:16:59,545 INFO ]: trace histogram [5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:16:59,545 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:16:59,545 INFO ]: Analyzing trace with hash 1984711068, now seen corresponding path program 3 times [2018-06-22 11:16:59,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:16:59,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:16:59,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:59,546 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:16:59,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:16:59,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:00,307 INFO ]: Checked inductivity of 36 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:17:00,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:00,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:00,314 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:17:00,332 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:17:00,332 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:00,333 INFO ]: Computing forward predicates... [2018-06-22 11:17:00,340 INFO ]: Checked inductivity of 36 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:17:00,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:00,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:17:00,358 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:17:00,359 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:17:00,359 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:00,359 INFO ]: Start difference. First operand 77 states and 111 transitions. Second operand 11 states. [2018-06-22 11:17:00,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:00,479 INFO ]: Finished difference Result 93 states and 131 transitions. [2018-06-22 11:17:00,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:17:00,479 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-22 11:17:00,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:00,480 INFO ]: With dead ends: 93 [2018-06-22 11:17:00,480 INFO ]: Without dead ends: 93 [2018-06-22 11:17:00,480 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:17:00,480 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-22 11:17:00,484 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 79. [2018-06-22 11:17:00,484 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:17:00,485 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2018-06-22 11:17:00,485 INFO ]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 33 [2018-06-22 11:17:00,485 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:00,485 INFO ]: Abstraction has 79 states and 113 transitions. [2018-06-22 11:17:00,485 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:17:00,485 INFO ]: Start isEmpty. Operand 79 states and 113 transitions. [2018-06-22 11:17:00,486 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:00,486 INFO ]: Found error trace [2018-06-22 11:17:00,486 INFO ]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:00,486 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:00,486 INFO ]: Analyzing trace with hash -1495006880, now seen corresponding path program 4 times [2018-06-22 11:17:00,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:00,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:00,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:00,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:00,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:00,494 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:00,635 INFO ]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:17:00,635 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:00,635 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:00,640 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:17:00,658 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:17:00,658 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:00,660 INFO ]: Computing forward predicates... [2018-06-22 11:17:00,793 INFO ]: Checked inductivity of 73 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:17:00,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:00,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:17:00,812 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:17:00,812 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:17:00,813 INFO ]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:00,813 INFO ]: Start difference. First operand 79 states and 113 transitions. Second operand 22 states. [2018-06-22 11:17:01,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:01,540 INFO ]: Finished difference Result 125 states and 172 transitions. [2018-06-22 11:17:01,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:17:01,540 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:17:01,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:01,541 INFO ]: With dead ends: 125 [2018-06-22 11:17:01,541 INFO ]: Without dead ends: 125 [2018-06-22 11:17:01,541 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=2047, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:17:01,541 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:17:01,546 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 105. [2018-06-22 11:17:01,546 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 11:17:01,547 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2018-06-22 11:17:01,547 INFO ]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 37 [2018-06-22 11:17:01,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:01,547 INFO ]: Abstraction has 105 states and 148 transitions. [2018-06-22 11:17:01,547 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:17:01,547 INFO ]: Start isEmpty. Operand 105 states and 148 transitions. [2018-06-22 11:17:01,548 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:01,548 INFO ]: Found error trace [2018-06-22 11:17:01,548 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:01,548 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:01,549 INFO ]: Analyzing trace with hash -999361988, now seen corresponding path program 6 times [2018-06-22 11:17:01,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:01,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:01,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:01,549 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:01,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:01,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:01,794 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:17:01,794 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:01,794 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:01,800 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:17:01,821 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:17:01,821 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:01,823 INFO ]: Computing forward predicates... [2018-06-22 11:17:01,849 INFO ]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:17:01,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:01,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:17:01,876 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:17:01,876 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:17:01,876 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:17:01,876 INFO ]: Start difference. First operand 105 states and 148 transitions. Second operand 13 states. [2018-06-22 11:17:02,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:02,011 INFO ]: Finished difference Result 117 states and 165 transitions. [2018-06-22 11:17:02,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:17:02,011 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 11:17:02,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:02,011 INFO ]: With dead ends: 117 [2018-06-22 11:17:02,011 INFO ]: Without dead ends: 117 [2018-06-22 11:17:02,012 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:17:02,012 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:17:02,018 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-06-22 11:17:02,019 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-22 11:17:02,020 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2018-06-22 11:17:02,020 INFO ]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2018-06-22 11:17:02,020 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:02,020 INFO ]: Abstraction has 93 states and 136 transitions. [2018-06-22 11:17:02,020 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:17:02,020 INFO ]: Start isEmpty. Operand 93 states and 136 transitions. [2018-06-22 11:17:02,021 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:02,021 INFO ]: Found error trace [2018-06-22 11:17:02,021 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:02,021 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:02,021 INFO ]: Analyzing trace with hash -1030061475, now seen corresponding path program 6 times [2018-06-22 11:17:02,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:02,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:02,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:02,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:02,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:02,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:02,380 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:17:02,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:02,413 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:02,418 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:17:02,440 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:17:02,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:02,441 INFO ]: Computing forward predicates... [2018-06-22 11:17:02,466 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:17:02,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:02,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:17:02,498 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:17:02,498 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:17:02,498 INFO ]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:02,498 INFO ]: Start difference. First operand 93 states and 136 transitions. Second operand 11 states. [2018-06-22 11:17:02,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:02,650 INFO ]: Finished difference Result 113 states and 160 transitions. [2018-06-22 11:17:02,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:17:02,650 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-22 11:17:02,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:02,651 INFO ]: With dead ends: 113 [2018-06-22 11:17:02,651 INFO ]: Without dead ends: 113 [2018-06-22 11:17:02,651 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:17:02,651 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 11:17:02,655 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-06-22 11:17:02,655 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 11:17:02,656 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-06-22 11:17:02,656 INFO ]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 37 [2018-06-22 11:17:02,656 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:02,656 INFO ]: Abstraction has 107 states and 150 transitions. [2018-06-22 11:17:02,656 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:17:02,657 INFO ]: Start isEmpty. Operand 107 states and 150 transitions. [2018-06-22 11:17:02,657 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:02,657 INFO ]: Found error trace [2018-06-22 11:17:02,657 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:02,658 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:02,658 INFO ]: Analyzing trace with hash -534416583, now seen corresponding path program 7 times [2018-06-22 11:17:02,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:02,658 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:02,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:02,658 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:02,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:02,667 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:02,785 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:17:02,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:02,785 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:02,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:02,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:02,810 INFO ]: Computing forward predicates... [2018-06-22 11:17:02,820 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:17:02,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:02,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:17:02,840 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:17:02,840 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:17:02,840 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:17:02,840 INFO ]: Start difference. First operand 107 states and 150 transitions. Second operand 12 states. [2018-06-22 11:17:03,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:03,544 INFO ]: Finished difference Result 117 states and 165 transitions. [2018-06-22 11:17:03,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:17:03,545 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 11:17:03,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:03,546 INFO ]: With dead ends: 117 [2018-06-22 11:17:03,546 INFO ]: Without dead ends: 117 [2018-06-22 11:17:03,546 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:17:03,546 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 11:17:03,551 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 95. [2018-06-22 11:17:03,551 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 11:17:03,552 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2018-06-22 11:17:03,552 INFO ]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 37 [2018-06-22 11:17:03,552 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:03,552 INFO ]: Abstraction has 95 states and 138 transitions. [2018-06-22 11:17:03,552 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:17:03,552 INFO ]: Start isEmpty. Operand 95 states and 138 transitions. [2018-06-22 11:17:03,553 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:03,553 INFO ]: Found error trace [2018-06-22 11:17:03,553 INFO ]: trace histogram [5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:03,553 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:03,553 INFO ]: Analyzing trace with hash -203789757, now seen corresponding path program 1 times [2018-06-22 11:17:03,553 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:03,553 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:03,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:03,554 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,558 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:03,581 INFO ]: Checked inductivity of 42 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:17:03,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:03,581 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:03,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:03,601 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:03,602 INFO ]: Computing forward predicates... [2018-06-22 11:17:03,605 INFO ]: Checked inductivity of 42 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:17:03,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:03,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:17:03,624 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:03,624 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:03,625 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:03,625 INFO ]: Start difference. First operand 95 states and 138 transitions. Second operand 4 states. [2018-06-22 11:17:03,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:03,667 INFO ]: Finished difference Result 101 states and 140 transitions. [2018-06-22 11:17:03,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 11:17:03,668 INFO ]: Start accepts. Automaton has 4 states. Word has length 37 [2018-06-22 11:17:03,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:03,668 INFO ]: With dead ends: 101 [2018-06-22 11:17:03,668 INFO ]: Without dead ends: 101 [2018-06-22 11:17:03,669 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:03,669 INFO ]: Start minimizeSevpa. Operand 101 states. [2018-06-22 11:17:03,675 INFO ]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-06-22 11:17:03,675 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:17:03,676 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-06-22 11:17:03,676 INFO ]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 37 [2018-06-22 11:17:03,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:03,676 INFO ]: Abstraction has 99 states and 138 transitions. [2018-06-22 11:17:03,676 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:03,676 INFO ]: Start isEmpty. Operand 99 states and 138 transitions. [2018-06-22 11:17:03,677 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:17:03,677 INFO ]: Found error trace [2018-06-22 11:17:03,677 INFO ]: trace histogram [6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:03,677 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:03,677 INFO ]: Analyzing trace with hash -1193957041, now seen corresponding path program 4 times [2018-06-22 11:17:03,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:03,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:03,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:03,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:03,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:03,927 INFO ]: Checked inductivity of 54 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:17:03,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:03,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:03,932 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:17:03,960 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:17:03,960 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:03,961 INFO ]: Computing forward predicates... [2018-06-22 11:17:04,129 INFO ]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:17:04,148 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:04,148 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-22 11:17:04,148 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:17:04,148 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:17:04,148 INFO ]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:04,148 INFO ]: Start difference. First operand 99 states and 138 transitions. Second operand 22 states. [2018-06-22 11:17:04,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:04,984 INFO ]: Finished difference Result 121 states and 160 transitions. [2018-06-22 11:17:04,984 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:17:04,984 INFO ]: Start accepts. Automaton has 22 states. Word has length 37 [2018-06-22 11:17:04,984 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:04,985 INFO ]: With dead ends: 121 [2018-06-22 11:17:04,985 INFO ]: Without dead ends: 121 [2018-06-22 11:17:04,985 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=2022, Unknown=0, NotChecked=0, Total=2352 [2018-06-22 11:17:04,986 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:17:04,990 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-06-22 11:17:04,990 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:17:04,991 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 138 transitions. [2018-06-22 11:17:04,991 INFO ]: Start accepts. Automaton has 101 states and 138 transitions. Word has length 37 [2018-06-22 11:17:04,991 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:04,991 INFO ]: Abstraction has 101 states and 138 transitions. [2018-06-22 11:17:04,991 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:17:04,991 INFO ]: Start isEmpty. Operand 101 states and 138 transitions. [2018-06-22 11:17:04,992 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:04,992 INFO ]: Found error trace [2018-06-22 11:17:04,992 INFO ]: trace histogram [8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:04,992 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:04,992 INFO ]: Analyzing trace with hash 1321684243, now seen corresponding path program 5 times [2018-06-22 11:17:04,992 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:04,992 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:04,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:04,993 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:04,993 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:05,000 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:05,089 INFO ]: Checked inductivity of 99 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:17:05,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:05,089 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:05,094 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:17:05,117 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:17:05,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:05,118 INFO ]: Computing forward predicates... [2018-06-22 11:17:05,242 INFO ]: Checked inductivity of 99 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 11:17:05,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:05,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 11:17:05,260 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:17:05,260 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:17:05,261 INFO ]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:17:05,261 INFO ]: Start difference. First operand 101 states and 138 transitions. Second operand 24 states. [2018-06-22 11:17:06,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:06,011 INFO ]: Finished difference Result 141 states and 183 transitions. [2018-06-22 11:17:06,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-22 11:17:06,011 INFO ]: Start accepts. Automaton has 24 states. Word has length 41 [2018-06-22 11:17:06,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:06,012 INFO ]: With dead ends: 141 [2018-06-22 11:17:06,012 INFO ]: Without dead ends: 141 [2018-06-22 11:17:06,013 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=510, Invalid=2570, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:17:06,013 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:17:06,018 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-06-22 11:17:06,018 INFO ]: Start removeUnreachable. Operand 123 states. [2018-06-22 11:17:06,019 INFO ]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2018-06-22 11:17:06,019 INFO ]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 41 [2018-06-22 11:17:06,019 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:06,019 INFO ]: Abstraction has 123 states and 165 transitions. [2018-06-22 11:17:06,019 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:17:06,019 INFO ]: Start isEmpty. Operand 123 states and 165 transitions. [2018-06-22 11:17:06,020 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:06,020 INFO ]: Found error trace [2018-06-22 11:17:06,020 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:06,020 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:06,020 INFO ]: Analyzing trace with hash -130656785, now seen corresponding path program 7 times [2018-06-22 11:17:06,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:06,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:06,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:06,021 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:06,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:06,028 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:06,337 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:17:06,338 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:06,338 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:06,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:06,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:06,368 INFO ]: Computing forward predicates... [2018-06-22 11:17:06,391 INFO ]: Checked inductivity of 105 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 11:17:06,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:06,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:17:06,424 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:17:06,424 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:17:06,424 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:17:06,424 INFO ]: Start difference. First operand 123 states and 165 transitions. Second operand 12 states. [2018-06-22 11:17:06,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:06,556 INFO ]: Finished difference Result 145 states and 189 transitions. [2018-06-22 11:17:06,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:17:06,557 INFO ]: Start accepts. Automaton has 12 states. Word has length 41 [2018-06-22 11:17:06,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:06,558 INFO ]: With dead ends: 145 [2018-06-22 11:17:06,558 INFO ]: Without dead ends: 145 [2018-06-22 11:17:06,558 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:17:06,558 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 11:17:06,564 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 109. [2018-06-22 11:17:06,564 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-22 11:17:06,565 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2018-06-22 11:17:06,565 INFO ]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 41 [2018-06-22 11:17:06,565 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:06,565 INFO ]: Abstraction has 109 states and 150 transitions. [2018-06-22 11:17:06,565 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:17:06,565 INFO ]: Start isEmpty. Operand 109 states and 150 transitions. [2018-06-22 11:17:06,566 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:06,566 INFO ]: Found error trace [2018-06-22 11:17:06,566 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:06,566 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:06,566 INFO ]: Analyzing trace with hash 1457619664, now seen corresponding path program 7 times [2018-06-22 11:17:06,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:06,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:06,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:06,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:06,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:06,578 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:07,053 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:17:07,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:07,053 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:07,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:07,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:07,079 INFO ]: Computing forward predicates... [2018-06-22 11:17:07,093 INFO ]: Checked inductivity of 129 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:17:07,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:07,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-22 11:17:07,111 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:17:07,111 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:17:07,111 INFO ]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:17:07,111 INFO ]: Start difference. First operand 109 states and 150 transitions. Second operand 12 states. [2018-06-22 11:17:07,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:07,219 INFO ]: Finished difference Result 125 states and 166 transitions. [2018-06-22 11:17:07,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:17:07,219 INFO ]: Start accepts. Automaton has 12 states. Word has length 41 [2018-06-22 11:17:07,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:07,220 INFO ]: With dead ends: 125 [2018-06-22 11:17:07,220 INFO ]: Without dead ends: 125 [2018-06-22 11:17:07,220 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:17:07,220 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:17:07,226 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-06-22 11:17:07,226 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 11:17:07,227 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2018-06-22 11:17:07,227 INFO ]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 41 [2018-06-22 11:17:07,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:07,228 INFO ]: Abstraction has 125 states and 166 transitions. [2018-06-22 11:17:07,228 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:17:07,228 INFO ]: Start isEmpty. Operand 125 states and 166 transitions. [2018-06-22 11:17:07,229 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:07,229 INFO ]: Found error trace [2018-06-22 11:17:07,229 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:07,229 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:07,229 INFO ]: Analyzing trace with hash 5278636, now seen corresponding path program 8 times [2018-06-22 11:17:07,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:07,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:07,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:07,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:07,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:07,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:07,518 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:17:07,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:07,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:07,625 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:07,645 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:07,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:07,647 INFO ]: Computing forward predicates... [2018-06-22 11:17:07,672 INFO ]: Checked inductivity of 136 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-22 11:17:07,693 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:07,693 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:17:07,693 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:17:07,693 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:17:07,693 INFO ]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:17:07,693 INFO ]: Start difference. First operand 125 states and 166 transitions. Second operand 13 states. [2018-06-22 11:17:07,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:07,873 INFO ]: Finished difference Result 149 states and 193 transitions. [2018-06-22 11:17:07,874 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:17:07,874 INFO ]: Start accepts. Automaton has 13 states. Word has length 41 [2018-06-22 11:17:07,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:07,875 INFO ]: With dead ends: 149 [2018-06-22 11:17:07,875 INFO ]: Without dead ends: 149 [2018-06-22 11:17:07,875 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:17:07,875 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-22 11:17:07,882 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 143. [2018-06-22 11:17:07,882 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-22 11:17:07,883 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2018-06-22 11:17:07,883 INFO ]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 41 [2018-06-22 11:17:07,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:07,883 INFO ]: Abstraction has 143 states and 185 transitions. [2018-06-22 11:17:07,883 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:17:07,883 INFO ]: Start isEmpty. Operand 143 states and 185 transitions. [2018-06-22 11:17:07,884 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:17:07,884 INFO ]: Found error trace [2018-06-22 11:17:07,884 INFO ]: trace histogram [7, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:07,884 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:07,884 INFO ]: Analyzing trace with hash -2056805054, now seen corresponding path program 5 times [2018-06-22 11:17:07,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:07,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:07,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:07,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:07,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:07,892 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:08,076 INFO ]: Checked inductivity of 76 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:17:08,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:08,076 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:08,082 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:17:08,106 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:17:08,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:08,107 INFO ]: Computing forward predicates... [2018-06-22 11:17:08,242 INFO ]: Checked inductivity of 76 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:17:08,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:08,261 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-22 11:17:08,261 INFO ]: Interpolant automaton has 24 states [2018-06-22 11:17:08,261 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-22 11:17:08,261 INFO ]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:17:08,262 INFO ]: Start difference. First operand 143 states and 185 transitions. Second operand 24 states. [2018-06-22 11:17:09,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:09,224 INFO ]: Finished difference Result 149 states and 192 transitions. [2018-06-22 11:17:09,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:17:09,224 INFO ]: Start accepts. Automaton has 24 states. Word has length 41 [2018-06-22 11:17:09,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:09,225 INFO ]: With dead ends: 149 [2018-06-22 11:17:09,225 INFO ]: Without dead ends: 149 [2018-06-22 11:17:09,225 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=437, Invalid=2643, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:17:09,225 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-22 11:17:09,228 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-06-22 11:17:09,228 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-22 11:17:09,229 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2018-06-22 11:17:09,229 INFO ]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 41 [2018-06-22 11:17:09,229 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:09,229 INFO ]: Abstraction has 145 states and 186 transitions. [2018-06-22 11:17:09,229 INFO ]: Interpolant automaton has 24 states. [2018-06-22 11:17:09,229 INFO ]: Start isEmpty. Operand 145 states and 186 transitions. [2018-06-22 11:17:09,229 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:17:09,229 INFO ]: Found error trace [2018-06-22 11:17:09,229 INFO ]: trace histogram [9, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:09,230 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:09,230 INFO ]: Analyzing trace with hash -1551256314, now seen corresponding path program 6 times [2018-06-22 11:17:09,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:09,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:09,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:09,230 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:09,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:09,237 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:09,487 INFO ]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:17:09,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:09,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:09,492 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:17:09,626 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-22 11:17:09,626 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:09,628 INFO ]: Computing forward predicates... [2018-06-22 11:17:09,698 INFO ]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-22 11:17:09,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:09,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-22 11:17:09,716 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:17:09,717 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:17:09,717 INFO ]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:17:09,717 INFO ]: Start difference. First operand 145 states and 186 transitions. Second operand 16 states. [2018-06-22 11:17:10,559 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:10,559 INFO ]: Finished difference Result 155 states and 199 transitions. [2018-06-22 11:17:10,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:17:10,559 INFO ]: Start accepts. Automaton has 16 states. Word has length 45 [2018-06-22 11:17:10,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:10,560 INFO ]: With dead ends: 155 [2018-06-22 11:17:10,560 INFO ]: Without dead ends: 155 [2018-06-22 11:17:10,560 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:17:10,560 INFO ]: Start minimizeSevpa. Operand 155 states. [2018-06-22 11:17:10,566 INFO ]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-06-22 11:17:10,566 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-22 11:17:10,567 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2018-06-22 11:17:10,567 INFO ]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 45 [2018-06-22 11:17:10,567 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:10,567 INFO ]: Abstraction has 151 states and 195 transitions. [2018-06-22 11:17:10,567 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:17:10,567 INFO ]: Start isEmpty. Operand 151 states and 195 transitions. [2018-06-22 11:17:10,568 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:17:10,568 INFO ]: Found error trace [2018-06-22 11:17:10,568 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:10,568 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:10,568 INFO ]: Analyzing trace with hash -1825469803, now seen corresponding path program 1 times [2018-06-22 11:17:10,568 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:10,568 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:10,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:10,569 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:10,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:10,578 INFO ]: Conjunction of SSA is sat [2018-06-22 11:17:10,582 INFO ]: Counterexample might be feasible [2018-06-22 11:17:10,601 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:10 BoogieIcfgContainer [2018-06-22 11:17:10,601 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:10,689 INFO ]: Toolchain (without parser) took 30664.65 ms. Allocated memory was 308.3 MB in the beginning and 653.3 MB in the end (delta: 345.0 MB). Free memory was 263.7 MB in the beginning and 634.0 MB in the end (delta: -370.3 MB). Peak memory consumption was 149.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:10,690 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:10,690 INFO ]: ChcToBoogie took 49.55 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:10,691 INFO ]: Boogie Preprocessor took 47.29 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:10,691 INFO ]: RCFGBuilder took 389.60 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 248.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:10,692 INFO ]: TraceAbstraction took 30077.89 ms. Allocated memory was 308.3 MB in the beginning and 530.6 MB in the end (delta: 222.3 MB). Free memory was 247.7 MB in the beginning and 339.4 MB in the end (delta: -91.8 MB). Peak memory consumption was 130.5 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:10,695 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.55 ms. Allocated memory is still 308.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.29 ms. Allocated memory is still 308.3 MB. Free memory was 260.7 MB in the beginning and 259.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 389.60 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 248.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30077.89 ms. Allocated memory was 308.3 MB in the beginning and 530.6 MB in the end (delta: 222.3 MB). Free memory was 247.7 MB in the beginning and 339.4 MB in the end (delta: -91.8 MB). Peak memory consumption was 130.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] CALL call REC_f_f(hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] CALL call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] CALL call REC_f_(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int); [L0] assume hhv_REC_f__1_Int == hhv_REC_f__0_Int && hhv_REC_f__0_Int <= 0; [L0] RET call REC_f_(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int); [L0] RET call REC_f_f(hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. UNSAFE Result, 30.0s OverallTime, 54 OverallIterations, 9 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2166 SDtfs, 400 SDslu, 11672 SDs, 0 SdLazy, 7741 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1985 GetRequests, 1182 SyntacticMatches, 0 SemanticMatches, 803 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3237 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=53, 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.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 498 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 173 NumberOfCheckSat, 2348 ConstructedInterpolants, 2 QuantifiedInterpolants, 182912 SizeOfPredicates, 287 NumberOfNonLiveVariables, 5580 ConjunctsInSsa, 596 ConjunctsInUnsatCore, 92 InterpolantComputations, 14 PerfectInterpolantSequences, 1955/3697 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-10-704.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014d-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-10-704.csv Received shutdown request...