java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:08:45,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:08:45,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:08:45,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:08:45,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:08:45,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:08:45,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:08:45,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:08:45,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:08:45,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:08:45,187 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:08:45,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:08:45,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:08:45,189 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:08:45,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:08:45,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:08:45,193 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:08:45,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:08:45,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:08:45,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:08:45,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:08:45,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:08:45,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:08:45,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:08:45,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:08:45,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:08:45,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:08:45,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:08:45,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:08:45,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:08:45,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:08:45,220 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:08:45,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:08:45,221 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:08:45,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:08:45,226 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:08:45,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:08:45,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:08:45,247 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:08:45,248 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:08:45,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:08:45,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:08:45,252 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:08:45,252 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:08:45,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:08:45,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:08:45,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:08:45,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:08:45,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:08:45,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:08:45,253 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:08:45,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:08:45,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:08:45,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:08:45,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:08:45,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:08:45,254 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:08:45,258 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:08:45,258 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:08:45,293 INFO ]: Repository-Root is: /tmp [2018-06-25 09:08:45,307 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:08:45,310 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:08:45,312 INFO ]: Initializing SmtParser... [2018-06-25 09:08:45,312 INFO ]: SmtParser initialized [2018-06-25 09:08:45,313 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-25 09:08:45,314 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:08:45,388 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 unknown [2018-06-25 09:08:45,645 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008-horn.smt2 [2018-06-25 09:08:45,650 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:08:45,656 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:08:45,656 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:08:45,656 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:08:45,656 INFO ]: ChcToBoogie initialized [2018-06-25 09:08:45,659 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,711 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45 Unit [2018-06-25 09:08:45,711 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:08:45,712 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:08:45,712 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:08:45,712 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:08:45,731 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,731 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,738 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,739 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,744 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,754 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,755 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... [2018-06-25 09:08:45,757 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:08:45,757 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:08:45,757 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:08:45,757 INFO ]: RCFGBuilder initialized [2018-06-25 09:08:45,767 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:08:45,785 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:08:45,785 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:08:45,785 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:08:45,785 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:08:45,785 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:08:45,785 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:08:46,165 INFO ]: Using library mode [2018-06-25 09:08:46,165 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:08:46 BoogieIcfgContainer [2018-06-25 09:08:46,165 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:08:46,167 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:08:46,167 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:08:46,171 INFO ]: TraceAbstraction initialized [2018-06-25 09:08:46,171 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:08:45" (1/3) ... [2018-06-25 09:08:46,172 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ebb037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:08:46, skipping insertion in model container [2018-06-25 09:08:46,172 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:08:45" (2/3) ... [2018-06-25 09:08:46,172 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ebb037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:08:46, skipping insertion in model container [2018-06-25 09:08:46,172 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:08:46" (3/3) ... [2018-06-25 09:08:46,174 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:08:46,183 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:08:46,193 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:08:46,226 INFO ]: Using default assertion order modulation [2018-06-25 09:08:46,226 INFO ]: Interprodecural is true [2018-06-25 09:08:46,226 INFO ]: Hoare is false [2018-06-25 09:08:46,226 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:08:46,226 INFO ]: Backedges is TWOTRACK [2018-06-25 09:08:46,226 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:08:46,226 INFO ]: Difference is false [2018-06-25 09:08:46,226 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:08:46,226 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:08:46,238 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:08:46,248 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:08:46,248 INFO ]: Found error trace [2018-06-25 09:08:46,249 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:46,250 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:46,255 INFO ]: Analyzing trace with hash -1868332170, now seen corresponding path program 1 times [2018-06-25 09:08:46,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:46,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:46,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:46,298 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:46,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:46,340 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:46,430 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:46,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:46,433 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:46,435 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:46,449 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:46,449 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:46,451 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:08:46,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:46,619 INFO ]: Finished difference Result 9 states and 29 transitions. [2018-06-25 09:08:46,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:46,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:08:46,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:46,628 INFO ]: With dead ends: 9 [2018-06-25 09:08:46,628 INFO ]: Without dead ends: 9 [2018-06-25 09:08:46,630 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:46,650 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:08:46,665 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:08:46,667 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:08:46,667 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-06-25 09:08:46,668 INFO ]: Start accepts. Automaton has 9 states and 29 transitions. Word has length 7 [2018-06-25 09:08:46,669 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:46,669 INFO ]: Abstraction has 9 states and 29 transitions. [2018-06-25 09:08:46,669 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:46,669 INFO ]: Start isEmpty. Operand 9 states and 29 transitions. [2018-06-25 09:08:46,670 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:08:46,670 INFO ]: Found error trace [2018-06-25 09:08:46,670 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:46,670 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:46,670 INFO ]: Analyzing trace with hash -2094899638, now seen corresponding path program 1 times [2018-06-25 09:08:46,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:46,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:46,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:46,672 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:46,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:46,689 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:46,760 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:46,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:46,760 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:46,761 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:46,761 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:46,761 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:46,761 INFO ]: Start difference. First operand 9 states and 29 transitions. Second operand 3 states. [2018-06-25 09:08:47,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:47,010 INFO ]: Finished difference Result 11 states and 47 transitions. [2018-06-25 09:08:47,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:47,011 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:08:47,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:47,011 INFO ]: With dead ends: 11 [2018-06-25 09:08:47,011 INFO ]: Without dead ends: 11 [2018-06-25 09:08:47,012 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:47,012 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:08:47,015 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 09:08:47,015 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:08:47,015 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2018-06-25 09:08:47,015 INFO ]: Start accepts. Automaton has 10 states and 38 transitions. Word has length 8 [2018-06-25 09:08:47,015 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:47,015 INFO ]: Abstraction has 10 states and 38 transitions. [2018-06-25 09:08:47,015 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:47,016 INFO ]: Start isEmpty. Operand 10 states and 38 transitions. [2018-06-25 09:08:47,016 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:08:47,016 INFO ]: Found error trace [2018-06-25 09:08:47,016 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:47,016 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:47,016 INFO ]: Analyzing trace with hash -2105981890, now seen corresponding path program 1 times [2018-06-25 09:08:47,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:47,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:47,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:47,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:47,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:47,032 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:47,137 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:47,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:47,138 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) [2018-06-25 09:08:47,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:47,207 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:47,216 INFO ]: Computing forward predicates... [2018-06-25 09:08:47,249 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:47,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:47,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:08:47,269 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:08:47,269 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:08:47,269 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:08:47,269 INFO ]: Start difference. First operand 10 states and 38 transitions. Second operand 4 states. [2018-06-25 09:08:47,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:47,428 INFO ]: Finished difference Result 14 states and 78 transitions. [2018-06-25 09:08:47,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:08:47,429 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:08:47,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:47,430 INFO ]: With dead ends: 14 [2018-06-25 09:08:47,430 INFO ]: Without dead ends: 14 [2018-06-25 09:08:47,430 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:08:47,430 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:08:47,433 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-25 09:08:47,433 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:08:47,433 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-06-25 09:08:47,433 INFO ]: Start accepts. Automaton has 12 states and 60 transitions. Word has length 8 [2018-06-25 09:08:47,434 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:47,434 INFO ]: Abstraction has 12 states and 60 transitions. [2018-06-25 09:08:47,434 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:08:47,434 INFO ]: Start isEmpty. Operand 12 states and 60 transitions. [2018-06-25 09:08:47,434 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:08:47,434 INFO ]: Found error trace [2018-06-25 09:08:47,434 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:47,434 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:47,434 INFO ]: Analyzing trace with hash -2117064142, now seen corresponding path program 1 times [2018-06-25 09:08:47,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:47,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:47,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:47,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:47,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:47,451 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:47,475 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:47,475 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:47,475 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:47,475 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:47,476 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:47,476 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:47,476 INFO ]: Start difference. First operand 12 states and 60 transitions. Second operand 3 states. [2018-06-25 09:08:47,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:47,743 INFO ]: Finished difference Result 14 states and 74 transitions. [2018-06-25 09:08:47,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:47,743 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:08:47,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:47,744 INFO ]: With dead ends: 14 [2018-06-25 09:08:47,744 INFO ]: Without dead ends: 14 [2018-06-25 09:08:47,744 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:47,756 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:08:47,759 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:08:47,759 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:08:47,759 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2018-06-25 09:08:47,759 INFO ]: Start accepts. Automaton has 14 states and 74 transitions. Word has length 8 [2018-06-25 09:08:47,760 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:47,760 INFO ]: Abstraction has 14 states and 74 transitions. [2018-06-25 09:08:47,760 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:47,760 INFO ]: Start isEmpty. Operand 14 states and 74 transitions. [2018-06-25 09:08:47,760 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:08:47,760 INFO ]: Found error trace [2018-06-25 09:08:47,760 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:47,760 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:47,760 INFO ]: Analyzing trace with hash -2087511470, now seen corresponding path program 1 times [2018-06-25 09:08:47,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:47,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:47,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:47,768 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:47,768 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:47,781 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:47,883 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:47,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:47,883 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:47,894 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:47,925 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:47,927 INFO ]: Computing forward predicates... [2018-06-25 09:08:48,099 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:48,128 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:48,128 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:08:48,128 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:08:48,128 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:08:48,128 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:08:48,128 INFO ]: Start difference. First operand 14 states and 74 transitions. Second operand 5 states. [2018-06-25 09:08:48,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:48,666 INFO ]: Finished difference Result 29 states and 174 transitions. [2018-06-25 09:08:48,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:08:48,666 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:08:48,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:48,669 INFO ]: With dead ends: 29 [2018-06-25 09:08:48,669 INFO ]: Without dead ends: 29 [2018-06-25 09:08:48,670 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:48,670 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:08:48,674 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-25 09:08:48,674 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:08:48,675 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 126 transitions. [2018-06-25 09:08:48,675 INFO ]: Start accepts. Automaton has 21 states and 126 transitions. Word has length 8 [2018-06-25 09:08:48,675 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:48,675 INFO ]: Abstraction has 21 states and 126 transitions. [2018-06-25 09:08:48,675 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:08:48,675 INFO ]: Start isEmpty. Operand 21 states and 126 transitions. [2018-06-25 09:08:48,676 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:08:48,676 INFO ]: Found error trace [2018-06-25 09:08:48,676 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:48,676 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:48,676 INFO ]: Analyzing trace with hash -2113370058, now seen corresponding path program 1 times [2018-06-25 09:08:48,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:48,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:48,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:48,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:48,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:48,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:48,746 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:48,746 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:48,746 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:48,746 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:48,746 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:48,746 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:48,747 INFO ]: Start difference. First operand 21 states and 126 transitions. Second operand 3 states. [2018-06-25 09:08:48,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:48,878 INFO ]: Finished difference Result 26 states and 169 transitions. [2018-06-25 09:08:48,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:48,879 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:08:48,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:48,880 INFO ]: With dead ends: 26 [2018-06-25 09:08:48,880 INFO ]: Without dead ends: 26 [2018-06-25 09:08:48,880 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:48,880 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 09:08:48,884 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-06-25 09:08:48,884 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:08:48,885 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 136 transitions. [2018-06-25 09:08:48,885 INFO ]: Start accepts. Automaton has 22 states and 136 transitions. Word has length 8 [2018-06-25 09:08:48,885 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:48,885 INFO ]: Abstraction has 22 states and 136 transitions. [2018-06-25 09:08:48,885 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:48,885 INFO ]: Start isEmpty. Operand 22 states and 136 transitions. [2018-06-25 09:08:48,886 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:08:48,886 INFO ]: Found error trace [2018-06-25 09:08:48,886 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:48,886 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:48,886 INFO ]: Analyzing trace with hash -2098593722, now seen corresponding path program 1 times [2018-06-25 09:08:48,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:48,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:48,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:48,887 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:48,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:48,896 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:48,921 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:48,921 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:48,921 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-25 09:08:48,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:48,958 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:48,960 INFO ]: Computing forward predicates... [2018-06-25 09:08:49,023 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:49,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:49,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:08:49,043 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:08:49,043 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:08:49,043 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:08:49,044 INFO ]: Start difference. First operand 22 states and 136 transitions. Second operand 5 states. [2018-06-25 09:08:49,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:49,183 INFO ]: Finished difference Result 33 states and 205 transitions. [2018-06-25 09:08:49,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:08:49,184 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:08:49,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:49,185 INFO ]: With dead ends: 33 [2018-06-25 09:08:49,185 INFO ]: Without dead ends: 33 [2018-06-25 09:08:49,185 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:49,186 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 09:08:49,190 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-06-25 09:08:49,190 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:08:49,191 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 176 transitions. [2018-06-25 09:08:49,191 INFO ]: Start accepts. Automaton has 28 states and 176 transitions. Word has length 8 [2018-06-25 09:08:49,191 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:49,191 INFO ]: Abstraction has 28 states and 176 transitions. [2018-06-25 09:08:49,191 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:08:49,191 INFO ]: Start isEmpty. Operand 28 states and 176 transitions. [2018-06-25 09:08:49,193 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:08:49,193 INFO ]: Found error trace [2018-06-25 09:08:49,193 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:49,193 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:49,193 INFO ]: Analyzing trace with hash -997705222, now seen corresponding path program 1 times [2018-06-25 09:08:49,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:49,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:49,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:49,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:49,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:49,202 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:49,248 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:49,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:49,248 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-25 09:08:49,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:49,276 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:49,277 INFO ]: Computing forward predicates... [2018-06-25 09:08:49,299 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:49,319 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:08:49,319 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-25 09:08:49,319 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:08:49,319 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:08:49,319 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:08:49,319 INFO ]: Start difference. First operand 28 states and 176 transitions. Second operand 5 states. [2018-06-25 09:08:49,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:49,431 INFO ]: Finished difference Result 25 states and 113 transitions. [2018-06-25 09:08:49,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:08:49,432 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-25 09:08:49,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:49,433 INFO ]: With dead ends: 25 [2018-06-25 09:08:49,433 INFO ]: Without dead ends: 25 [2018-06-25 09:08:49,433 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:08:49,433 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:08:49,436 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-25 09:08:49,436 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:08:49,437 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. [2018-06-25 09:08:49,437 INFO ]: Start accepts. Automaton has 23 states and 105 transitions. Word has length 9 [2018-06-25 09:08:49,437 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:49,437 INFO ]: Abstraction has 23 states and 105 transitions. [2018-06-25 09:08:49,437 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:08:49,437 INFO ]: Start isEmpty. Operand 23 states and 105 transitions. [2018-06-25 09:08:49,438 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:08:49,438 INFO ]: Found error trace [2018-06-25 09:08:49,438 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:49,438 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:49,438 INFO ]: Analyzing trace with hash -979234802, now seen corresponding path program 1 times [2018-06-25 09:08:49,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:49,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:49,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:49,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:49,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:49,448 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:49,548 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:49,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:49,549 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-25 09:08:49,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:49,567 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:49,569 INFO ]: Computing forward predicates... [2018-06-25 09:08:49,647 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:49,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:49,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 09:08:49,667 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:08:49,667 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:08:49,667 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:08:49,667 INFO ]: Start difference. First operand 23 states and 105 transitions. Second operand 6 states. [2018-06-25 09:08:49,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:49,990 INFO ]: Finished difference Result 36 states and 155 transitions. [2018-06-25 09:08:49,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:08:49,991 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-25 09:08:49,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:49,992 INFO ]: With dead ends: 36 [2018-06-25 09:08:49,992 INFO ]: Without dead ends: 36 [2018-06-25 09:08:49,992 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:49,992 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 09:08:50,000 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-25 09:08:50,000 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 09:08:50,001 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 127 transitions. [2018-06-25 09:08:50,001 INFO ]: Start accepts. Automaton has 28 states and 127 transitions. Word has length 9 [2018-06-25 09:08:50,001 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:50,001 INFO ]: Abstraction has 28 states and 127 transitions. [2018-06-25 09:08:50,001 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:08:50,001 INFO ]: Start isEmpty. Operand 28 states and 127 transitions. [2018-06-25 09:08:50,002 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:08:50,002 INFO ]: Found error trace [2018-06-25 09:08:50,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:50,002 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:50,002 INFO ]: Analyzing trace with hash -990317054, now seen corresponding path program 1 times [2018-06-25 09:08:50,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:50,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:50,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:50,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,013 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,063 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:50,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:50,063 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-25 09:08:50,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:50,082 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,084 INFO ]: Computing forward predicates... [2018-06-25 09:08:50,100 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:50,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:50,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 09:08:50,121 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:08:50,121 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:08:50,122 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:08:50,122 INFO ]: Start difference. First operand 28 states and 127 transitions. Second operand 6 states. [2018-06-25 09:08:50,363 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:50,363 INFO ]: Finished difference Result 41 states and 203 transitions. [2018-06-25 09:08:50,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:08:50,363 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-25 09:08:50,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:50,364 INFO ]: With dead ends: 41 [2018-06-25 09:08:50,364 INFO ]: Without dead ends: 41 [2018-06-25 09:08:50,365 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:50,365 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 09:08:50,368 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-06-25 09:08:50,368 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:08:50,369 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 143 transitions. [2018-06-25 09:08:50,369 INFO ]: Start accepts. Automaton has 31 states and 143 transitions. Word has length 9 [2018-06-25 09:08:50,369 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:50,369 INFO ]: Abstraction has 31 states and 143 transitions. [2018-06-25 09:08:50,369 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:08:50,369 INFO ]: Start isEmpty. Operand 31 states and 143 transitions. [2018-06-25 09:08:50,370 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:08:50,370 INFO ]: Found error trace [2018-06-25 09:08:50,370 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:50,370 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:50,370 INFO ]: Analyzing trace with hash -875800450, now seen corresponding path program 1 times [2018-06-25 09:08:50,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:50,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:50,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:50,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,378 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,434 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:50,434 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:50,434 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:50,434 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:50,435 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:50,435 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:50,435 INFO ]: Start difference. First operand 31 states and 143 transitions. Second operand 3 states. [2018-06-25 09:08:50,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:50,523 INFO ]: Finished difference Result 32 states and 124 transitions. [2018-06-25 09:08:50,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:50,524 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:08:50,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:50,524 INFO ]: With dead ends: 32 [2018-06-25 09:08:50,524 INFO ]: Without dead ends: 32 [2018-06-25 09:08:50,525 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:50,525 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-25 09:08:50,527 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-06-25 09:08:50,527 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 09:08:50,528 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 110 transitions. [2018-06-25 09:08:50,528 INFO ]: Start accepts. Automaton has 27 states and 110 transitions. Word has length 9 [2018-06-25 09:08:50,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:50,528 INFO ]: Abstraction has 27 states and 110 transitions. [2018-06-25 09:08:50,528 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:50,528 INFO ]: Start isEmpty. Operand 27 states and 110 transitions. [2018-06-25 09:08:50,529 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:08:50,529 INFO ]: Found error trace [2018-06-25 09:08:50,529 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:50,529 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:50,529 INFO ]: Analyzing trace with hash -425122202, now seen corresponding path program 1 times [2018-06-25 09:08:50,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:50,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:50,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:50,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,535 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,593 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:50,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:50,593 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:50,593 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:50,593 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:50,593 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:50,593 INFO ]: Start difference. First operand 27 states and 110 transitions. Second operand 3 states. [2018-06-25 09:08:50,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:50,619 INFO ]: Finished difference Result 31 states and 121 transitions. [2018-06-25 09:08:50,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:50,620 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:08:50,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:50,620 INFO ]: With dead ends: 31 [2018-06-25 09:08:50,620 INFO ]: Without dead ends: 31 [2018-06-25 09:08:50,620 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:50,620 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:08:50,623 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 09:08:50,623 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 09:08:50,624 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 121 transitions. [2018-06-25 09:08:50,624 INFO ]: Start accepts. Automaton has 31 states and 121 transitions. Word has length 9 [2018-06-25 09:08:50,624 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:50,624 INFO ]: Abstraction has 31 states and 121 transitions. [2018-06-25 09:08:50,624 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:50,624 INFO ]: Start isEmpty. Operand 31 states and 121 transitions. [2018-06-25 09:08:50,624 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:08:50,624 INFO ]: Found error trace [2018-06-25 09:08:50,624 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:50,624 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:50,624 INFO ]: Analyzing trace with hash -1112221826, now seen corresponding path program 1 times [2018-06-25 09:08:50,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:50,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:50,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,625 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:50,625 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,632 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,688 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:50,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:08:50,688 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:08:50,689 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:08:50,689 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:08:50,689 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:50,689 INFO ]: Start difference. First operand 31 states and 121 transitions. Second operand 3 states. [2018-06-25 09:08:50,742 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:50,742 INFO ]: Finished difference Result 27 states and 51 transitions. [2018-06-25 09:08:50,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:08:50,742 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:08:50,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:50,743 INFO ]: With dead ends: 27 [2018-06-25 09:08:50,743 INFO ]: Without dead ends: 14 [2018-06-25 09:08:50,743 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:08:50,743 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:08:50,744 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-06-25 09:08:50,744 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:08:50,744 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-25 09:08:50,744 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-25 09:08:50,744 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:50,744 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-25 09:08:50,744 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:08:50,744 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-25 09:08:50,745 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:08:50,745 INFO ]: Found error trace [2018-06-25 09:08:50,745 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:50,745 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:50,745 INFO ]: Analyzing trace with hash -982396462, now seen corresponding path program 2 times [2018-06-25 09:08:50,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:50,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:50,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:50,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:50,754 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,822 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:50,822 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:50,822 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-25 09:08:50,828 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:08:50,873 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:08:50,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:50,875 INFO ]: Computing forward predicates... [2018-06-25 09:08:51,118 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:51,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:51,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-25 09:08:51,137 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:08:51,137 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:08:51,137 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:51,138 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 7 states. [2018-06-25 09:08:51,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:51,194 INFO ]: Finished difference Result 15 states and 26 transitions. [2018-06-25 09:08:51,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:08:51,195 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-25 09:08:51,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:51,195 INFO ]: With dead ends: 15 [2018-06-25 09:08:51,195 INFO ]: Without dead ends: 15 [2018-06-25 09:08:51,195 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:08:51,195 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:08:51,196 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-25 09:08:51,196 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:08:51,196 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-25 09:08:51,196 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 10 [2018-06-25 09:08:51,196 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:51,196 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-25 09:08:51,196 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:08:51,196 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-25 09:08:51,197 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:08:51,197 INFO ]: Found error trace [2018-06-25 09:08:51,197 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:51,197 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:51,197 INFO ]: Analyzing trace with hash -993478714, now seen corresponding path program 2 times [2018-06-25 09:08:51,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:51,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:51,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:51,198 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:51,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:51,205 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:51,249 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:51,249 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:51,249 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-25 09:08:51,255 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:08:51,301 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:08:51,301 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:51,302 INFO ]: Computing forward predicates... [2018-06-25 09:08:51,321 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:51,340 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:08:51,340 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-25 09:08:51,340 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:08:51,340 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:08:51,340 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:08:51,340 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 6 states. [2018-06-25 09:08:51,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:51,371 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-25 09:08:51,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:08:51,372 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-25 09:08:51,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:51,372 INFO ]: With dead ends: 16 [2018-06-25 09:08:51,372 INFO ]: Without dead ends: 16 [2018-06-25 09:08:51,372 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:51,372 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:08:51,373 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-25 09:08:51,373 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:08:51,374 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-25 09:08:51,374 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 10 [2018-06-25 09:08:51,374 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:51,374 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-25 09:08:51,374 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:08:51,374 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-25 09:08:51,374 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:08:51,374 INFO ]: Found error trace [2018-06-25 09:08:51,374 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:51,374 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:51,374 INFO ]: Analyzing trace with hash -882656194, now seen corresponding path program 1 times [2018-06-25 09:08:51,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:51,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:51,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:51,375 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:51,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:51,382 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:51,417 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:51,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:51,417 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-25 09:08:51,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:51,438 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:51,439 INFO ]: Computing forward predicates... [2018-06-25 09:08:51,497 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:51,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:51,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 09:08:51,515 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:08:51,515 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:08:51,515 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:08:51,516 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 8 states. [2018-06-25 09:08:51,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:51,842 INFO ]: Finished difference Result 17 states and 28 transitions. [2018-06-25 09:08:51,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:08:51,842 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-25 09:08:51,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:51,843 INFO ]: With dead ends: 17 [2018-06-25 09:08:51,843 INFO ]: Without dead ends: 13 [2018-06-25 09:08:51,843 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:08:51,843 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:08:51,844 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:08:51,844 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:08:51,844 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-25 09:08:51,844 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-25 09:08:51,844 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:51,844 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-25 09:08:51,844 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:08:51,844 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-25 09:08:51,845 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:08:51,845 INFO ]: Found error trace [2018-06-25 09:08:51,845 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:51,845 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:51,845 INFO ]: Analyzing trace with hash -1080407922, now seen corresponding path program 3 times [2018-06-25 09:08:51,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:51,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:51,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:51,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:51,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:51,859 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:51,917 INFO ]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:51,917 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:51,917 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-25 09:08:51,923 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:08:51,985 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:08:51,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:51,987 INFO ]: Computing forward predicates... [2018-06-25 09:08:52,040 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,070 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:08:52,070 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-25 09:08:52,070 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:08:52,070 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:08:52,070 INFO ]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:52,071 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 7 states. [2018-06-25 09:08:52,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:52,130 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-25 09:08:52,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:08:52,130 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-25 09:08:52,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:52,130 INFO ]: With dead ends: 16 [2018-06-25 09:08:52,130 INFO ]: Without dead ends: 16 [2018-06-25 09:08:52,130 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:08:52,130 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:08:52,131 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 09:08:52,131 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:08:52,132 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-25 09:08:52,132 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 11 [2018-06-25 09:08:52,132 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:52,132 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-25 09:08:52,132 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:08:52,132 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-25 09:08:52,132 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:08:52,132 INFO ]: Found error trace [2018-06-25 09:08:52,132 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:52,132 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:52,132 INFO ]: Analyzing trace with hash -980667654, now seen corresponding path program 2 times [2018-06-25 09:08:52,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:52,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:52,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:52,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,145 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:52,207 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,207 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:52,207 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-25 09:08:52,214 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:08:52,230 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:08:52,230 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:52,232 INFO ]: Computing forward predicates... [2018-06-25 09:08:52,315 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,345 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:52,345 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 09:08:52,345 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:08:52,346 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:08:52,346 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:08:52,346 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 9 states. [2018-06-25 09:08:52,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:52,416 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-25 09:08:52,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:08:52,416 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-25 09:08:52,416 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:52,416 INFO ]: With dead ends: 16 [2018-06-25 09:08:52,416 INFO ]: Without dead ends: 13 [2018-06-25 09:08:52,417 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:52,417 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:08:52,418 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:08:52,418 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:08:52,418 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-25 09:08:52,418 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-25 09:08:52,418 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:52,418 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-25 09:08:52,418 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:08:52,418 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-25 09:08:52,418 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:08:52,419 INFO ]: Found error trace [2018-06-25 09:08:52,419 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:52,419 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:52,419 INFO ]: Analyzing trace with hash -1324217466, now seen corresponding path program 1 times [2018-06-25 09:08:52,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:52,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:52,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:52,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,437 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:52,552 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:52,552 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-25 09:08:52,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:52,586 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:52,588 INFO ]: Computing forward predicates... [2018-06-25 09:08:52,605 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:52,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-25 09:08:52,628 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:08:52,629 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:08:52,629 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:08:52,629 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 7 states. [2018-06-25 09:08:52,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:52,680 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-25 09:08:52,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:08:52,680 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-25 09:08:52,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:52,680 INFO ]: With dead ends: 15 [2018-06-25 09:08:52,680 INFO ]: Without dead ends: 15 [2018-06-25 09:08:52,681 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:08:52,681 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:08:52,682 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-25 09:08:52,682 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:08:52,682 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-06-25 09:08:52,682 INFO ]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-06-25 09:08:52,682 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:52,682 INFO ]: Abstraction has 14 states and 19 transitions. [2018-06-25 09:08:52,682 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:08:52,682 INFO ]: Start isEmpty. Operand 14 states and 19 transitions. [2018-06-25 09:08:52,682 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:08:52,682 INFO ]: Found error trace [2018-06-25 09:08:52,682 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:52,682 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:52,682 INFO ]: Analyzing trace with hash 275944382, now seen corresponding path program 3 times [2018-06-25 09:08:52,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:52,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:52,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:52,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,697 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:52,777 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,777 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:52,777 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-25 09:08:52,784 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:08:52,803 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:08:52,803 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:52,805 INFO ]: Computing forward predicates... [2018-06-25 09:08:52,845 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:52,869 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:52,869 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-25 09:08:52,869 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:08:52,869 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:08:52,869 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:08:52,870 INFO ]: Start difference. First operand 14 states and 19 transitions. Second operand 9 states. [2018-06-25 09:08:52,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:52,958 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-25 09:08:52,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:08:52,958 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:08:52,958 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:52,958 INFO ]: With dead ends: 19 [2018-06-25 09:08:52,958 INFO ]: Without dead ends: 19 [2018-06-25 09:08:52,958 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:52,958 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:08:52,960 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-25 09:08:52,960 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:08:52,960 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-25 09:08:52,960 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 12 [2018-06-25 09:08:52,961 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:52,961 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-25 09:08:52,961 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:08:52,961 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-25 09:08:52,961 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:08:52,961 INFO ]: Found error trace [2018-06-25 09:08:52,961 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:52,961 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:52,961 INFO ]: Analyzing trace with hash -67605430, now seen corresponding path program 2 times [2018-06-25 09:08:52,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:52,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:52,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,962 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:52,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:52,969 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:53,150 INFO ]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:53,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:53,170 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-25 09:08:53,176 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:08:53,205 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:08:53,205 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:53,206 INFO ]: Computing forward predicates... [2018-06-25 09:08:53,256 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:53,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:53,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-25 09:08:53,275 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:08:53,275 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:08:53,275 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:08:53,275 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 9 states. [2018-06-25 09:08:53,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:53,314 INFO ]: Finished difference Result 18 states and 27 transitions. [2018-06-25 09:08:53,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:08:53,314 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-25 09:08:53,315 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:53,315 INFO ]: With dead ends: 18 [2018-06-25 09:08:53,315 INFO ]: Without dead ends: 18 [2018-06-25 09:08:53,315 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:53,315 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:08:53,316 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-25 09:08:53,316 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:08:53,316 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-25 09:08:53,316 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 12 [2018-06-25 09:08:53,316 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:53,316 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-25 09:08:53,316 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:08:53,316 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-25 09:08:53,317 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:08:53,317 INFO ]: Found error trace [2018-06-25 09:08:53,317 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:53,317 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:53,317 INFO ]: Analyzing trace with hash 848527402, now seen corresponding path program 1 times [2018-06-25 09:08:53,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:53,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:53,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:53,318 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:53,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:53,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:53,446 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:53,446 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:53,446 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-25 09:08:53,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:53,468 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:53,470 INFO ]: Computing forward predicates... [2018-06-25 09:08:53,672 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:53,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:53,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 09:08:53,691 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:08:53,691 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:08:53,691 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:53,691 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 10 states. [2018-06-25 09:08:53,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:53,774 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-25 09:08:53,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:08:53,774 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-25 09:08:53,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:53,775 INFO ]: With dead ends: 19 [2018-06-25 09:08:53,775 INFO ]: Without dead ends: 15 [2018-06-25 09:08:53,775 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:08:53,775 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:08:53,776 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:08:53,776 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:08:53,776 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-25 09:08:53,776 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 12 [2018-06-25 09:08:53,776 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:53,776 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-25 09:08:53,776 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:08:53,776 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-25 09:08:53,777 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:08:53,777 INFO ]: Found error trace [2018-06-25 09:08:53,777 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:53,777 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:53,777 INFO ]: Analyzing trace with hash 504977590, now seen corresponding path program 1 times [2018-06-25 09:08:53,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:53,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:53,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:53,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:53,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:53,785 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:53,866 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:53,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:53,866 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-25 09:08:53,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:53,889 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:53,891 INFO ]: Computing forward predicates... [2018-06-25 09:08:54,276 WARN ]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 09:08:54,279 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:54,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:54,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 09:08:54,298 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:08:54,298 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:08:54,298 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:54,299 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 10 states. [2018-06-25 09:08:54,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:54,353 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-25 09:08:54,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:08:54,353 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-25 09:08:54,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:54,353 INFO ]: With dead ends: 18 [2018-06-25 09:08:54,354 INFO ]: Without dead ends: 15 [2018-06-25 09:08:54,354 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:08:54,354 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:08:54,355 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:08:54,355 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:08:54,355 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-25 09:08:54,355 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 12 [2018-06-25 09:08:54,355 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:54,355 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-25 09:08:54,355 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:08:54,355 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-25 09:08:54,355 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:08:54,355 INFO ]: Found error trace [2018-06-25 09:08:54,355 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:54,355 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:54,355 INFO ]: Analyzing trace with hash 576211834, now seen corresponding path program 4 times [2018-06-25 09:08:54,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:54,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:54,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:54,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:08:54,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:54,364 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:54,948 INFO ]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:54,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:54,949 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) [2018-06-25 09:08:54,963 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:55,015 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:08:55,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:55,017 INFO ]: Computing forward predicates... [2018-06-25 09:08:55,535 INFO ]: Checked inductivity of 21 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:55,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:55,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-25 09:08:55,566 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:08:55,566 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:08:55,566 INFO ]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:55,566 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 10 states. [2018-06-25 09:08:55,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:55,712 INFO ]: Finished difference Result 21 states and 27 transitions. [2018-06-25 09:08:55,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:08:55,712 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-25 09:08:55,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:55,712 INFO ]: With dead ends: 21 [2018-06-25 09:08:55,712 INFO ]: Without dead ends: 21 [2018-06-25 09:08:55,713 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:08:55,713 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:08:55,714 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-25 09:08:55,714 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:08:55,714 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-06-25 09:08:55,714 INFO ]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 13 [2018-06-25 09:08:55,714 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:55,714 INFO ]: Abstraction has 15 states and 21 transitions. [2018-06-25 09:08:55,714 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:08:55,714 INFO ]: Start isEmpty. Operand 15 states and 21 transitions. [2018-06-25 09:08:55,714 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:08:55,714 INFO ]: Found error trace [2018-06-25 09:08:55,714 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:55,714 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:55,715 INFO ]: Analyzing trace with hash 1148794854, now seen corresponding path program 2 times [2018-06-25 09:08:55,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:55,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:55,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:55,715 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:55,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:55,724 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:56,052 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:56,052 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:56,052 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-25 09:08:56,057 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:08:56,084 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:08:56,084 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:56,087 INFO ]: Computing forward predicates... [2018-06-25 09:08:56,276 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:56,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:56,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 09:08:56,295 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:08:56,295 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:08:56,295 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:08:56,295 INFO ]: Start difference. First operand 15 states and 21 transitions. Second operand 11 states. [2018-06-25 09:08:56,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:56,395 INFO ]: Finished difference Result 20 states and 30 transitions. [2018-06-25 09:08:56,398 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:08:56,398 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-25 09:08:56,398 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:56,398 INFO ]: With dead ends: 20 [2018-06-25 09:08:56,398 INFO ]: Without dead ends: 16 [2018-06-25 09:08:56,398 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:08:56,399 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:08:56,400 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:08:56,400 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:08:56,400 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-25 09:08:56,400 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 13 [2018-06-25 09:08:56,400 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:56,400 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-25 09:08:56,400 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:08:56,400 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-25 09:08:56,400 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:08:56,400 INFO ]: Found error trace [2018-06-25 09:08:56,400 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:56,400 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:56,401 INFO ]: Analyzing trace with hash 805245042, now seen corresponding path program 2 times [2018-06-25 09:08:56,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:56,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:56,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:56,401 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:56,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:56,428 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:56,536 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:56,536 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:56,536 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:56,541 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:08:56,579 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:08:56,579 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:56,581 INFO ]: Computing forward predicates... [2018-06-25 09:08:56,709 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:56,727 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:56,727 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:08:56,727 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:08:56,727 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:08:56,727 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:08:56,727 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 10 states. [2018-06-25 09:08:56,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:56,785 INFO ]: Finished difference Result 18 states and 25 transitions. [2018-06-25 09:08:56,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:08:56,785 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-25 09:08:56,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:56,785 INFO ]: With dead ends: 18 [2018-06-25 09:08:56,785 INFO ]: Without dead ends: 18 [2018-06-25 09:08:56,785 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:08:56,785 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:08:56,786 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-25 09:08:56,786 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:08:56,786 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-06-25 09:08:56,786 INFO ]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 13 [2018-06-25 09:08:56,786 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:56,786 INFO ]: Abstraction has 16 states and 23 transitions. [2018-06-25 09:08:56,786 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:08:56,787 INFO ]: Start isEmpty. Operand 16 states and 23 transitions. [2018-06-25 09:08:56,787 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:08:56,787 INFO ]: Found error trace [2018-06-25 09:08:56,787 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:56,787 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:56,787 INFO ]: Analyzing trace with hash 1867151274, now seen corresponding path program 3 times [2018-06-25 09:08:56,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:56,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:56,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:56,788 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:56,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:56,801 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:57,197 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:57,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:57,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:57,217 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:08:57,240 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:08:57,240 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:57,241 INFO ]: Computing forward predicates... [2018-06-25 09:08:57,305 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:57,335 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:57,335 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-25 09:08:57,335 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:08:57,335 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:08:57,335 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:08:57,335 INFO ]: Start difference. First operand 16 states and 23 transitions. Second operand 11 states. [2018-06-25 09:08:57,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:57,528 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-25 09:08:57,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:08:57,528 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-25 09:08:57,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:57,528 INFO ]: With dead ends: 21 [2018-06-25 09:08:57,528 INFO ]: Without dead ends: 21 [2018-06-25 09:08:57,528 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:08:57,528 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:08:57,529 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-25 09:08:57,529 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:08:57,530 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-25 09:08:57,530 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 14 [2018-06-25 09:08:57,530 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:57,530 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-25 09:08:57,530 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:08:57,530 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-25 09:08:57,530 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:08:57,530 INFO ]: Found error trace [2018-06-25 09:08:57,530 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:57,530 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:57,530 INFO ]: Analyzing trace with hash 1523601462, now seen corresponding path program 3 times [2018-06-25 09:08:57,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:57,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:57,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:57,531 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:57,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:57,541 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:57,587 INFO ]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:57,587 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:57,587 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:57,593 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:08:57,619 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:08:57,619 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:57,620 INFO ]: Computing forward predicates... [2018-06-25 09:08:57,698 INFO ]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:57,718 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:57,718 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-25 09:08:57,718 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:08:57,718 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:08:57,718 INFO ]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:08:57,718 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 11 states. [2018-06-25 09:08:57,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:08:57,819 INFO ]: Finished difference Result 23 states and 34 transitions. [2018-06-25 09:08:57,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:08:57,819 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-25 09:08:57,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:08:57,819 INFO ]: With dead ends: 23 [2018-06-25 09:08:57,819 INFO ]: Without dead ends: 23 [2018-06-25 09:08:57,819 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:08:57,820 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:08:57,820 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-25 09:08:57,820 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:08:57,821 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2018-06-25 09:08:57,821 INFO ]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 14 [2018-06-25 09:08:57,821 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:08:57,821 INFO ]: Abstraction has 17 states and 28 transitions. [2018-06-25 09:08:57,821 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:08:57,821 INFO ]: Start isEmpty. Operand 17 states and 28 transitions. [2018-06-25 09:08:57,821 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:08:57,821 INFO ]: Found error trace [2018-06-25 09:08:57,821 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:08:57,821 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:08:57,822 INFO ]: Analyzing trace with hash 664132286, now seen corresponding path program 5 times [2018-06-25 09:08:57,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:08:57,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:08:57,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:57,822 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:08:57,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:08:57,836 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:57,923 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:57,923 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:08:57,923 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:08:57,930 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:08:57,953 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 09:08:57,953 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:08:57,955 INFO ]: Computing forward predicates... [2018-06-25 09:08:58,444 WARN ]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:08:59,269 WARN ]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:08:59,275 INFO ]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:08:59,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:08:59,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-25 09:08:59,293 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:08:59,294 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:08:59,294 INFO ]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2018-06-25 09:08:59,294 INFO ]: Start difference. First operand 17 states and 28 transitions. Second operand 13 states. [2018-06-25 09:09:00,262 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:00,262 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-25 09:09:00,262 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:09:00,262 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-25 09:09:00,262 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:00,263 INFO ]: With dead ends: 21 [2018-06-25 09:09:00,263 INFO ]: Without dead ends: 17 [2018-06-25 09:09:00,263 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2018-06-25 09:09:00,263 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:09:00,264 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:09:00,264 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:09:00,264 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-25 09:09:00,264 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 14 [2018-06-25 09:09:00,264 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:00,264 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-25 09:09:00,264 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:09:00,264 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-25 09:09:00,265 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:09:00,265 INFO ]: Found error trace [2018-06-25 09:09:00,265 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:00,265 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:00,265 INFO ]: Analyzing trace with hash -1395977294, now seen corresponding path program 3 times [2018-06-25 09:09:00,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:00,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:00,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:00,265 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:00,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:00,275 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:00,377 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:00,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:00,377 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:00,383 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:09:00,406 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:09:00,406 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:00,407 INFO ]: Computing forward predicates... [2018-06-25 09:09:00,729 WARN ]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:09:00,732 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:00,751 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:00,751 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-25 09:09:00,751 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:09:00,751 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:09:00,751 INFO ]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:09:00,751 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 12 states. [2018-06-25 09:09:00,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:00,826 INFO ]: Finished difference Result 21 states and 30 transitions. [2018-06-25 09:09:00,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:09:00,827 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-25 09:09:00,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:00,827 INFO ]: With dead ends: 21 [2018-06-25 09:09:00,827 INFO ]: Without dead ends: 17 [2018-06-25 09:09:00,827 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:09:00,827 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:09:00,828 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:09:00,828 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:09:00,829 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-25 09:09:00,829 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 14 [2018-06-25 09:09:00,829 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:00,829 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-25 09:09:00,829 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:09:00,829 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-25 09:09:00,829 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:09:00,829 INFO ]: Found error trace [2018-06-25 09:09:00,829 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:00,829 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:00,829 INFO ]: Analyzing trace with hash -1633603482, now seen corresponding path program 4 times [2018-06-25 09:09:00,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:00,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:00,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:00,830 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:00,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:00,840 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:00,960 INFO ]: Checked inductivity of 36 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:00,960 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:00,960 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:09:00,974 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:01,013 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:09:01,013 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:01,014 INFO ]: Computing forward predicates... [2018-06-25 09:09:01,208 INFO ]: Checked inductivity of 36 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:01,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:01,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-25 09:09:01,227 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:09:01,227 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:09:01,227 INFO ]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:09:01,228 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 12 states. [2018-06-25 09:09:01,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:01,342 INFO ]: Finished difference Result 23 states and 31 transitions. [2018-06-25 09:09:01,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:09:01,342 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-25 09:09:01,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:01,342 INFO ]: With dead ends: 23 [2018-06-25 09:09:01,342 INFO ]: Without dead ends: 23 [2018-06-25 09:09:01,343 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:09:01,343 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:09:01,344 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-25 09:09:01,344 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:09:01,344 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-25 09:09:01,344 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 15 [2018-06-25 09:09:01,344 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:01,344 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-25 09:09:01,344 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:09:01,344 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-25 09:09:01,344 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:09:01,344 INFO ]: Found error trace [2018-06-25 09:09:01,345 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:01,345 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:01,345 INFO ]: Analyzing trace with hash 1458344826, now seen corresponding path program 6 times [2018-06-25 09:09:01,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:01,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:01,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:01,345 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:01,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:01,364 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:01,837 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:01,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:01,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:01,845 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:09:01,874 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-25 09:09:01,874 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:01,875 INFO ]: Computing forward predicates... [2018-06-25 09:09:02,356 WARN ]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:09:02,813 WARN ]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:09:02,815 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:02,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:02,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-25 09:09:02,834 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:09:02,834 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:09:02,834 INFO ]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:09:02,834 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 14 states. [2018-06-25 09:09:04,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:04,535 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-25 09:09:04,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:09:04,535 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-25 09:09:04,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:04,535 INFO ]: With dead ends: 21 [2018-06-25 09:09:04,535 INFO ]: Without dead ends: 17 [2018-06-25 09:09:04,535 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:09:04,535 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:09:04,536 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:09:04,536 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:09:04,536 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-06-25 09:09:04,536 INFO ]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 15 [2018-06-25 09:09:04,537 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:04,537 INFO ]: Abstraction has 17 states and 22 transitions. [2018-06-25 09:09:04,537 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:09:04,537 INFO ]: Start isEmpty. Operand 17 states and 22 transitions. [2018-06-25 09:09:04,537 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:09:04,537 INFO ]: Found error trace [2018-06-25 09:09:04,537 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:04,537 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:04,537 INFO ]: Analyzing trace with hash -601764754, now seen corresponding path program 4 times [2018-06-25 09:09:04,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:04,537 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:04,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:04,538 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:04,538 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:04,554 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:04,719 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:04,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:04,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:04,725 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:09:04,751 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:09:04,751 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:04,753 INFO ]: Computing forward predicates... [2018-06-25 09:09:04,796 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:04,814 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:04,814 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-25 09:09:04,814 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:09:04,814 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:09:04,814 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:09:04,815 INFO ]: Start difference. First operand 17 states and 22 transitions. Second operand 11 states. [2018-06-25 09:09:04,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:04,888 INFO ]: Finished difference Result 20 states and 25 transitions. [2018-06-25 09:09:04,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:09:04,888 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-25 09:09:04,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:04,888 INFO ]: With dead ends: 20 [2018-06-25 09:09:04,888 INFO ]: Without dead ends: 20 [2018-06-25 09:09:04,888 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:09:04,888 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:09:04,889 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-25 09:09:04,889 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:09:04,889 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-06-25 09:09:04,889 INFO ]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 15 [2018-06-25 09:09:04,889 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:04,889 INFO ]: Abstraction has 18 states and 23 transitions. [2018-06-25 09:09:04,889 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:09:04,889 INFO ]: Start isEmpty. Operand 18 states and 23 transitions. [2018-06-25 09:09:04,889 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:09:04,889 INFO ]: Found error trace [2018-06-25 09:09:04,889 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:04,890 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:04,890 INFO ]: Analyzing trace with hash 309129790, now seen corresponding path program 7 times [2018-06-25 09:09:04,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:04,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:04,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:04,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:04,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:04,910 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:05,439 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:05,439 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:05,439 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:05,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:05,472 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:05,474 INFO ]: Computing forward predicates... [2018-06-25 09:09:05,569 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:05,588 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:05,588 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 09:09:05,588 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:09:05,588 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:09:05,588 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:09:05,588 INFO ]: Start difference. First operand 18 states and 23 transitions. Second operand 13 states. [2018-06-25 09:09:06,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:06,038 INFO ]: Finished difference Result 25 states and 34 transitions. [2018-06-25 09:09:06,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:09:06,038 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:09:06,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:06,038 INFO ]: With dead ends: 25 [2018-06-25 09:09:06,038 INFO ]: Without dead ends: 25 [2018-06-25 09:09:06,038 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:09:06,038 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:09:06,039 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-06-25 09:09:06,039 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:09:06,039 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-25 09:09:06,039 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 16 [2018-06-25 09:09:06,039 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:06,039 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-25 09:09:06,039 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:09:06,039 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-25 09:09:06,039 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:09:06,039 INFO ]: Found error trace [2018-06-25 09:09:06,039 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:06,039 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:06,039 INFO ]: Analyzing trace with hash -1750979790, now seen corresponding path program 5 times [2018-06-25 09:09:06,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:06,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:06,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:06,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:06,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:06,049 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:06,120 INFO ]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:06,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:06,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:06,125 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:09:06,152 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:09:06,152 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:06,153 INFO ]: Computing forward predicates... [2018-06-25 09:09:06,530 WARN ]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:09:06,533 INFO ]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:06,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:06,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-25 09:09:06,551 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:09:06,551 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:09:06,551 INFO ]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:09:06,551 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 14 states. [2018-06-25 09:09:06,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:06,627 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-25 09:09:06,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:09:06,628 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-25 09:09:06,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:06,628 INFO ]: With dead ends: 24 [2018-06-25 09:09:06,628 INFO ]: Without dead ends: 24 [2018-06-25 09:09:06,628 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:09:06,628 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:09:06,629 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-06-25 09:09:06,629 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:09:06,629 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-25 09:09:06,629 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 16 [2018-06-25 09:09:06,629 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:06,629 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-25 09:09:06,629 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:09:06,629 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-25 09:09:06,630 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:09:06,630 INFO ]: Found error trace [2018-06-25 09:09:06,630 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:06,630 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:06,630 INFO ]: Analyzing trace with hash 879334226, now seen corresponding path program 5 times [2018-06-25 09:09:06,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:06,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:06,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:06,631 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:06,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:06,642 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:06,928 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:06,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:06,928 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:06,933 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:09:06,988 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:09:06,988 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:06,991 INFO ]: Computing forward predicates... [2018-06-25 09:09:07,852 WARN ]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-25 09:09:07,874 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:07,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:07,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-25 09:09:07,906 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:09:07,906 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:09:07,906 INFO ]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:09:07,906 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 15 states. [2018-06-25 09:09:09,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:09,476 INFO ]: Finished difference Result 25 states and 34 transitions. [2018-06-25 09:09:09,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:09:09,477 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-25 09:09:09,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:09,478 INFO ]: With dead ends: 25 [2018-06-25 09:09:09,478 INFO ]: Without dead ends: 25 [2018-06-25 09:09:09,478 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:09:09,478 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:09:09,478 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-25 09:09:09,478 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:09:09,479 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-06-25 09:09:09,479 INFO ]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 16 [2018-06-25 09:09:09,479 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:09,479 INFO ]: Abstraction has 22 states and 31 transitions. [2018-06-25 09:09:09,479 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:09:09,479 INFO ]: Start isEmpty. Operand 22 states and 31 transitions. [2018-06-25 09:09:09,479 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:09:09,479 INFO ]: Found error trace [2018-06-25 09:09:09,479 INFO ]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:09,479 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:09,479 INFO ]: Analyzing trace with hash -1180775354, now seen corresponding path program 4 times [2018-06-25 09:09:09,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:09,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:09,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:09,480 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:09,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:09,496 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:10,163 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:10,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:10,181 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:10,187 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:09:10,213 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:09:10,213 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:10,215 INFO ]: Computing forward predicates... [2018-06-25 09:09:10,738 WARN ]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 09:09:11,296 INFO ]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:11,314 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:11,314 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-25 09:09:11,315 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:09:11,315 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:09:11,315 INFO ]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2018-06-25 09:09:11,315 INFO ]: Start difference. First operand 22 states and 31 transitions. Second operand 15 states. [2018-06-25 09:09:12,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:12,067 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-25 09:09:12,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:09:12,067 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-25 09:09:12,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:12,067 INFO ]: With dead ends: 29 [2018-06-25 09:09:12,067 INFO ]: Without dead ends: 19 [2018-06-25 09:09:12,067 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2018-06-25 09:09:12,067 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:09:12,068 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:09:12,068 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:09:12,068 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-25 09:09:12,068 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 16 [2018-06-25 09:09:12,068 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:12,068 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-25 09:09:12,068 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:09:12,068 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-25 09:09:12,068 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:09:12,068 INFO ]: Found error trace [2018-06-25 09:09:12,068 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:12,069 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:12,069 INFO ]: Analyzing trace with hash -956797958, now seen corresponding path program 8 times [2018-06-25 09:09:12,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:12,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:12,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:12,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:12,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:12,079 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:12,259 INFO ]: Checked inductivity of 55 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:12,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:12,260 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:12,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:09:12,306 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:09:12,306 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:12,308 INFO ]: Computing forward predicates... [2018-06-25 09:09:12,952 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:09:13,007 INFO ]: Checked inductivity of 55 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:13,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:13,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-25 09:09:13,027 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:09:13,027 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:09:13,027 INFO ]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:09:13,027 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 15 states. [2018-06-25 09:09:13,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:13,203 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-25 09:09:13,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:09:13,203 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-25 09:09:13,203 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:13,203 INFO ]: With dead ends: 28 [2018-06-25 09:09:13,203 INFO ]: Without dead ends: 28 [2018-06-25 09:09:13,203 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:09:13,203 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:09:13,204 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-25 09:09:13,204 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:09:13,205 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-06-25 09:09:13,205 INFO ]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 17 [2018-06-25 09:09:13,205 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:13,205 INFO ]: Abstraction has 19 states and 25 transitions. [2018-06-25 09:09:13,205 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:09:13,205 INFO ]: Start isEmpty. Operand 19 states and 25 transitions. [2018-06-25 09:09:13,205 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:09:13,205 INFO ]: Found error trace [2018-06-25 09:09:13,205 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:13,205 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:13,205 INFO ]: Analyzing trace with hash -386593522, now seen corresponding path program 6 times [2018-06-25 09:09:13,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:13,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:13,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:13,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:13,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:13,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:13,330 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:13,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:13,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:13,335 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:09:13,368 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 09:09:13,368 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:13,370 INFO ]: Computing forward predicates... [2018-06-25 09:09:13,994 WARN ]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 09:09:14,581 INFO ]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:14,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:14,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-25 09:09:14,601 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:09:14,601 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:09:14,601 INFO ]: CoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2018-06-25 09:09:14,601 INFO ]: Start difference. First operand 19 states and 25 transitions. Second operand 16 states. [2018-06-25 09:09:15,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:15,449 INFO ]: Finished difference Result 25 states and 35 transitions. [2018-06-25 09:09:15,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:09:15,449 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-25 09:09:15,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:15,450 INFO ]: With dead ends: 25 [2018-06-25 09:09:15,450 INFO ]: Without dead ends: 20 [2018-06-25 09:09:15,450 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2018-06-25 09:09:15,450 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:09:15,451 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:09:15,451 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:09:15,451 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-25 09:09:15,451 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 17 [2018-06-25 09:09:15,451 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:15,451 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-25 09:09:15,451 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:09:15,451 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-25 09:09:15,451 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:09:15,451 INFO ]: Found error trace [2018-06-25 09:09:15,451 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:15,451 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:15,451 INFO ]: Analyzing trace with hash 1848264194, now seen corresponding path program 5 times [2018-06-25 09:09:15,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:15,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:15,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:15,452 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:15,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:15,474 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:15,706 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:15,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:15,706 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:15,711 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:09:15,740 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:09:15,740 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:15,743 INFO ]: Computing forward predicates... [2018-06-25 09:09:15,795 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:15,814 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:15,814 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-25 09:09:15,814 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:09:15,814 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:09:15,814 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:09:15,814 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 14 states. [2018-06-25 09:09:15,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:15,938 INFO ]: Finished difference Result 23 states and 30 transitions. [2018-06-25 09:09:15,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:09:15,938 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-25 09:09:15,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:15,939 INFO ]: With dead ends: 23 [2018-06-25 09:09:15,939 INFO ]: Without dead ends: 23 [2018-06-25 09:09:15,939 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:09:15,939 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:09:15,940 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-25 09:09:15,940 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:09:15,940 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-25 09:09:15,940 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 17 [2018-06-25 09:09:15,940 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:15,940 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-25 09:09:15,940 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:09:15,940 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-25 09:09:15,940 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:09:15,940 INFO ]: Found error trace [2018-06-25 09:09:15,940 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:15,940 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:15,940 INFO ]: Analyzing trace with hash -975648046, now seen corresponding path program 7 times [2018-06-25 09:09:15,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:15,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:15,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:15,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:15,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:15,961 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:16,181 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:16,181 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:16,181 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:16,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:16,217 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:16,219 INFO ]: Computing forward predicates... [2018-06-25 09:09:16,275 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:16,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:16,295 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-25 09:09:16,296 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:09:16,296 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:09:16,296 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:09:16,296 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 15 states. [2018-06-25 09:09:16,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:16,451 INFO ]: Finished difference Result 27 states and 38 transitions. [2018-06-25 09:09:16,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:09:16,451 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-25 09:09:16,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:16,451 INFO ]: With dead ends: 27 [2018-06-25 09:09:16,451 INFO ]: Without dead ends: 27 [2018-06-25 09:09:16,451 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:09:16,451 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:09:16,452 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-25 09:09:16,452 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:09:16,452 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-25 09:09:16,452 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 18 [2018-06-25 09:09:16,453 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:16,453 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-25 09:09:16,453 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:09:16,453 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-25 09:09:16,453 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:09:16,453 INFO ]: Found error trace [2018-06-25 09:09:16,453 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:16,453 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:16,453 INFO ]: Analyzing trace with hash 1259209670, now seen corresponding path program 6 times [2018-06-25 09:09:16,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:16,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:16,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:16,454 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:16,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:16,466 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:16,648 INFO ]: Checked inductivity of 66 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:16,648 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:16,648 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:16,653 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:09:16,684 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:09:16,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:16,686 INFO ]: Computing forward predicates... [2018-06-25 09:09:17,046 WARN ]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:09:17,049 INFO ]: Checked inductivity of 66 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:17,067 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:17,067 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-25 09:09:17,067 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:09:17,067 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:09:17,067 INFO ]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:09:17,067 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 16 states. [2018-06-25 09:09:17,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:17,246 INFO ]: Finished difference Result 30 states and 41 transitions. [2018-06-25 09:09:17,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:09:17,247 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-25 09:09:17,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:17,247 INFO ]: With dead ends: 30 [2018-06-25 09:09:17,247 INFO ]: Without dead ends: 30 [2018-06-25 09:09:17,247 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:09:17,247 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:09:17,248 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-06-25 09:09:17,248 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:09:17,248 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-25 09:09:17,248 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 18 [2018-06-25 09:09:17,249 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:17,249 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-25 09:09:17,249 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:09:17,249 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-25 09:09:17,249 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:09:17,249 INFO ]: Found error trace [2018-06-25 09:09:17,249 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:17,249 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:17,249 INFO ]: Analyzing trace with hash 385468990, now seen corresponding path program 9 times [2018-06-25 09:09:17,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:17,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:17,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:17,249 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:17,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:17,265 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:17,719 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:17,719 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:17,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:17,725 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:09:17,812 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 09:09:17,812 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:17,814 INFO ]: Computing forward predicates... [2018-06-25 09:09:18,301 WARN ]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:09:19,555 INFO ]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:19,574 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:19,574 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-06-25 09:09:19,574 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:09:19,574 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:09:19,574 INFO ]: CoverageRelationStatistics Valid=71, Invalid=233, Unknown=2, NotChecked=0, Total=306 [2018-06-25 09:09:19,574 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 18 states. [2018-06-25 09:09:21,533 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:21,533 INFO ]: Finished difference Result 26 states and 37 transitions. [2018-06-25 09:09:21,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:09:21,533 INFO ]: Start accepts. Automaton has 18 states. Word has length 18 [2018-06-25 09:09:21,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:21,534 INFO ]: With dead ends: 26 [2018-06-25 09:09:21,534 INFO ]: Without dead ends: 21 [2018-06-25 09:09:21,534 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=78, Invalid=262, Unknown=2, NotChecked=0, Total=342 [2018-06-25 09:09:21,534 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:09:21,535 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:09:21,535 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:09:21,535 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-06-25 09:09:21,535 INFO ]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 18 [2018-06-25 09:09:21,535 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:21,535 INFO ]: Abstraction has 21 states and 30 transitions. [2018-06-25 09:09:21,535 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:09:21,535 INFO ]: Start isEmpty. Operand 21 states and 30 transitions. [2018-06-25 09:09:21,535 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:09:21,535 INFO ]: Found error trace [2018-06-25 09:09:21,535 INFO ]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:21,535 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:21,535 INFO ]: Analyzing trace with hash 946581450, now seen corresponding path program 6 times [2018-06-25 09:09:21,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:21,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:21,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:21,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:21,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:21,547 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:22,031 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:22,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:22,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:22,036 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:09:22,068 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:09:22,068 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:22,070 INFO ]: Computing forward predicates... [2018-06-25 09:09:22,690 WARN ]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:09:23,132 INFO ]: Checked inductivity of 66 backedges. 0 proven. 65 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:23,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:23,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-25 09:09:23,150 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:09:23,150 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:09:23,151 INFO ]: CoverageRelationStatistics Valid=73, Invalid=198, Unknown=1, NotChecked=0, Total=272 [2018-06-25 09:09:23,151 INFO ]: Start difference. First operand 21 states and 30 transitions. Second operand 17 states. [2018-06-25 09:09:23,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:23,954 INFO ]: Finished difference Result 26 states and 35 transitions. [2018-06-25 09:09:23,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:09:23,954 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-25 09:09:23,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:23,954 INFO ]: With dead ends: 26 [2018-06-25 09:09:23,954 INFO ]: Without dead ends: 21 [2018-06-25 09:09:23,954 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=226, Unknown=1, NotChecked=0, Total=306 [2018-06-25 09:09:23,954 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:09:23,955 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:09:23,955 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:09:23,955 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-25 09:09:23,955 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 18 [2018-06-25 09:09:23,955 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:23,955 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-25 09:09:23,955 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:09:23,955 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-25 09:09:23,956 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:09:23,956 INFO ]: Found error trace [2018-06-25 09:09:23,956 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:23,956 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:23,956 INFO ]: Analyzing trace with hash -2056469106, now seen corresponding path program 8 times [2018-06-25 09:09:23,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:23,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:23,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:23,956 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:23,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:23,966 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:25,057 INFO ]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:25,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:25,057 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:25,063 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:09:25,092 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:09:25,092 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:25,094 INFO ]: Computing forward predicates... [2018-06-25 09:09:25,252 INFO ]: Checked inductivity of 78 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:25,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:25,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-06-25 09:09:25,271 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:09:25,271 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:09:25,271 INFO ]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:09:25,271 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 17 states. [2018-06-25 09:09:25,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:25,368 INFO ]: Finished difference Result 30 states and 38 transitions. [2018-06-25 09:09:25,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:09:25,369 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-25 09:09:25,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:25,369 INFO ]: With dead ends: 30 [2018-06-25 09:09:25,369 INFO ]: Without dead ends: 30 [2018-06-25 09:09:25,369 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:09:25,369 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:09:25,370 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-06-25 09:09:25,370 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:09:25,370 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-06-25 09:09:25,370 INFO ]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 19 [2018-06-25 09:09:25,370 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:25,370 INFO ]: Abstraction has 20 states and 24 transitions. [2018-06-25 09:09:25,370 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:09:25,370 INFO ]: Start isEmpty. Operand 20 states and 24 transitions. [2018-06-25 09:09:25,370 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:09:25,370 INFO ]: Found error trace [2018-06-25 09:09:25,370 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:25,370 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:25,370 INFO ]: Analyzing trace with hash -695352070, now seen corresponding path program 10 times [2018-06-25 09:09:25,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:25,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:25,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:25,371 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:25,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:25,386 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:25,518 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:25,518 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:25,518 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:25,524 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:09:25,555 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:09:25,555 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:25,557 INFO ]: Computing forward predicates... [2018-06-25 09:09:26,230 WARN ]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-25 09:09:27,371 WARN ]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:09:28,676 WARN ]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-25 09:09:28,679 INFO ]: Checked inductivity of 78 backedges. 0 proven. 75 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:28,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:28,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-25 09:09:28,698 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:09:28,698 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:09:28,698 INFO ]: CoverageRelationStatistics Valid=81, Invalid=258, Unknown=3, NotChecked=0, Total=342 [2018-06-25 09:09:28,698 INFO ]: Start difference. First operand 20 states and 24 transitions. Second operand 19 states. [2018-06-25 09:09:32,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:32,423 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-25 09:09:32,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:09:32,425 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-25 09:09:32,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:32,425 INFO ]: With dead ends: 26 [2018-06-25 09:09:32,425 INFO ]: Without dead ends: 21 [2018-06-25 09:09:32,425 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=88, Invalid=289, Unknown=3, NotChecked=0, Total=380 [2018-06-25 09:09:32,425 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:09:32,426 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:09:32,426 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:09:32,426 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-25 09:09:32,426 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 19 [2018-06-25 09:09:32,426 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:32,426 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-25 09:09:32,426 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:09:32,426 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-25 09:09:32,427 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:09:32,427 INFO ]: Found error trace [2018-06-25 09:09:32,427 INFO ]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:32,427 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:32,427 INFO ]: Analyzing trace with hash -134239610, now seen corresponding path program 7 times [2018-06-25 09:09:32,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:32,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:32,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:32,427 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:32,427 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:32,452 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:32,926 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:32,926 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:32,926 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:32,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:32,962 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:32,965 INFO ]: Computing forward predicates... [2018-06-25 09:09:33,032 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:33,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:33,063 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-25 09:09:33,064 INFO ]: Interpolant automaton has 15 states [2018-06-25 09:09:33,064 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 09:09:33,064 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-25 09:09:33,064 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 15 states. [2018-06-25 09:09:33,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:33,214 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-25 09:09:33,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:09:33,214 INFO ]: Start accepts. Automaton has 15 states. Word has length 19 [2018-06-25 09:09:33,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:33,214 INFO ]: With dead ends: 25 [2018-06-25 09:09:33,214 INFO ]: Without dead ends: 25 [2018-06-25 09:09:33,214 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:09:33,214 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:09:33,215 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-25 09:09:33,215 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:09:33,215 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-06-25 09:09:33,215 INFO ]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2018-06-25 09:09:33,215 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:33,215 INFO ]: Abstraction has 22 states and 27 transitions. [2018-06-25 09:09:33,215 INFO ]: Interpolant automaton has 15 states. [2018-06-25 09:09:33,215 INFO ]: Start isEmpty. Operand 22 states and 27 transitions. [2018-06-25 09:09:33,216 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:09:33,216 INFO ]: Found error trace [2018-06-25 09:09:33,216 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:33,216 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:33,216 INFO ]: Analyzing trace with hash 158933438, now seen corresponding path program 11 times [2018-06-25 09:09:33,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:33,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:33,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:33,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:33,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:33,271 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:34,853 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:34,853 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:34,853 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:34,862 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:09:35,004 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-25 09:09:35,004 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:35,007 INFO ]: Computing forward predicates... [2018-06-25 09:09:35,084 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:35,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:35,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-25 09:09:35,103 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:09:35,103 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:09:35,103 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:09:35,103 INFO ]: Start difference. First operand 22 states and 27 transitions. Second operand 17 states. [2018-06-25 09:09:35,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:35,497 INFO ]: Finished difference Result 31 states and 40 transitions. [2018-06-25 09:09:35,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:09:35,497 INFO ]: Start accepts. Automaton has 17 states. Word has length 20 [2018-06-25 09:09:35,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:35,498 INFO ]: With dead ends: 31 [2018-06-25 09:09:35,498 INFO ]: Without dead ends: 31 [2018-06-25 09:09:35,498 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:09:35,498 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:09:35,499 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-06-25 09:09:35,499 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:09:35,499 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-25 09:09:35,499 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 20 [2018-06-25 09:09:35,499 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:35,499 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-25 09:09:35,499 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:09:35,499 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-25 09:09:35,499 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:09:35,499 INFO ]: Found error trace [2018-06-25 09:09:35,499 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:35,499 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:35,499 INFO ]: Analyzing trace with hash 720045898, now seen corresponding path program 8 times [2018-06-25 09:09:35,499 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:35,499 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:35,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:35,500 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:35,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:35,510 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:35,783 INFO ]: Checked inductivity of 91 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:35,783 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:35,783 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:35,789 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:09:35,822 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:09:35,822 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:35,824 INFO ]: Computing forward predicates... [2018-06-25 09:09:36,339 WARN ]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 09:09:36,777 WARN ]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-25 09:09:36,779 INFO ]: Checked inductivity of 91 backedges. 85 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:36,798 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:36,798 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-06-25 09:09:36,798 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:09:36,798 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:09:36,798 INFO ]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:09:36,799 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 19 states. [2018-06-25 09:09:37,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:37,618 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-25 09:09:37,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:09:37,618 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-25 09:09:37,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:37,618 INFO ]: With dead ends: 30 [2018-06-25 09:09:37,618 INFO ]: Without dead ends: 30 [2018-06-25 09:09:37,618 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-06-25 09:09:37,618 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 09:09:37,619 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 23. [2018-06-25 09:09:37,619 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:09:37,619 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-06-25 09:09:37,619 INFO ]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 20 [2018-06-25 09:09:37,619 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:37,620 INFO ]: Abstraction has 23 states and 32 transitions. [2018-06-25 09:09:37,620 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:09:37,620 INFO ]: Start isEmpty. Operand 23 states and 32 transitions. [2018-06-25 09:09:37,620 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:09:37,620 INFO ]: Found error trace [2018-06-25 09:09:37,620 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:37,620 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:37,620 INFO ]: Analyzing trace with hash 655401770, now seen corresponding path program 9 times [2018-06-25 09:09:37,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:37,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:37,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:37,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:37,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:37,632 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:38,520 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:38,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:38,520 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:38,525 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:09:38,564 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-25 09:09:38,564 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:38,566 INFO ]: Computing forward predicates... [2018-06-25 09:09:39,332 WARN ]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 09:09:40,619 WARN ]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-25 09:09:42,014 WARN ]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-25 09:09:42,017 INFO ]: Checked inductivity of 91 backedges. 0 proven. 89 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:42,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:42,036 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-25 09:09:42,036 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:09:42,036 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:09:42,036 INFO ]: CoverageRelationStatistics Valid=92, Invalid=286, Unknown=2, NotChecked=0, Total=380 [2018-06-25 09:09:42,036 INFO ]: Start difference. First operand 23 states and 32 transitions. Second operand 20 states. [2018-06-25 09:09:42,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:42,234 INFO ]: Finished difference Result 29 states and 38 transitions. [2018-06-25 09:09:42,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:09:42,234 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-25 09:09:42,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:42,234 INFO ]: With dead ends: 29 [2018-06-25 09:09:42,234 INFO ]: Without dead ends: 23 [2018-06-25 09:09:42,235 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=99, Invalid=319, Unknown=2, NotChecked=0, Total=420 [2018-06-25 09:09:42,235 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:09:42,235 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:09:42,235 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:09:42,236 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-25 09:09:42,236 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 20 [2018-06-25 09:09:42,236 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:42,236 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-25 09:09:42,236 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:09:42,236 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-25 09:09:42,236 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:09:42,236 INFO ]: Found error trace [2018-06-25 09:09:42,236 INFO ]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:42,236 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:42,236 INFO ]: Analyzing trace with hash 1216514230, now seen corresponding path program 7 times [2018-06-25 09:09:42,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:42,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:42,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:42,237 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:09:42,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:42,247 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:42,551 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:42,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:42,551 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:42,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:42,587 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:42,589 INFO ]: Computing forward predicates... [2018-06-25 09:09:42,936 WARN ]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 09:09:44,019 WARN ]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-25 09:09:45,350 WARN ]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-25 09:09:45,353 INFO ]: Checked inductivity of 91 backedges. 0 proven. 89 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:45,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:09:45,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 20 [2018-06-25 09:09:45,373 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:09:45,373 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:09:45,373 INFO ]: CoverageRelationStatistics Valid=92, Invalid=286, Unknown=2, NotChecked=0, Total=380 [2018-06-25 09:09:45,373 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 20 states. [2018-06-25 09:09:47,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:09:47,919 INFO ]: Finished difference Result 29 states and 36 transitions. [2018-06-25 09:09:47,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:09:47,919 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-25 09:09:47,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:09:47,920 INFO ]: With dead ends: 29 [2018-06-25 09:09:47,920 INFO ]: Without dead ends: 23 [2018-06-25 09:09:47,920 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=106, Invalid=354, Unknown=2, NotChecked=0, Total=462 [2018-06-25 09:09:47,920 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:09:47,921 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:09:47,922 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:09:47,922 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-25 09:09:47,922 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 20 [2018-06-25 09:09:47,922 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:09:47,922 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-25 09:09:47,922 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:09:47,922 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-25 09:09:47,922 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:09:47,922 INFO ]: Found error trace [2018-06-25 09:09:47,922 INFO ]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:09:47,922 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:09:47,923 INFO ]: Analyzing trace with hash 871980410, now seen corresponding path program 12 times [2018-06-25 09:09:47,923 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:09:47,923 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:09:47,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:47,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:09:47,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:09:47,936 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:48,236 INFO ]: Checked inductivity of 105 backedges. 59 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:09:48,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:09:48,236 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:48,241 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-06-25 09:09:48,282 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-25 09:09:48,282 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:09:48,285 INFO ]: Computing forward predicates... [2018-06-25 09:09:48,285 INFO ]: Timeout while computing interpolants [2018-06-25 09:09:48,486 WARN ]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:09:48,486 WARN ]: Verification canceled [2018-06-25 09:09:48,490 WARN ]: Timeout [2018-06-25 09:09:48,490 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:09:48 BoogieIcfgContainer [2018-06-25 09:09:48,490 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:09:48,491 INFO ]: Toolchain (without parser) took 62840.92 ms. Allocated memory was 305.1 MB in the beginning and 595.1 MB in the end (delta: 289.9 MB). Free memory was 259.7 MB in the beginning and 336.8 MB in the end (delta: -77.1 MB). Peak memory consumption was 212.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:09:48,492 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:09:48,492 INFO ]: ChcToBoogie took 55.43 ms. Allocated memory is still 305.1 MB. Free memory was 258.7 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:09:48,492 INFO ]: Boogie Preprocessor took 44.91 ms. Allocated memory is still 305.1 MB. Free memory was 256.6 MB in the beginning and 255.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-25 09:09:48,493 INFO ]: RCFGBuilder took 408.18 ms. Allocated memory is still 305.1 MB. Free memory was 255.7 MB in the beginning and 241.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:09:48,493 INFO ]: TraceAbstraction took 62323.54 ms. Allocated memory was 305.1 MB in the beginning and 595.1 MB in the end (delta: 289.9 MB). Free memory was 241.6 MB in the beginning and 336.8 MB in the end (delta: -95.1 MB). Peak memory consumption was 194.8 MB. Max. memory is 3.6 GB. [2018-06-25 09:09:48,502 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.43 ms. Allocated memory is still 305.1 MB. Free memory was 258.7 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.91 ms. Allocated memory is still 305.1 MB. Free memory was 256.6 MB in the beginning and 255.7 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 408.18 ms. Allocated memory is still 305.1 MB. Free memory was 255.7 MB in the beginning and 241.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62323.54 ms. Allocated memory was 305.1 MB in the beginning and 595.1 MB in the end (delta: 289.9 MB). Free memory was 241.6 MB in the beginning and 336.8 MB in the end (delta: -95.1 MB). Peak memory consumption was 194.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 22 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 62.2s OverallTime, 52 OverallIterations, 10 TraceHistogramMax, 21.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 456 SDtfs, 211 SDslu, 1577 SDs, 0 SdLazy, 4983 SolverSat, 891 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1101 GetRequests, 393 SyntacticMatches, 206 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 34.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 51 MinimizatonAttempts, 160 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 1310 NumberOfCodeBlocks, 1310 NumberOfCodeBlocksAsserted, 186 NumberOfCheckSat, 1215 ConstructedInterpolants, 76 QuantifiedInterpolants, 85178 SizeOfPredicates, 119 NumberOfNonLiveVariables, 9713 ConjunctsInSsa, 1431 ConjunctsInUnsatCore, 95 InterpolantComputations, 10 PerfectInterpolantSequences, 708/3232 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-09-48-514.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-09-48-514.csv Completed graceful shutdown