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/011-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:13:44,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:13:44,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:13:44,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:13:44,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:13:44,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:13:44,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:13:44,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:13:44,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:13:44,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:13:44,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:13:44,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:13:44,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:13:44,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:13:44,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:13:44,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:13:44,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:13:44,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:13:44,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:13:44,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:13:44,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:13:44,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:13:44,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:13:44,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:13:44,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:13:44,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:13:44,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:13:44,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:13:44,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:13:44,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:13:44,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:13:44,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:13:44,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:13:44,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:13:44,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:13:44,055 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:13:44,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:13:44,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:13:44,073 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:13:44,074 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:13:44,077 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:13:44,077 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:13:44,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:13:44,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:13:44,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:13:44,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:13:44,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:13:44,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:13:44,078 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:13:44,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:13:44,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:13:44,079 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:13:44,079 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:13:44,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:13:44,079 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:13:44,085 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:13:44,086 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:13:44,137 INFO ]: Repository-Root is: /tmp [2018-06-22 11:13:44,151 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:13:44,157 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:13:44,158 INFO ]: Initializing SmtParser... [2018-06-22 11:13:44,159 INFO ]: SmtParser initialized [2018-06-22 11:13:44,159 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 [2018-06-22 11:13:44,161 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:13:44,253 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 unknown [2018-06-22 11:13:44,517 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011-horn.smt2 [2018-06-22 11:13:44,522 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:13:44,533 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:13:44,533 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:13:44,534 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:13:44,534 INFO ]: ChcToBoogie initialized [2018-06-22 11:13:44,537 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,583 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44 Unit [2018-06-22 11:13:44,583 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:13:44,583 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:13:44,584 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:13:44,584 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:13:44,603 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,603 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,612 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,621 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,627 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,635 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,636 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... [2018-06-22 11:13:44,647 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:13:44,648 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:13:44,648 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:13:44,648 INFO ]: RCFGBuilder initialized [2018-06-22 11:13:44,649 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:13:44,666 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:13:44,667 INFO ]: Found specification of procedure False [2018-06-22 11:13:44,667 INFO ]: Found implementation of procedure False [2018-06-22 11:13:44,667 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:13:44,667 INFO ]: Found specification of procedure REC__f [2018-06-22 11:13:44,667 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:13:44,667 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:13:44,667 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:13:44,667 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:13:44,667 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:13:44,667 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:13:44,667 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:13:44,667 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:13:44,667 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:13:44,667 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:13:45,181 INFO ]: Using library mode [2018-06-22 11:13:45,182 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:13:45 BoogieIcfgContainer [2018-06-22 11:13:45,182 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:13:45,185 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:13:45,185 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:13:45,191 INFO ]: TraceAbstraction initialized [2018-06-22 11:13:45,191 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:13:44" (1/3) ... [2018-06-22 11:13:45,192 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd174a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:13:45, skipping insertion in model container [2018-06-22 11:13:45,192 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:13:44" (2/3) ... [2018-06-22 11:13:45,193 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd174a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:13:45, skipping insertion in model container [2018-06-22 11:13:45,193 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:13:45" (3/3) ... [2018-06-22 11:13:45,194 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:13:45,204 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:13:45,214 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:13:45,262 INFO ]: Using default assertion order modulation [2018-06-22 11:13:45,262 INFO ]: Interprodecural is true [2018-06-22 11:13:45,262 INFO ]: Hoare is false [2018-06-22 11:13:45,262 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:13:45,262 INFO ]: Backedges is TWOTRACK [2018-06-22 11:13:45,262 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:13:45,262 INFO ]: Difference is false [2018-06-22 11:13:45,262 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:13:45,262 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:13:45,283 INFO ]: Start isEmpty. Operand 42 states. [2018-06-22 11:13:45,310 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:13:45,311 INFO ]: Found error trace [2018-06-22 11:13:45,311 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:13:45,312 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:45,318 INFO ]: Analyzing trace with hash 214646542, now seen corresponding path program 1 times [2018-06-22 11:13:45,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:45,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:45,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:45,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:45,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:45,378 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:45,400 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:13:45,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:45,404 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:13:45,405 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:13:45,421 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:13:45,421 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:13:45,424 INFO ]: Start difference. First operand 42 states. Second operand 2 states. [2018-06-22 11:13:45,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:45,450 INFO ]: Finished difference Result 36 states and 78 transitions. [2018-06-22 11:13:45,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:13:45,451 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:13:45,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:45,465 INFO ]: With dead ends: 36 [2018-06-22 11:13:45,465 INFO ]: Without dead ends: 36 [2018-06-22 11:13:45,469 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:13:45,484 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:45,510 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:13:45,511 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:45,513 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 78 transitions. [2018-06-22 11:13:45,515 INFO ]: Start accepts. Automaton has 36 states and 78 transitions. Word has length 5 [2018-06-22 11:13:45,515 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:45,515 INFO ]: Abstraction has 36 states and 78 transitions. [2018-06-22 11:13:45,515 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:13:45,515 INFO ]: Start isEmpty. Operand 36 states and 78 transitions. [2018-06-22 11:13:45,519 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:45,519 INFO ]: Found error trace [2018-06-22 11:13:45,519 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:45,519 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:45,519 INFO ]: Analyzing trace with hash -802889464, now seen corresponding path program 1 times [2018-06-22 11:13:45,519 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:45,519 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:45,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:45,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:45,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:45,543 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:45,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:13:45,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:45,601 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:45,603 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:45,603 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:45,603 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:45,603 INFO ]: Start difference. First operand 36 states and 78 transitions. Second operand 4 states. [2018-06-22 11:13:46,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:46,016 INFO ]: Finished difference Result 36 states and 77 transitions. [2018-06-22 11:13:46,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:46,017 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:46,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:46,019 INFO ]: With dead ends: 36 [2018-06-22 11:13:46,019 INFO ]: Without dead ends: 35 [2018-06-22 11:13:46,019 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:13:46,020 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:13:46,027 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:13:46,027 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:13:46,029 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2018-06-22 11:13:46,029 INFO ]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 9 [2018-06-22 11:13:46,029 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:46,029 INFO ]: Abstraction has 35 states and 75 transitions. [2018-06-22 11:13:46,029 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:46,029 INFO ]: Start isEmpty. Operand 35 states and 75 transitions. [2018-06-22 11:13:46,031 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:46,031 INFO ]: Found error trace [2018-06-22 11:13:46,031 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:46,032 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:46,032 INFO ]: Analyzing trace with hash 1312403030, now seen corresponding path program 1 times [2018-06-22 11:13:46,032 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:46,032 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:46,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:46,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,041 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:46,080 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:13:46,080 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:46,080 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:46,080 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:46,081 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:46,081 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:46,081 INFO ]: Start difference. First operand 35 states and 75 transitions. Second operand 4 states. [2018-06-22 11:13:46,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:46,250 INFO ]: Finished difference Result 37 states and 76 transitions. [2018-06-22 11:13:46,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:46,251 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:46,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:46,253 INFO ]: With dead ends: 37 [2018-06-22 11:13:46,253 INFO ]: Without dead ends: 36 [2018-06-22 11:13:46,254 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:13:46,254 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:46,269 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 11:13:46,269 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:13:46,275 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 72 transitions. [2018-06-22 11:13:46,276 INFO ]: Start accepts. Automaton has 34 states and 72 transitions. Word has length 9 [2018-06-22 11:13:46,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:46,276 INFO ]: Abstraction has 34 states and 72 transitions. [2018-06-22 11:13:46,276 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:46,276 INFO ]: Start isEmpty. Operand 34 states and 72 transitions. [2018-06-22 11:13:46,277 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:46,277 INFO ]: Found error trace [2018-06-22 11:13:46,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:46,278 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:46,278 INFO ]: Analyzing trace with hash -620535529, now seen corresponding path program 1 times [2018-06-22 11:13:46,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:46,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:46,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:46,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,291 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:46,312 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:13:46,312 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:46,312 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:46,312 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:46,313 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:46,313 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:46,313 INFO ]: Start difference. First operand 34 states and 72 transitions. Second operand 4 states. [2018-06-22 11:13:46,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:46,493 INFO ]: Finished difference Result 38 states and 82 transitions. [2018-06-22 11:13:46,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:46,494 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:46,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:46,495 INFO ]: With dead ends: 38 [2018-06-22 11:13:46,495 INFO ]: Without dead ends: 38 [2018-06-22 11:13:46,496 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:13:46,496 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:13:46,514 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-06-22 11:13:46,514 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:46,515 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2018-06-22 11:13:46,515 INFO ]: Start accepts. Automaton has 36 states and 80 transitions. Word has length 9 [2018-06-22 11:13:46,516 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:46,516 INFO ]: Abstraction has 36 states and 80 transitions. [2018-06-22 11:13:46,516 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:46,516 INFO ]: Start isEmpty. Operand 36 states and 80 transitions. [2018-06-22 11:13:46,520 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:46,520 INFO ]: Found error trace [2018-06-22 11:13:46,520 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:46,520 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:46,520 INFO ]: Analyzing trace with hash -276985717, now seen corresponding path program 1 times [2018-06-22 11:13:46,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:46,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:46,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,521 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:46,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,529 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:46,641 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:13:46,641 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:46,641 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:46,641 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:46,641 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:46,641 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:46,642 INFO ]: Start difference. First operand 36 states and 80 transitions. Second operand 4 states. [2018-06-22 11:13:46,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:46,721 INFO ]: Finished difference Result 40 states and 90 transitions. [2018-06-22 11:13:46,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:46,722 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:46,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:46,723 INFO ]: With dead ends: 40 [2018-06-22 11:13:46,723 INFO ]: Without dead ends: 40 [2018-06-22 11:13:46,723 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:13:46,723 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:13:46,731 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-22 11:13:46,731 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:46,733 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 80 transitions. [2018-06-22 11:13:46,733 INFO ]: Start accepts. Automaton has 36 states and 80 transitions. Word has length 9 [2018-06-22 11:13:46,733 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:46,733 INFO ]: Abstraction has 36 states and 80 transitions. [2018-06-22 11:13:46,733 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:46,733 INFO ]: Start isEmpty. Operand 36 states and 80 transitions. [2018-06-22 11:13:46,734 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:46,734 INFO ]: Found error trace [2018-06-22 11:13:46,734 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:46,734 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:46,734 INFO ]: Analyzing trace with hash 92172180, now seen corresponding path program 1 times [2018-06-22 11:13:46,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:46,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:46,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,735 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:46,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,740 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:46,774 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:13:46,774 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:46,774 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:46,774 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:46,774 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:46,774 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:46,774 INFO ]: Start difference. First operand 36 states and 80 transitions. Second operand 4 states. [2018-06-22 11:13:46,943 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:46,943 INFO ]: Finished difference Result 36 states and 78 transitions. [2018-06-22 11:13:46,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:46,943 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:46,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:46,944 INFO ]: With dead ends: 36 [2018-06-22 11:13:46,944 INFO ]: Without dead ends: 35 [2018-06-22 11:13:46,945 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:13:46,945 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:13:46,952 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:13:46,952 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:13:46,956 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 76 transitions. [2018-06-22 11:13:46,956 INFO ]: Start accepts. Automaton has 35 states and 76 transitions. Word has length 9 [2018-06-22 11:13:46,956 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:46,956 INFO ]: Abstraction has 35 states and 76 transitions. [2018-06-22 11:13:46,956 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:46,956 INFO ]: Start isEmpty. Operand 35 states and 76 transitions. [2018-06-22 11:13:46,957 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:13:46,957 INFO ]: Found error trace [2018-06-22 11:13:46,957 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:46,957 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:46,957 INFO ]: Analyzing trace with hash -1515597173, now seen corresponding path program 1 times [2018-06-22 11:13:46,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:46,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:46,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:46,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:46,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,115 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:13:47,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:47,115 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:47,115 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:47,115 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:47,115 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:47,116 INFO ]: Start difference. First operand 35 states and 76 transitions. Second operand 4 states. [2018-06-22 11:13:47,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:47,266 INFO ]: Finished difference Result 39 states and 83 transitions. [2018-06-22 11:13:47,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:47,266 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:13:47,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:47,267 INFO ]: With dead ends: 39 [2018-06-22 11:13:47,267 INFO ]: Without dead ends: 39 [2018-06-22 11:13:47,268 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:13:47,268 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:13:47,273 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:13:47,273 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:13:47,274 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 81 transitions. [2018-06-22 11:13:47,274 INFO ]: Start accepts. Automaton has 37 states and 81 transitions. Word has length 9 [2018-06-22 11:13:47,274 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:47,274 INFO ]: Abstraction has 37 states and 81 transitions. [2018-06-22 11:13:47,274 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:47,274 INFO ]: Start isEmpty. Operand 37 states and 81 transitions. [2018-06-22 11:13:47,275 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:47,275 INFO ]: Found error trace [2018-06-22 11:13:47,275 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:47,275 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:47,275 INFO ]: Analyzing trace with hash 156941051, now seen corresponding path program 1 times [2018-06-22 11:13:47,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:47,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:47,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:47,276 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,337 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:13:47,338 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:47,338 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:47,338 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:47,338 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:47,338 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:47,338 INFO ]: Start difference. First operand 37 states and 81 transitions. Second operand 4 states. [2018-06-22 11:13:47,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:47,409 INFO ]: Finished difference Result 41 states and 93 transitions. [2018-06-22 11:13:47,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:47,486 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:47,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:47,487 INFO ]: With dead ends: 41 [2018-06-22 11:13:47,487 INFO ]: Without dead ends: 41 [2018-06-22 11:13:47,487 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:13:47,488 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:13:47,494 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-06-22 11:13:47,494 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:13:47,496 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 86 transitions. [2018-06-22 11:13:47,496 INFO ]: Start accepts. Automaton has 39 states and 86 transitions. Word has length 13 [2018-06-22 11:13:47,496 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:47,496 INFO ]: Abstraction has 39 states and 86 transitions. [2018-06-22 11:13:47,496 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:47,496 INFO ]: Start isEmpty. Operand 39 states and 86 transitions. [2018-06-22 11:13:47,497 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:47,497 INFO ]: Found error trace [2018-06-22 11:13:47,497 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:47,497 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:47,497 INFO ]: Analyzing trace with hash -404171409, now seen corresponding path program 1 times [2018-06-22 11:13:47,497 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:47,497 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:47,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:47,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,531 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:13:47,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:47,531 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:47,531 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:47,531 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:47,531 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:47,532 INFO ]: Start difference. First operand 39 states and 86 transitions. Second operand 4 states. [2018-06-22 11:13:47,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:47,566 INFO ]: Finished difference Result 41 states and 92 transitions. [2018-06-22 11:13:47,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:47,567 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:47,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:47,568 INFO ]: With dead ends: 41 [2018-06-22 11:13:47,568 INFO ]: Without dead ends: 40 [2018-06-22 11:13:47,568 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:13:47,568 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:13:47,573 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-22 11:13:47,573 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:13:47,574 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2018-06-22 11:13:47,574 INFO ]: Start accepts. Automaton has 36 states and 76 transitions. Word has length 13 [2018-06-22 11:13:47,574 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:47,574 INFO ]: Abstraction has 36 states and 76 transitions. [2018-06-22 11:13:47,574 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:47,574 INFO ]: Start isEmpty. Operand 36 states and 76 transitions. [2018-06-22 11:13:47,575 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:47,575 INFO ]: Found error trace [2018-06-22 11:13:47,575 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:47,575 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:47,575 INFO ]: Analyzing trace with hash 2054779232, now seen corresponding path program 1 times [2018-06-22 11:13:47,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:47,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:47,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:47,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:47,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,634 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:13:47,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:47,634 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:13:47,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:47,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:47,681 INFO ]: Computing forward predicates... [2018-06-22 11:13:47,841 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:13:47,876 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:47,876 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:13:47,876 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:13:47,877 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:13:47,877 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:13:47,877 INFO ]: Start difference. First operand 36 states and 76 transitions. Second operand 8 states. [2018-06-22 11:13:48,732 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:48,732 INFO ]: Finished difference Result 46 states and 102 transitions. [2018-06-22 11:13:48,733 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:13:48,733 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:13:48,733 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:48,734 INFO ]: With dead ends: 46 [2018-06-22 11:13:48,734 INFO ]: Without dead ends: 46 [2018-06-22 11:13:48,734 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:48,734 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:13:48,746 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-06-22 11:13:48,746 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:48,746 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2018-06-22 11:13:48,747 INFO ]: Start accepts. Automaton has 38 states and 81 transitions. Word has length 13 [2018-06-22 11:13:48,747 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:48,747 INFO ]: Abstraction has 38 states and 81 transitions. [2018-06-22 11:13:48,747 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:13:48,747 INFO ]: Start isEmpty. Operand 38 states and 81 transitions. [2018-06-22 11:13:48,748 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:48,748 INFO ]: Found error trace [2018-06-22 11:13:48,748 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:48,748 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:48,748 INFO ]: Analyzing trace with hash -1815159939, now seen corresponding path program 1 times [2018-06-22 11:13:48,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:48,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:48,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:48,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:48,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:48,755 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:48,795 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:13:48,795 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:48,795 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:48,795 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:48,795 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:48,795 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:48,795 INFO ]: Start difference. First operand 38 states and 81 transitions. Second operand 4 states. [2018-06-22 11:13:48,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:48,953 INFO ]: Finished difference Result 42 states and 91 transitions. [2018-06-22 11:13:48,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:48,954 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:48,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:48,955 INFO ]: With dead ends: 42 [2018-06-22 11:13:48,955 INFO ]: Without dead ends: 42 [2018-06-22 11:13:48,955 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:13:48,955 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:48,961 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-06-22 11:13:48,961 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:13:48,962 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2018-06-22 11:13:48,962 INFO ]: Start accepts. Automaton has 38 states and 81 transitions. Word has length 13 [2018-06-22 11:13:48,962 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:48,962 INFO ]: Abstraction has 38 states and 81 transitions. [2018-06-22 11:13:48,962 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:48,962 INFO ]: Start isEmpty. Operand 38 states and 81 transitions. [2018-06-22 11:13:48,963 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:48,963 INFO ]: Found error trace [2018-06-22 11:13:48,963 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:48,963 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:48,963 INFO ]: Analyzing trace with hash 222248219, now seen corresponding path program 1 times [2018-06-22 11:13:48,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:48,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:48,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:48,966 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:48,966 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:48,971 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,022 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:13:49,022 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:49,022 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:49,022 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:49,022 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:49,023 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:49,023 INFO ]: Start difference. First operand 38 states and 81 transitions. Second operand 4 states. [2018-06-22 11:13:49,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:49,130 INFO ]: Finished difference Result 40 states and 84 transitions. [2018-06-22 11:13:49,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:49,131 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:49,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:49,132 INFO ]: With dead ends: 40 [2018-06-22 11:13:49,132 INFO ]: Without dead ends: 39 [2018-06-22 11:13:49,132 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:13:49,132 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:13:49,140 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-06-22 11:13:49,140 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:13:49,141 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 77 transitions. [2018-06-22 11:13:49,141 INFO ]: Start accepts. Automaton has 37 states and 77 transitions. Word has length 13 [2018-06-22 11:13:49,141 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:49,141 INFO ]: Abstraction has 37 states and 77 transitions. [2018-06-22 11:13:49,141 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:49,141 INFO ]: Start isEmpty. Operand 37 states and 77 transitions. [2018-06-22 11:13:49,142 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:49,142 INFO ]: Found error trace [2018-06-22 11:13:49,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:49,142 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:49,142 INFO ]: Analyzing trace with hash -23002634, now seen corresponding path program 1 times [2018-06-22 11:13:49,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:49,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:49,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:49,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,184 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:13:49,184 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:49,184 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:49,185 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:49,185 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:49,185 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:49,185 INFO ]: Start difference. First operand 37 states and 77 transitions. Second operand 4 states. [2018-06-22 11:13:49,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:49,206 INFO ]: Finished difference Result 39 states and 79 transitions. [2018-06-22 11:13:49,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:49,207 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:13:49,207 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:49,208 INFO ]: With dead ends: 39 [2018-06-22 11:13:49,208 INFO ]: Without dead ends: 37 [2018-06-22 11:13:49,208 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:13:49,208 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:13:49,210 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-06-22 11:13:49,210 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:13:49,211 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2018-06-22 11:13:49,211 INFO ]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 13 [2018-06-22 11:13:49,211 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:49,211 INFO ]: Abstraction has 35 states and 72 transitions. [2018-06-22 11:13:49,211 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:49,211 INFO ]: Start isEmpty. Operand 35 states and 72 transitions. [2018-06-22 11:13:49,212 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:13:49,212 INFO ]: Found error trace [2018-06-22 11:13:49,212 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:49,212 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:49,212 INFO ]: Analyzing trace with hash -584115094, now seen corresponding path program 1 times [2018-06-22 11:13:49,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:49,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:49,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:49,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,450 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:13:49,450 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:49,450 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:13:49,450 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:13:49,450 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:13:49,450 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:13:49,451 INFO ]: Start difference. First operand 35 states and 72 transitions. Second operand 6 states. [2018-06-22 11:13:49,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:49,780 INFO ]: Finished difference Result 47 states and 104 transitions. [2018-06-22 11:13:49,780 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:49,780 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:13:49,780 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:49,781 INFO ]: With dead ends: 47 [2018-06-22 11:13:49,781 INFO ]: Without dead ends: 47 [2018-06-22 11:13:49,781 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:13:49,781 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:13:49,786 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-06-22 11:13:49,786 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:13:49,787 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 78 transitions. [2018-06-22 11:13:49,787 INFO ]: Start accepts. Automaton has 37 states and 78 transitions. Word has length 13 [2018-06-22 11:13:49,788 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:49,788 INFO ]: Abstraction has 37 states and 78 transitions. [2018-06-22 11:13:49,788 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:13:49,788 INFO ]: Start isEmpty. Operand 37 states and 78 transitions. [2018-06-22 11:13:49,788 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:49,788 INFO ]: Found error trace [2018-06-22 11:13:49,788 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:49,789 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:49,789 INFO ]: Analyzing trace with hash -1857707026, now seen corresponding path program 1 times [2018-06-22 11:13:49,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:49,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:49,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:49,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,797 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,828 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:49,828 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:49,828 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:49,828 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:49,828 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:49,828 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:49,828 INFO ]: Start difference. First operand 37 states and 78 transitions. Second operand 4 states. [2018-06-22 11:13:49,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:49,873 INFO ]: Finished difference Result 37 states and 72 transitions. [2018-06-22 11:13:49,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:49,875 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:49,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:49,876 INFO ]: With dead ends: 37 [2018-06-22 11:13:49,876 INFO ]: Without dead ends: 35 [2018-06-22 11:13:49,876 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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:13:49,876 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:13:49,879 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:13:49,879 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:13:49,880 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 68 transitions. [2018-06-22 11:13:49,880 INFO ]: Start accepts. Automaton has 35 states and 68 transitions. Word has length 17 [2018-06-22 11:13:49,880 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:49,880 INFO ]: Abstraction has 35 states and 68 transitions. [2018-06-22 11:13:49,880 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:49,880 INFO ]: Start isEmpty. Operand 35 states and 68 transitions. [2018-06-22 11:13:49,881 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:49,881 INFO ]: Found error trace [2018-06-22 11:13:49,881 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:49,881 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:49,881 INFO ]: Analyzing trace with hash 1328703312, now seen corresponding path program 1 times [2018-06-22 11:13:49,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:49,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:49,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,882 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:49,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:49,889 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:49,953 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:49,953 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:49,954 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:49,954 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:49,954 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:49,954 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:49,954 INFO ]: Start difference. First operand 35 states and 68 transitions. Second operand 4 states. [2018-06-22 11:13:50,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:50,005 INFO ]: Finished difference Result 35 states and 65 transitions. [2018-06-22 11:13:50,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:50,006 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:50,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:50,007 INFO ]: With dead ends: 35 [2018-06-22 11:13:50,007 INFO ]: Without dead ends: 34 [2018-06-22 11:13:50,007 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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:13:50,007 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:13:50,010 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:13:50,010 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:13:50,011 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-06-22 11:13:50,011 INFO ]: Start accepts. Automaton has 34 states and 63 transitions. Word has length 17 [2018-06-22 11:13:50,011 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:50,011 INFO ]: Abstraction has 34 states and 63 transitions. [2018-06-22 11:13:50,011 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:50,011 INFO ]: Start isEmpty. Operand 34 states and 63 transitions. [2018-06-22 11:13:50,011 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:50,011 INFO ]: Found error trace [2018-06-22 11:13:50,011 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:50,011 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:50,012 INFO ]: Analyzing trace with hash 91076853, now seen corresponding path program 2 times [2018-06-22 11:13:50,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:50,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:50,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:50,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:50,012 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:50,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:50,090 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:50,091 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:50,091 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) [2018-06-22 11:13:50,107 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:13:50,123 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:50,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:50,125 INFO ]: Computing forward predicates... [2018-06-22 11:13:50,218 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:13:50,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:50,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:13:50,241 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:13:50,241 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:13:50,241 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:50,241 INFO ]: Start difference. First operand 34 states and 63 transitions. Second operand 12 states. [2018-06-22 11:13:50,914 WARN ]: Spent 193.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-06-22 11:13:50,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:50,918 INFO ]: Finished difference Result 52 states and 82 transitions. [2018-06-22 11:13:50,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:13:50,918 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:13:50,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:50,918 INFO ]: With dead ends: 52 [2018-06-22 11:13:50,918 INFO ]: Without dead ends: 25 [2018-06-22 11:13:50,919 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:13:50,919 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:13:50,921 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:13:50,921 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:13:50,921 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 11:13:50,921 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 17 [2018-06-22 11:13:50,922 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:50,922 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 11:13:50,922 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:13:50,922 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 11:13:50,922 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:50,922 INFO ]: Found error trace [2018-06-22 11:13:50,922 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:50,922 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:50,922 INFO ]: Analyzing trace with hash -1855665793, now seen corresponding path program 1 times [2018-06-22 11:13:50,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:50,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:50,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:50,923 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:50,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:50,933 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:51,011 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:13:51,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:51,011 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:13:51,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:51,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:51,032 INFO ]: Computing forward predicates... [2018-06-22 11:13:51,123 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:13:51,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:51,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:13:51,142 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:13:51,142 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:13:51,142 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:13:51,142 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 10 states. [2018-06-22 11:13:51,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:51,269 INFO ]: Finished difference Result 29 states and 43 transitions. [2018-06-22 11:13:51,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:13:51,269 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:13:51,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:51,269 INFO ]: With dead ends: 29 [2018-06-22 11:13:51,269 INFO ]: Without dead ends: 29 [2018-06-22 11:13:51,269 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:13:51,269 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:13:51,271 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:13:51,272 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:13:51,272 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-06-22 11:13:51,272 INFO ]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 17 [2018-06-22 11:13:51,272 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:51,272 INFO ]: Abstraction has 25 states and 38 transitions. [2018-06-22 11:13:51,272 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:13:51,272 INFO ]: Start isEmpty. Operand 25 states and 38 transitions. [2018-06-22 11:13:51,273 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:51,273 INFO ]: Found error trace [2018-06-22 11:13:51,273 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:51,273 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:51,273 INFO ]: Analyzing trace with hash 498487603, now seen corresponding path program 1 times [2018-06-22 11:13:51,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:51,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:51,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:51,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:51,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:51,278 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:51,296 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:13:51,296 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:51,296 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:51,296 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:51,296 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:51,296 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:51,296 INFO ]: Start difference. First operand 25 states and 38 transitions. Second operand 4 states. [2018-06-22 11:13:51,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:51,314 INFO ]: Finished difference Result 25 states and 36 transitions. [2018-06-22 11:13:51,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:51,314 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:13:51,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:51,315 INFO ]: With dead ends: 25 [2018-06-22 11:13:51,315 INFO ]: Without dead ends: 24 [2018-06-22 11:13:51,315 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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:13:51,315 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:13:51,316 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:13:51,316 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:13:51,317 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-22 11:13:51,317 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-06-22 11:13:51,317 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:51,317 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-22 11:13:51,317 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:51,317 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-22 11:13:51,317 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:13:51,317 INFO ]: Found error trace [2018-06-22 11:13:51,317 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:51,317 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:51,317 INFO ]: Analyzing trace with hash 1035619150, now seen corresponding path program 1 times [2018-06-22 11:13:51,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:51,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:51,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:51,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:51,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:51,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:51,411 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:13:51,411 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:51,411 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:13:51,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:51,433 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:51,435 INFO ]: Computing forward predicates... [2018-06-22 11:13:51,652 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:13:51,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:51,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:13:51,674 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:13:51,674 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:13:51,674 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:13:51,674 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2018-06-22 11:13:51,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:51,938 INFO ]: Finished difference Result 38 states and 52 transitions. [2018-06-22 11:13:51,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:13:51,938 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:13:51,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:51,938 INFO ]: With dead ends: 38 [2018-06-22 11:13:51,938 INFO ]: Without dead ends: 38 [2018-06-22 11:13:51,939 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:13:51,939 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:13:51,941 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-06-22 11:13:51,941 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:13:51,942 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-06-22 11:13:51,942 INFO ]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 17 [2018-06-22 11:13:51,942 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:51,942 INFO ]: Abstraction has 26 states and 39 transitions. [2018-06-22 11:13:51,942 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:13:51,942 INFO ]: Start isEmpty. Operand 26 states and 39 transitions. [2018-06-22 11:13:51,942 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:51,942 INFO ]: Found error trace [2018-06-22 11:13:51,942 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:51,942 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:51,942 INFO ]: Analyzing trace with hash 383749972, now seen corresponding path program 2 times [2018-06-22 11:13:51,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:51,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:51,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:51,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:51,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:51,950 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:52,016 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:52,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:52,016 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:13:52,030 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:52,049 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:52,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:52,051 INFO ]: Computing forward predicates... [2018-06-22 11:13:52,140 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:13:52,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:52,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-22 11:13:52,160 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:13:52,160 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:13:52,160 INFO ]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:13:52,160 INFO ]: Start difference. First operand 26 states and 39 transitions. Second operand 14 states. [2018-06-22 11:13:52,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:52,323 INFO ]: Finished difference Result 34 states and 48 transitions. [2018-06-22 11:13:52,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:13:52,323 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:13:52,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:52,323 INFO ]: With dead ends: 34 [2018-06-22 11:13:52,323 INFO ]: Without dead ends: 26 [2018-06-22 11:13:52,323 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:13:52,323 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:13:52,325 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:13:52,325 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:13:52,326 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-22 11:13:52,326 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 21 [2018-06-22 11:13:52,326 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:52,326 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-22 11:13:52,326 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:13:52,326 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-22 11:13:52,326 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:52,326 INFO ]: Found error trace [2018-06-22 11:13:52,326 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:13:52,326 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:52,326 INFO ]: Analyzing trace with hash 64739683, now seen corresponding path program 1 times [2018-06-22 11:13:52,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:52,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:52,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:52,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:52,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:52,334 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:52,461 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:13:52,461 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:52,485 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:13:52,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:52,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:52,506 INFO ]: Computing forward predicates... [2018-06-22 11:13:52,731 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:13:52,759 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:52,759 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:13:52,759 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:13:52,759 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:13:52,759 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:13:52,759 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 17 states. [2018-06-22 11:13:53,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:53,048 INFO ]: Finished difference Result 34 states and 46 transitions. [2018-06-22 11:13:53,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:13:53,051 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:13:53,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:53,051 INFO ]: With dead ends: 34 [2018-06-22 11:13:53,051 INFO ]: Without dead ends: 28 [2018-06-22 11:13:53,051 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:13:53,051 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:13:53,053 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:13:53,053 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:13:53,054 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-06-22 11:13:53,054 INFO ]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 21 [2018-06-22 11:13:53,054 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:53,054 INFO ]: Abstraction has 24 states and 33 transitions. [2018-06-22 11:13:53,054 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:13:53,054 INFO ]: Start isEmpty. Operand 24 states and 33 transitions. [2018-06-22 11:13:53,054 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:53,054 INFO ]: Found error trace [2018-06-22 11:13:53,054 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:13:53,054 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:53,055 INFO ]: Analyzing trace with hash 240306346, now seen corresponding path program 1 times [2018-06-22 11:13:53,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:53,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:53,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:53,055 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:53,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:53,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:53,106 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:13:53,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:13:53,106 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:13:53,107 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:13:53,107 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:13:53,107 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:13:53,107 INFO ]: Start difference. First operand 24 states and 33 transitions. Second operand 4 states. [2018-06-22 11:13:53,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:53,114 INFO ]: Finished difference Result 26 states and 35 transitions. [2018-06-22 11:13:53,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:13:53,115 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:13:53,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:53,115 INFO ]: With dead ends: 26 [2018-06-22 11:13:53,115 INFO ]: Without dead ends: 22 [2018-06-22 11:13:53,116 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:13:53,116 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:13:53,117 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:13:53,117 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:13:53,117 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-06-22 11:13:53,117 INFO ]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 21 [2018-06-22 11:13:53,117 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:53,117 INFO ]: Abstraction has 20 states and 23 transitions. [2018-06-22 11:13:53,117 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:13:53,117 INFO ]: Start isEmpty. Operand 20 states and 23 transitions. [2018-06-22 11:13:53,118 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:13:53,118 INFO ]: Found error trace [2018-06-22 11:13:53,118 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:53,118 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:53,118 INFO ]: Analyzing trace with hash -1349291726, now seen corresponding path program 2 times [2018-06-22 11:13:53,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:53,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:53,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:53,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:53,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:53,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:53,299 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:53,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:53,299 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:13:53,306 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:53,314 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:53,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:53,316 INFO ]: Computing forward predicates... [2018-06-22 11:13:53,733 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:13:53,752 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:53,752 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:13:53,752 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:13:53,752 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:13:53,752 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:13:53,753 INFO ]: Start difference. First operand 20 states and 23 transitions. Second operand 10 states. [2018-06-22 11:13:53,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:53,886 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-22 11:13:53,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:13:53,886 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-22 11:13:53,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:53,887 INFO ]: With dead ends: 22 [2018-06-22 11:13:53,887 INFO ]: Without dead ends: 22 [2018-06-22 11:13:53,887 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:13:53,887 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:13:53,888 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:13:53,888 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:13:53,889 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-22 11:13:53,889 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 21 [2018-06-22 11:13:53,889 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:53,889 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-22 11:13:53,889 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:13:53,889 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-22 11:13:53,889 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:13:53,889 INFO ]: Found error trace [2018-06-22 11:13:53,889 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:13:53,889 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:53,890 INFO ]: Analyzing trace with hash -1695932345, now seen corresponding path program 2 times [2018-06-22 11:13:53,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:53,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:53,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:53,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:53,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:53,897 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:54,089 INFO ]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:13:54,089 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:54,089 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:13:54,095 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:13:54,106 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:13:54,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:54,109 INFO ]: Computing forward predicates... [2018-06-22 11:13:54,406 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:13:54,425 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:54,425 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:13:54,425 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:13:54,425 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:13:54,426 INFO ]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:13:54,426 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 21 states. [2018-06-22 11:13:54,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:54,799 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-22 11:13:54,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:13:54,799 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:13:54,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:54,800 INFO ]: With dead ends: 30 [2018-06-22 11:13:54,800 INFO ]: Without dead ends: 30 [2018-06-22 11:13:54,800 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:13:54,800 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:13:54,802 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-22 11:13:54,802 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:13:54,802 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-06-22 11:13:54,802 INFO ]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 25 [2018-06-22 11:13:54,803 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:54,803 INFO ]: Abstraction has 24 states and 27 transitions. [2018-06-22 11:13:54,803 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:13:54,803 INFO ]: Start isEmpty. Operand 24 states and 27 transitions. [2018-06-22 11:13:54,803 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:13:54,803 INFO ]: Found error trace [2018-06-22 11:13:54,803 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:54,803 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:54,803 INFO ]: Analyzing trace with hash 61040668, now seen corresponding path program 3 times [2018-06-22 11:13:54,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:54,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:54,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:54,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:54,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:54,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:54,968 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:55,057 INFO ]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:55,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:55,057 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:13:55,063 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:13:55,112 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:13:55,112 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:55,115 INFO ]: Computing forward predicates... [2018-06-22 11:13:55,330 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:13:55,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:55,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 11:13:55,355 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:13:55,355 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:13:55,355 INFO ]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:13:55,355 INFO ]: Start difference. First operand 24 states and 27 transitions. Second operand 20 states. [2018-06-22 11:13:55,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:55,609 INFO ]: Finished difference Result 36 states and 40 transitions. [2018-06-22 11:13:55,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:13:55,610 INFO ]: Start accepts. Automaton has 20 states. Word has length 29 [2018-06-22 11:13:55,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:55,610 INFO ]: With dead ends: 36 [2018-06-22 11:13:55,610 INFO ]: Without dead ends: 26 [2018-06-22 11:13:55,610 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:13:55,610 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:13:55,612 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:13:55,612 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:13:55,612 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-06-22 11:13:55,612 INFO ]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2018-06-22 11:13:55,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:55,612 INFO ]: Abstraction has 26 states and 29 transitions. [2018-06-22 11:13:55,612 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:13:55,612 INFO ]: Start isEmpty. Operand 26 states and 29 transitions. [2018-06-22 11:13:55,613 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:13:55,613 INFO ]: Found error trace [2018-06-22 11:13:55,613 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:55,613 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:55,613 INFO ]: Analyzing trace with hash -506706176, now seen corresponding path program 4 times [2018-06-22 11:13:55,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:55,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:55,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:55,614 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:55,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:55,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:55,856 INFO ]: Checked inductivity of 31 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:13:55,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:55,856 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:13:55,861 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:13:55,875 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:13:55,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:55,879 INFO ]: Computing forward predicates... [2018-06-22 11:13:56,215 INFO ]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:13:56,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:56,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-06-22 11:13:56,244 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:13:56,244 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:13:56,244 INFO ]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:13:56,244 INFO ]: Start difference. First operand 26 states and 29 transitions. Second operand 25 states. [2018-06-22 11:13:56,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:56,605 INFO ]: Finished difference Result 36 states and 40 transitions. [2018-06-22 11:13:56,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:13:56,605 INFO ]: Start accepts. Automaton has 25 states. Word has length 33 [2018-06-22 11:13:56,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:56,606 INFO ]: With dead ends: 36 [2018-06-22 11:13:56,606 INFO ]: Without dead ends: 36 [2018-06-22 11:13:56,606 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:13:56,606 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:13:56,607 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 11:13:56,607 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:13:56,608 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-22 11:13:56,608 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 33 [2018-06-22 11:13:56,608 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:56,608 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-22 11:13:56,608 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:13:56,608 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-22 11:13:56,608 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:13:56,608 INFO ]: Found error trace [2018-06-22 11:13:56,608 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:56,608 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:56,608 INFO ]: Analyzing trace with hash 1501288597, now seen corresponding path program 5 times [2018-06-22 11:13:56,608 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:56,608 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:56,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:56,609 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:56,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:56,618 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:56,957 WARN ]: Spent 286.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:57,051 INFO ]: Checked inductivity of 42 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:13:57,051 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:57,051 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:13:57,056 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:13:57,075 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:13:57,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:57,079 INFO ]: Computing forward predicates... [2018-06-22 11:13:57,318 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:13:57,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:57,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-22 11:13:57,338 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:13:57,338 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:13:57,339 INFO ]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:13:57,339 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 23 states. [2018-06-22 11:13:57,625 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:57,625 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:13:57,625 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:13:57,625 INFO ]: Start accepts. Automaton has 23 states. Word has length 37 [2018-06-22 11:13:57,625 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:57,626 INFO ]: With dead ends: 42 [2018-06-22 11:13:57,626 INFO ]: Without dead ends: 30 [2018-06-22 11:13:57,626 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:13:57,626 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:13:57,627 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:13:57,627 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:13:57,627 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:13:57,627 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 37 [2018-06-22 11:13:57,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:57,627 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:13:57,627 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:13:57,627 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:13:57,628 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:13:57,628 INFO ]: Found error trace [2018-06-22 11:13:57,628 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:57,628 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:57,628 INFO ]: Analyzing trace with hash -1007235207, now seen corresponding path program 6 times [2018-06-22 11:13:57,628 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:57,628 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:57,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:57,629 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:57,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:57,638 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:57,841 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:13:57,987 INFO ]: Checked inductivity of 57 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:13:57,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:57,987 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:13:57,993 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:13:58,045 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-22 11:13:58,045 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:58,049 INFO ]: Computing forward predicates... [2018-06-22 11:13:58,441 INFO ]: Checked inductivity of 57 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:13:58,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:58,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-22 11:13:58,461 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:13:58,461 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:13:58,461 INFO ]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:13:58,461 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 29 states. [2018-06-22 11:13:59,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:59,013 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:13:59,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:13:59,013 INFO ]: Start accepts. Automaton has 29 states. Word has length 41 [2018-06-22 11:13:59,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:59,014 INFO ]: With dead ends: 42 [2018-06-22 11:13:59,014 INFO ]: Without dead ends: 42 [2018-06-22 11:13:59,014 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:13:59,014 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:13:59,016 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-06-22 11:13:59,016 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:13:59,017 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:13:59,017 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 41 [2018-06-22 11:13:59,017 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:13:59,017 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:13:59,017 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:13:59,017 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:13:59,017 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:13:59,017 INFO ]: Found error trace [2018-06-22 11:13:59,018 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:13:59,018 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:13:59,018 INFO ]: Analyzing trace with hash 1035418318, now seen corresponding path program 7 times [2018-06-22 11:13:59,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:13:59,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:13:59,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:59,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:13:59,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:13:59,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:59,208 WARN ]: Spent 114.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:13:59,325 INFO ]: Checked inductivity of 72 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:13:59,325 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:13:59,325 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:13:59,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:13:59,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:13:59,352 INFO ]: Computing forward predicates... [2018-06-22 11:13:59,569 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:13:59,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:13:59,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-06-22 11:13:59,588 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:13:59,589 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:13:59,589 INFO ]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:13:59,589 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 26 states. [2018-06-22 11:13:59,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:13:59,998 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-22 11:13:59,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:13:59,999 INFO ]: Start accepts. Automaton has 26 states. Word has length 45 [2018-06-22 11:13:59,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:13:59,999 INFO ]: With dead ends: 48 [2018-06-22 11:13:59,999 INFO ]: Without dead ends: 34 [2018-06-22 11:14:00,000 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:14:00,000 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:14:00,001 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:14:00,001 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:14:00,002 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:14:00,002 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 45 [2018-06-22 11:14:00,002 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:00,002 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:14:00,002 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:14:00,002 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:14:00,002 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:14:00,002 INFO ]: Found error trace [2018-06-22 11:14:00,002 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:00,002 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:00,003 INFO ]: Analyzing trace with hash -1772369486, now seen corresponding path program 8 times [2018-06-22 11:14:00,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:00,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:00,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:00,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:14:00,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:00,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:00,381 WARN ]: Spent 309.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:14:01,106 INFO ]: Checked inductivity of 91 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:14:01,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:01,106 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:14:01,114 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:14:01,137 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:14:01,137 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:01,141 INFO ]: Computing forward predicates... [2018-06-22 11:14:01,586 INFO ]: Checked inductivity of 91 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:14:01,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:01,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-06-22 11:14:01,607 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:14:01,607 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:14:01,607 INFO ]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:14:01,607 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 33 states. [2018-06-22 11:14:02,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:02,342 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-22 11:14:02,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:14:02,342 INFO ]: Start accepts. Automaton has 33 states. Word has length 49 [2018-06-22 11:14:02,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:02,343 INFO ]: With dead ends: 48 [2018-06-22 11:14:02,343 INFO ]: Without dead ends: 48 [2018-06-22 11:14:02,343 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:14:02,343 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:14:02,345 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-06-22 11:14:02,345 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:14:02,345 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:14:02,345 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 49 [2018-06-22 11:14:02,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:02,345 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:14:02,345 INFO ]: Interpolant automaton has 33 states. [2018-06-22 11:14:02,345 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:14:02,346 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:14:02,346 INFO ]: Found error trace [2018-06-22 11:14:02,346 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:02,347 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:02,347 INFO ]: Analyzing trace with hash 620994247, now seen corresponding path program 9 times [2018-06-22 11:14:02,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:02,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:02,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:02,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:02,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:02,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:02,738 INFO ]: Checked inductivity of 110 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:14:02,738 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:02,738 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:14:02,746 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:14:02,774 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-22 11:14:02,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:02,779 INFO ]: Computing forward predicates... [2018-06-22 11:14:03,827 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:14:03,951 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:14:03,970 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:03,970 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2018-06-22 11:14:03,970 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:14:03,970 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:14:03,971 INFO ]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:14:03,971 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 29 states. [2018-06-22 11:14:04,373 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:14:04,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:04,756 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-22 11:14:04,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:14:04,757 INFO ]: Start accepts. Automaton has 29 states. Word has length 53 [2018-06-22 11:14:04,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:04,757 INFO ]: With dead ends: 54 [2018-06-22 11:14:04,757 INFO ]: Without dead ends: 38 [2018-06-22 11:14:04,759 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:14:04,759 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:14:04,761 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:14:04,761 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:14:04,761 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:14:04,761 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 53 [2018-06-22 11:14:04,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:04,761 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:14:04,761 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:14:04,761 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:14:04,763 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:14:04,763 INFO ]: Found error trace [2018-06-22 11:14:04,763 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:04,763 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:04,763 INFO ]: Analyzing trace with hash -766949973, now seen corresponding path program 10 times [2018-06-22 11:14:04,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:04,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:04,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,763 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:04,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:04,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:05,146 WARN ]: Spent 302.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-06-22 11:14:05,428 INFO ]: Checked inductivity of 133 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:14:05,428 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:05,428 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:14:05,433 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:14:05,456 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:14:05,456 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:05,460 INFO ]: Computing forward predicates... [2018-06-22 11:14:05,967 INFO ]: Checked inductivity of 133 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:14:05,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:05,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-06-22 11:14:05,987 INFO ]: Interpolant automaton has 37 states [2018-06-22 11:14:05,987 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-22 11:14:05,987 INFO ]: CoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:14:05,988 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 37 states. [2018-06-22 11:14:06,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:06,639 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-22 11:14:06,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:14:06,639 INFO ]: Start accepts. Automaton has 37 states. Word has length 57 [2018-06-22 11:14:06,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:06,640 INFO ]: With dead ends: 54 [2018-06-22 11:14:06,640 INFO ]: Without dead ends: 54 [2018-06-22 11:14:06,641 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=359, Invalid=2833, Unknown=0, NotChecked=0, Total=3192 [2018-06-22 11:14:06,641 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 11:14:06,643 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-06-22 11:14:06,643 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:14:06,645 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 11:14:06,645 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 57 [2018-06-22 11:14:06,645 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:06,645 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 11:14:06,645 INFO ]: Interpolant automaton has 37 states. [2018-06-22 11:14:06,645 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 11:14:06,646 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:14:06,646 INFO ]: Found error trace [2018-06-22 11:14:06,646 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:06,646 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:06,646 INFO ]: Analyzing trace with hash 23794816, now seen corresponding path program 11 times [2018-06-22 11:14:06,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:06,646 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:06,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:06,646 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:06,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:06,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:07,056 WARN ]: Spent 325.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-06-22 11:14:07,234 INFO ]: Checked inductivity of 156 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:14:07,234 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:07,234 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:14:07,242 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:14:07,270 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-22 11:14:07,270 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:07,274 INFO ]: Computing forward predicates... [2018-06-22 11:14:07,667 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:14:07,750 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:14:07,750 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2018-06-22 11:14:07,750 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:14:07,750 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:14:07,750 INFO ]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:14:07,751 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 32 states. [2018-06-22 11:14:08,638 WARN ]: Spent 288.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-06-22 11:14:08,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:08,710 INFO ]: Finished difference Result 60 states and 64 transitions. [2018-06-22 11:14:08,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:14:08,710 INFO ]: Start accepts. Automaton has 32 states. Word has length 61 [2018-06-22 11:14:08,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:08,710 INFO ]: With dead ends: 60 [2018-06-22 11:14:08,710 INFO ]: Without dead ends: 42 [2018-06-22 11:14:08,711 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:14:08,711 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:14:08,713 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:14:08,713 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:14:08,713 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:14:08,713 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 61 [2018-06-22 11:14:08,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:08,715 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:14:08,715 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:14:08,715 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:14:08,716 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:14:08,716 INFO ]: Found error trace [2018-06-22 11:14:08,716 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:14:08,716 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:14:08,716 INFO ]: Analyzing trace with hash 1449743204, now seen corresponding path program 12 times [2018-06-22 11:14:08,716 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:14:08,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:14:08,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:08,717 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:14:08,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:14:08,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:09,040 INFO ]: Checked inductivity of 183 backedges. 42 proven. 62 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:14:09,040 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:14:09,040 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:14:09,046 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:14:09,076 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:14:09,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:14:09,082 INFO ]: Computing forward predicates... [2018-06-22 11:14:09,222 INFO ]: Checked inductivity of 183 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-06-22 11:14:09,241 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:14:09,241 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [22] total 28 [2018-06-22 11:14:09,242 INFO ]: Interpolant automaton has 28 states [2018-06-22 11:14:09,242 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-22 11:14:09,242 INFO ]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:14:09,242 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 28 states. [2018-06-22 11:14:09,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:14:09,911 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-22 11:14:09,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:14:09,912 INFO ]: Start accepts. Automaton has 28 states. Word has length 65 [2018-06-22 11:14:09,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:14:09,912 INFO ]: With dead ends: 40 [2018-06-22 11:14:09,912 INFO ]: Without dead ends: 0 [2018-06-22 11:14:09,912 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:14:09,912 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:14:09,912 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:14:09,912 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:14:09,912 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:14:09,912 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-06-22 11:14:09,912 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:14:09,912 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:14:09,912 INFO ]: Interpolant automaton has 28 states. [2018-06-22 11:14:09,912 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:14:09,912 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:14:10,010 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:14:10 BoogieIcfgContainer [2018-06-22 11:14:10,010 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:14:10,011 INFO ]: Toolchain (without parser) took 25488.38 ms. Allocated memory was 309.3 MB in the beginning and 623.9 MB in the end (delta: 314.6 MB). Free memory was 260.9 MB in the beginning and 603.3 MB in the end (delta: -342.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:14:10,011 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:14:10,011 INFO ]: ChcToBoogie took 49.65 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 258.9 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:14:10,012 INFO ]: Boogie Preprocessor took 63.92 ms. Allocated memory is still 309.3 MB. Free memory was 258.9 MB in the beginning and 256.9 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:14:10,012 INFO ]: RCFGBuilder took 533.89 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 238.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:14:10,013 INFO ]: TraceAbstraction took 24824.68 ms. Allocated memory was 309.3 MB in the beginning and 623.9 MB in the end (delta: 314.6 MB). Free memory was 238.8 MB in the beginning and 603.3 MB in the end (delta: -364.4 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:14:10,015 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.65 ms. Allocated memory is still 309.3 MB. Free memory was 260.9 MB in the beginning and 258.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 63.92 ms. Allocated memory is still 309.3 MB. Free memory was 258.9 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 533.89 ms. Allocated memory is still 309.3 MB. Free memory was 256.9 MB in the beginning and 238.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 24824.68 ms. Allocated memory was 309.3 MB in the beginning and 623.9 MB in the end (delta: 314.6 MB). Free memory was 238.8 MB in the beginning and 603.3 MB in the end (delta: -364.4 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. SAFE Result, 24.7s OverallTime, 35 OverallIterations, 8 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1505 SDtfs, 318 SDslu, 5416 SDs, 0 SdLazy, 3762 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1158 GetRequests, 573 SyntacticMatches, 16 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 118 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 1453 NumberOfCodeBlocks, 1453 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 415584 SizeOfPredicates, 402 NumberOfNonLiveVariables, 2792 ConjunctsInSsa, 1188 ConjunctsInUnsatCore, 53 InterpolantComputations, 18 PerfectInterpolantSequences, 1183/1939 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-14-10-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-14-10-024.csv Received shutdown request...